Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userViolation of Lee-Yang circle theorem for Ising phase transitions on complex networks
341
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The Ising model on annealed complex networks with degree distribution decaying algebraically as $p(K)sim K^{-lambda}$ has a second-order phase transition at finite temperature if $lambda> 3$. In the absence of space dimensionality, $lambda$ controls the transition strength; mean-field theory applies for $lambda >5$ but critical exponents are $lambda$-dependent if $lambda < 5$. Here we show that, as for regular lattices, the celebrated Lee-Yang circle theorem is obeyed for the former case. However, unlike on regular lattices where it is independent of dimensionality, the circle theorem fails on complex networks when $lambda < 5$. We discuss the importance of this result for both theory and experiments on phase transitions and critical phenomena. We also investigate the finite-size scaling of Lee-Yang zeros in both regimes as well as the multiplicative logarithmic corrections which occur at $lambda=5$.
rate research
Read More
The Potts model is one of the most popular spin models of statistical physics. The prevailing majority of work done so far corresponds to the lattice version of the model. However, many natural or man-made systems are much better described by the topology of a network. We consider the q-state Potts model on an uncorrelated scale-free network for which the node-degree distribution manifests a power-law decay governed by the exponent lambda. We work within the mean-field approximation, since for systems on random uncorrelated scale-free networks this method is known to often give asymptotically exact results. Depending on particular values of q and lambda one observes either a first-order or a second-order phase transition or the system is ordered at any finite temperature. In a case study, we consider the limit q=1 (percolation) and find a correspondence between the magnetic exponents and those describing percolation on a scale-free network. Interestingly, logarithmic corrections to scaling appear at lambda=4 in this case.
We explore a class of random tensor network models with ``stabilizer local tensors which we name Random Stabilizer Tensor Networks (RSTNs). For RSTNs defined on a two-dimensional square lattice, we perform extensive numerical studies of entanglement phase transitions between volume-law and area-law entangled phases of the one-dimensional boundary states. These transitions occur when either (a) the bond dimension $D$ of the constituent tensors is varied, or (b) the tensor network is subject to random breaking of bulk bonds, implemented by forced measurements. In the absence of broken bonds, we find that the RSTN supports a volume-law entangled boundary state with bond dimension $Dgeq3$ where $D$ is a prime number, and an area-law entangled boundary state for $D=2$. Upon breaking bonds at random in the bulk with probability $p$, there exists a critical measurement rate $p_c$ for each $Dgeq 3$ above which the boundary state becomes area-law entangled. To explore the conformal invariance at these entanglement transitions for different prime $D$, we consider tensor networks on a finite rectangular geometry with a variety of boundary conditions, and extract universal operator scaling dimensions via extensive numerical calculations of the entanglement entropy, mutual information and mutual negativity at their respective critical points. Our results at large $D$ approach known universal data of percolation conformal field theory, while showing clear discrepancies at smaller $D$, suggesting a distinct entanglement transition universality class for each prime $D$. We further study universal entanglement properties in the volume-law phase and demonstrate quantitative agreement with the recently proposed description in terms of a directed polymer in a random environment.
The Ising model, with short-range interactions between constituents, is a basic mathematical model in statistical mechanics. It has been widely used to describe collective phenomena such as order-disorder phase transitions in various physical, biological, economical, and social systems. However, it was proven that spontaneous phase transitions do not exist in the one-dimensional Ising models. Besides low dimensionality, frustration is the other well-known suppressor of phase transitions. Here I show that surprisingly, a strongly frustrated one-dimensional two-leg ladder Ising model can exhibit a marginal finite-temperature phase transition. It features a large latent heat, a sharp peak in specific heat, and unconventional order parameters, which classify the transition as involving an entropy-favored intermediate-temperature ordered state and further unveil a crossover to an exotic normal state in which frustration effectively decouples the two strongly interacted legs in a counterintuitive non-mean-field way. These exact results expose a mathematical structure that has not appeared before in phase-transition problems, and shed new light on our understanding of phase transitions and the dynamical actions of frustration. Applications of this model and its mechanisms to various systems with extensions to consider higher dimensions, quantum characters, or external fields, etc. are anticipated and briefly discussed---with insights into the puzzling phenomena of strange strong frustration and intermediate-temperature orders such as the Bozin-Billinge orbital-degeneracy-lifting recently discovered in real materials.
We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong clustering in complex networks emerge naturally as simple reflections of the negative curvature and metric property of the underlying hyperbolic geometry. Conversely, we show that if a network has some metric structure, and if the network degree distribution is heterogeneous, then the network has an effective hyperbolic geometry underneath. We then establish a mapping between our geometric framework and statistical mechanics of complex networks. This mapping interprets edges in a network as non-interacting fermions whose energies are hyperbolic distances between nodes, while the auxiliary fields coupled to edges are linear functions of these energies or distances. The geometric network ensemble subsumes the standard configuration model and classical random graphs as two limiting cases with degenerate geometric structures. Finally, we show that targeted transport processes without global topology knowledge, made possible by our geometric framework, are maximally efficient, according to all efficiency measures, in networks with strongest heterogeneity and clustering, and that this efficiency is remarkably robust with respect to even catastrophic disturbances and damages to the network structure.
We show that heterogeneous degree distributions in observed scale-free topologies of complex networks can emerge as a consequence of the exponential expansion of hidden hyperbolic space. Fermi-Dirac statistics provides a physical interpretation of hyperbolic distances as energies of links. The hidden space curvature affects the heterogeneity of the degree distribution, while clustering is a function of temperature. We embed the Internet into the hyperbolic plane, and find a remarkable congruency between the embedding and our hyperbolic model. Besides proving our model realistic, this embedding may be used for routing with only local information, which holds significant promise for improving the performance of Internet routing.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
