Thermal phase transitions for Dicke-type models in the ultra-strong coupling limit

We consider the Dicke model in the ultra-strong coupling limit to investigate thermal phase transitions and their precursors at finite particle numbers $N$ for bosonic and fermionic systems. We derive partition functions with degeneracy factors that account for the number of configurations and derive explicit expressions for the Landau free energy. This allows us to discuss the difference between the original Dicke (fermionic) and the bosonic case. We find a crossover between these two cases that shows up, e.g., in the specific heat.Comment: 4 pages Brief Report styl

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

Non-equilibrium entanglement in a driven Dicke model

We study the entanglement dynamics in the externally-driven single-mode Dicke model in the thermodynamic limit, when the field is in resonance with the atoms. We compute the correlations in the atoms-field ground state by means of the density operator that represents the pure state of the universe and the reduced density operator for the atoms, which results from taking the partial trace over the field coordinates. As a measure of bipartite entanglement, we calculate the linear entropy, from which we analyze the entanglement dynamics. In particular, we found a strong relation between the stability of the dynamical parameters and the reported entanglement.Comment: Contribution to the SLAFES XIX. This version to appear in J. Phys.: Conference Serie

Phase Transitions in Generalised Spin-Boson (Dicke) Models

We consider a class of generalised single mode Dicke Hamiltonians with arbitrary boson coupling in the pseudo-spin $x$-$z$ plane. We find exact solutions in the thermodynamic, large-spin limit as a function of the coupling angle, which allows us to continuously move between the simple dephasing and the original Dicke Hamiltonians. Only in the latter case (orthogonal static and fluctuating couplings), does the parity-symmetry induced quantum phase transition occur.Comment: 6 pages, 5 figue

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