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

Statistical analysis of 22 public transport networks in Poland

Public transport systems in 22 Polish cities have been analyzed. Sizes of these networks range from N=152 to N=2881. Depending on the assumed definition of network topology the degree distribution can follow a power law or can be described by an exponential function. Distributions of paths in all considered networks are given by asymmetric, unimodal functions. Clustering, assortativity and betweenness are studied. All considered networks exhibit small world behavior and are hierarchically organized. A transition between dissortative small networks N=500 is observed.Comment: 11 pages, 17 figures, 2 tables, REVTEX4 forma

Simultaneous Embeddability of Two Partitions

We study the simultaneous embeddability of a pair of partitions of the same underlying set into disjoint blocks. Each element of the set is mapped to a point in the plane and each block of either of the two partitions is mapped to a region that contains exactly those points that belong to the elements in the block and that is bounded by a simple closed curve. We establish three main classes of simultaneous embeddability (weak, strong, and full embeddability) that differ by increasingly strict well-formedness conditions on how different block regions are allowed to intersect. We show that these simultaneous embeddability classes are closely related to different planarity concepts of hypergraphs. For each embeddability class we give a full characterization. We show that (i) every pair of partitions has a weak simultaneous embedding, (ii) it is NP-complete to decide the existence of a strong simultaneous embedding, and (iii) the existence of a full simultaneous embedding can be tested in linear time.Comment: 17 pages, 7 figures, extended version of a paper to appear at GD 201

Spin entangled two-particle dark state in quantum transport through coupled quantum dots

We present a transport setup of coupled quantum dots that enables the creation of spatially separated spin-entangled two-electron dark states. We prove the existence of an entangled transport dark state by investigating the system Hamiltonian without coupling to the electronic reservoirs. In the transport regime the entangled dark state which corresponds to a singlet has a strongly enhanced Fano factor compared to the dark state which corresponds to a mixture of the triplet states. Furthermore we calculate the concurrence of the occupying electrons to show the degree of entanglement in the transport regime.Comment: 9 pages and 3 figure

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

Character of eigenstates of the 3D disordered Anderson Hamiltonian

We study numerically the character of electron eigenstates of the three dimensional disordered Anderson model. Analysis of the statistics of inverse participation ratio as well as numerical evaluation of the electron-hole correlation function confirm that there are no localized states below the mobility edge, as well as no metallic state in the tail of the conductive band. We discuss also finite size effects observed in the analysis of all the discussed quantities.Comment: 7 pages, 9 figures, resubmitted to Physical Review

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.

A Sparse Stress Model

Force-directed layout methods constitute the most common approach to draw general graphs. Among them, stress minimization produces layouts of comparatively high quality but also imposes comparatively high computational demands. We propose a speed-up method based on the aggregation of terms in the objective function. It is akin to aggregate repulsion from far-away nodes during spring embedding but transfers the idea from the layout space into a preprocessing phase. An initial experimental study informs a method to select representatives, and subsequent more extensive experiments indicate that our method yields better approximations of minimum-stress layouts in less time than related methods.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016