Fully-dynamic Approximation of Betweenness Centrality

Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths. Since an exact computation is prohibitive in large networks, several approximation algorithms have been proposed. Besides that, recent years have seen the publication of dynamic algorithms for efficient recomputation of betweenness in evolving networks. In previous work we proposed the first semi-dynamic algorithms that recompute an approximation of betweenness in connected graphs after batches of edge insertions. In this paper we propose the first fully-dynamic approximation algorithms (for weighted and unweighted undirected graphs that need not to be connected) with a provable guarantee on the maximum approximation error. The transfer to fully-dynamic and disconnected graphs implies additional algorithmic problems that could be of independent interest. In particular, we propose a new upper bound on the vertex diameter for weighted undirected graphs. For both weighted and unweighted graphs, we also propose the first fully-dynamic algorithms that keep track of such upper bound. In addition, we extend our former algorithm for semi-dynamic BFS to batches of both edge insertions and deletions. Using approximation, our algorithms are the first to make in-memory computation of betweenness in fully-dynamic networks with millions of edges feasible. Our experiments show that they can achieve substantial speedups compared to recomputation, up to several orders of magnitude

Mycoplasma Mastitis in Dairy Cattle

Mastitis is defined as inflammation of the mammary gland, usually due to microbial infection. Many organisms have been known to cause mastitis including bacteria, fungi, and yeast. Mastitis is the most economically important disease of the dairy industry, the condition has been estimated to cause as much as two billion dollars in lost income for United States dairy producers at a cost of $181 per cow per year. The biggest losses are due to lowered production, but discarded milk, drugs, veterinary costs, and premature culling also contribute to the losses. More than 130 different microorganisms have been isolated from the mammary gland of the bovine with the majority of infections due to staphylococci, streptococci, and coliforms. However, mycoplasmas have begun to cause significant problems in some dairies. The first reported cases of mycoplasma mastitis were in Europe in 1960. Since that time it has been found all around the world, including the United States. Traditionally, California was most affected, but the disease has now become a problem across the entire country

Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality

We consider the all pairs all shortest paths (APASP) problem, which maintains the shortest path dag rooted at every vertex in a directed graph G=(V,E) with positive edge weights. For this problem we present a decremental algorithm (that supports the deletion of a vertex, or weight increases on edges incident to a vertex). Our algorithm runs in amortized O(\vstar^2 \cdot \log n) time per update, where n=|V|, and \vstar bounds the number of edges that lie on shortest paths through any given vertex. Our APASP algorithm can be used for the decremental computation of betweenness centrality (BC), a graph parameter that is widely used in the analysis of large complex networks. No nontrivial decremental algorithm for either problem was known prior to our work. Our method is a generalization of the decremental algorithm of Demetrescu and Italiano [DI04] for unique shortest paths, and for graphs with \vstar =O(n), we match the bound in [DI04]. Thus for graphs with a constant number of shortest paths between any pair of vertices, our algorithm maintains APASP and BC scores in amortized time O(n^2 \log n) under decremental updates, regardless of the number of edges in the graph.Comment: An extended abstract of this paper will appear in Proc. ISAAC 201

Current noise of a quantum dot p-i-n junction in a photonic crystal

The shot-noise spectrum of a quantum dot p-i-n junction embedded inside a three-dimensional photonic crystal is investigated. Radiative decay properties of quantum dot excitons can be obtained from the observation of the current noise. The characteristic of the photonic band gap is revealed in the current noise with discontinuous behavior. Applications of such a device in entanglement generation and emission of single photons are pointed out, and may be achieved with current technologies.Comment: 4 pages, 3 figures, to appear in Phys. Rev. B (2005

Non-equilibrium Entanglement and Noise in Coupled Qubits

We study charge entanglement in two Coulomb-coupled double quantum dots in thermal equilibrium and under stationary non-equilibrium transport conditions. In the transport regime, the entanglement exhibits a clear switching threshold and various limits due to suppression of tunneling by Quantum Zeno localisation or by an interaction induced energy gap. We also calculate quantum noise spectra and discuss the inter-dot current correlation as an indicator of the entanglement in transport experiments.Comment: 4 pages, 4 figure

Adiabatic steering and determination of dephasing rates in double dot qubits

We propose a scheme to prepare arbitrary superpositions of quantum states in double quantum--dots irradiated by coherent microwave pulses. Solving the equations of motion for the dot density matrix, we find that dephasing rates for such superpositions can be quantitatively infered from additional electron current pulses that appear due to a controllable breakdown of coherent population trapping in the dots.Comment: 5 pages, 4 figures. To appear in Phys. Rev.

Universal oscillations in counting statistics

Noise is a result of stochastic processes that originate from quantum or classical sources. Higher-order cumulants of the probability distribution underlying the stochastic events are believed to contain details that characterize the correlations within a given noise source and its interaction with the environment, but they are often difficult to measure. Here we report measurements of the transient cumulants > of the number n of passed charges to very high orders (up to m=15) for electron transport through a quantum dot. For large m, the cumulants display striking oscillations as functions of measurement time with magnitudes that grow factorially with m. Using mathematical properties of high-order derivatives in the complex plane we show that the oscillations of the cumulants in fact constitute a universal phenomenon, appearing as functions of almost any parameter, including time in the transient regime. These ubiquitous oscillations and the factorial growth are system-independent and our theory provides a unified interpretation of previous theoretical studies of high-order cumulants as well as our new experimental data.Comment: 19 pages, 4 figures, final version as published in PNA

The Parameterized Complexity of Centrality Improvement in Networks

The centrality of a vertex v in a network intuitively captures how important v is for communication in the network. The task of improving the centrality of a vertex has many applications, as a higher centrality often implies a larger impact on the network or less transportation or administration cost. In this work we study the parameterized complexity of the NP-complete problems Closeness Improvement and Betweenness Improvement in which we ask to improve a given vertex' closeness or betweenness centrality by a given amount through adding a given number of edges to the network. Herein, the closeness of a vertex v sums the multiplicative inverses of distances of other vertices to v and the betweenness sums for each pair of vertices the fraction of shortest paths going through v. Unfortunately, for the natural parameter "number of edges to add" we obtain hardness results, even in rather restricted cases. On the positive side, we also give an island of tractability for the parameter measuring the vertex deletion distance to cluster graphs

Current-Induced Entanglement of Nuclear Spins in Quantum Dots

We propose an entanglement mechanism of nuclear spins in quantum dots driven by the electric current accompanied by the spin flip. This situation is relevant to a leakage current in spin-blocked regions where electrons cannot be transported unless their spins are flipped. The current gradually increases the components of larger total spin of nuclei. This correlation among the nuclear spins markedly enhances the spin-flip rate of electrons and hence the leakage current. The enhancement of the current is observable when the residence time of electrons in the quantum dots is shorter than the dephasing time T*_2 of nuclear spins.Comment: 4 pages, 4 figure