Bose-Einstein condensation on inhomogeneous amenable graphs. (English) Zbl 1223.82012

The authors investigate the Bose-Einstein condensation on nonhomogeneous amenable networks for the model describing arrays of Josephson junctions. Here the network is described by an infinite topological graph \(X,\) where it is considered free bosons described by the Canonical Commutation Relations on \(l^2(VX)\) and pure hopping Hamiltonian is the free Hamiltonian described on the one particle space \(l^2(VX),\) by \(H=||A||I-A,\) where \(A\) is the adjacency operator acting on \(l^2(VX).\) It is proved that for the nonhomogeneous networks like the comb graphs, particles condensate in momentum and configuration as well. In this case different properties of the network, of geometric and probabilistic nature, such as the volume growth, the shape of the ground state, and the transience, all play a role in the condensation phenomena.


82B20 Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics
82B10 Quantum equilibrium statistical mechanics (general)
46L60 Applications of selfadjoint operator algebras to physics
Full Text: DOI arXiv


[1] DOI: 10.1142/S0219025704001645 · Zbl 1073.81057
[2] DOI: 10.1007/978-3-662-02313-6
[3] DOI: 10.1007/978-3-662-09089-3
[4] DOI: 10.1088/0953-4075/34/23/314
[5] DOI: 10.1016/j.jfa.2011.04.007 · Zbl 1229.47020
[6] DOI: 10.1016/j.jfa.2008.07.011 · Zbl 1233.11095
[7] Hora A., Quantum Probability and Spectral Analysis on Graphs (2007) · Zbl 1141.81005
[8] DOI: 10.1007/978-3-662-04687-6
[9] DOI: 10.1142/S0219025706002202 · Zbl 1093.82003
[10] DOI: 10.1007/978-3-642-74346-7
[11] Pedersen G. K., C*-Algebras and Their Automorphism Groups (1979)
[12] Reed M., Analysis of Operators (1978) · Zbl 0401.47001
[13] E. Seneta, Non-Negative Matrices and Markov Chains (Springer-Verlag) p. 1981.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.