Noise enhancement due to quantum coherence in coupled quantum dots

We show that the intriguing observation of noise enhancement in the charge transport through two vertically coupled quantum dots can be explained by the interplay of quantum coherence and strong Coulomb blockade. We demonstrate that this novel mechanism for super-Poissonian charge transfer is very sensitive to decoherence caused by electron-phonon scattering as inferred from the measured temperature dependence.Comment: 4 pages, 3 figures, corrected version (Figs.2 and 3

Finite-Size Scaling Exponents in the Dicke Model

We consider the finite-size corrections in the Dicke model and determine the scaling exponents at the critical point for several quantities such as the ground state energy or the gap. Therefore, we use the Holstein-Primakoff representation of the angular momentum and introduce a nonlinear transformation to diagonalize the Hamiltonian in the normal phase. As already observed in several systems, these corrections turn out to be singular at the transition point and thus lead to nontrivial exponents. We show that for the atomic observables, these exponents are the same as in the Lipkin-Meshkov-Glick model, in agreement with numerical results. We also investigate the behavior of the order parameter related to the radiation mode and show that it is driven by the same scaling variable as the atomic one.Comment: 4 pages, published versio

Truncation method for Green's functions in time-dependent fields

We investigate the influence of a time dependent, homogeneous electric field on scattering properties of non-interacting electrons in an arbitrary static potential. We develop a method to calculate the (Keldysh) Green's function in two complementary approaches. Starting from a plane wave basis, a formally exact solution is given in terms of the inverse of a matrix containing infinitely many 'photoblocks' which can be evaluated approximately by truncation. In the exact eigenstate basis of the scattering potential, we obtain a version of the Floquet state theory in the Green's functions language. The formalism is checked for cases such as a simple model of a double barrier in a strong electric field. Furthermore, an exact relation between the inelastic scattering rate due to the microwave and the AC conductivity of the system is derived which in particular holds near or at a metal-insulator transition in disordered systems.Comment: to appear in Phys. Rev. B., 21 pages, 3 figures (ps-files

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

Lombardi Drawings of Graphs

We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line segments or polylines, and the vertices have perfect angular resolution: the edges are equally spaced around each vertex. We describe algorithms for finding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs.Comment: Expanded version of paper appearing in the 18th International Symposium on Graph Drawing (GD 2010). 13 pages, 7 figure

Comment on ``Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality"

In this comment, we investigate a common used algorithm proposed by Newman [M. E. J. Newman, Phys. Rev. E {\bf 64}, 016132(2001)] to calculate the betweenness centrality for all vertices. The inaccurateness of Newman's algorithm is pointed out and a corrected algorithm, also with O($MN$) time complexity, is given. In addition, the comparison of calculating results for these two algorithm aiming the protein interaction network of Yeast is shown.Comment: 3 pages, 2 tables, and 2 figure

Frequency-dependent counting statistics in interacting nanoscale conductors

We present a formalism to calculate finite-frequency current correlations in interacting nanoscale conductors. We work within the n-resolved density matrix approach and obtain a multi-time cumulant generating function that provides the fluctuation statistics, solely from the spectral decomposition of the Liouvillian. We apply the method to the frequency-dependent third cumulant of the current through a single resonant level and through a double quantum dot. Our results, which show that deviations from Poissonian behaviour strongly depend on frequency, demonstrate the importance of finite-frequency higher-order cumulants in fully characterizing interactions.Comment: 4 pages, 2 figures, improved figures & discussion. J-ref adde

Dicke Effect in the Tunnel Current through two Double Quantum Dots

We calculate the stationary current through two double quantum dots which are interacting via a common phonon environment. Numerical and analytical solutions of a master equation in the stationary limit show that the current can be increased as well as decreased due to a dissipation mediated interaction. This effect is closely related to collective, spontaneous emission of phonons (Dicke super- and subradiance effect), and the generation of a `cross-coherence' with entanglement of charges in singlet or triplet states between the dots. Furthermore, we discuss an inelastic `current switch' mechanism by which one double dot controls the current of the other.Comment: 12 pages, 6 figures, to appear in Phys. Rev.

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

On generating functions in additive number theory, II: lower-order terms and applications to PDEs

We obtain asymptotics for sums of the formSigma(p)(n=1) e(alpha(k) n(k) + alpha(1)n),involving lower order main terms. As an application, we show that for almost all alpha(2) is an element of [0, 1) one hassup(alpha 1 is an element of[0,1)) | Sigma(1 \u3c= n \u3c= P) e(alpha(1)(n(3) + n) + alpha(2)n(3))| \u3c\u3c P3/4+epsilon,and that in a suitable sense this is best possible. This allows us to improve bounds for the fractal dimension of solutions to the Schrodinger and Airy equations