Related papers: Kertesz on Fat Graphs?
Majority bootstrap percolation is a monotone cellular automata that can be thought of as a model of infection spreading in networks. Starting with an initially infected set, new vertices become infected once more than half of their…
We consider the ground-state properties of the s=1/2 Ising chain in a transverse field which varies regularly along the chain having a period of alternation 2. Such a model, similarly to its uniform counterpart, exhibits quantum phase…
We explore the cooperative behaviour and phase transitions of interacting networks by studying a simplified model consisting of Ising spins placed on the nodes of two coupled Erd\"os-R\'enyi random graphs. We derive analytical expressions…
We study the random connection model on hyperbolic space $\mathbb{H}^d$ in dimension $d=2,3$. Vertices of the spatial random graph are given as a Poisson point process with intensity $\lambda>0$. Upon variation of $\lambda$ there is a…
Phase transitions are a central theme of statistical mechanics, and of probability more generally. Lattice spin models represent a general paradigm for phase transitions in finite dimensions, describing ferromagnets and even some fluids…
A road map to understand the relation between the onset of the superconducting state with the particular optimum heterogeneity in granular superconductors is to study a Random Tranverse Ising Model on complex networks with a scale-free…
The Ising antiferromagnet is an important statistical physics model with close connections to the {\sc Max Cut} problem. Combining spatial mixing arguments with the method of moments and the interpolation method, we pinpoint the replica…
We analyze the ground state phase diagram of attractive lattice bosons, which are stabilized by a three-body onsite hardcore constraint. A salient feature of this model is an Ising type transition from a conventional atomic superfluid to a…
We study two-dimensional ferromagnetic Ising model on a series of regular lattices, which are represented as the tessellation of polygons with p>=5 sides, such as pentagons (p=5), hexagons (p=6), etc. Such lattices are on hyperbolic planes,…
The percolation study offers valuable insights into the characteristics of phase transition, shedding light on the underlying mechanisms that govern the formation of global connectivity within the system. We explore the percolation phase…
To gain a better understanding of the interplay between frustrated long-range interactions and zero-temperature quantum fluctuations, we investigate the ground-state phase diagram of the transverse-field Ising model with…
We consider the Ising model for two interacting groups of spins embedded in an Erd\"{o}s-R\'{e}nyi random graph. The critical properties of the system are investigated by means of extensive Monte Carlo simulations. Our results evidence the…
Magnetic phenomena of the superantiferromagnetic Ising model in both uniform longitudinal ($H$) and transverse ($\Omega $) magnetic fields are studied by employing a mean-field variational approach based on Peierls-Bogoliubov inequality for…
We investigate the geometry of a typical spin cluster in random triangulations sampled with a probability proportional to the energy of an Ising configuration on their vertices, both in the finite and infinite volume settings. This model is…
One of the most well-known classical results for site percolation on the square lattice is the equation p_c + p_c^* = 1. In words, this equation means that for all values different from p_c of the parameter p the following holds: Either…
We study graphical representations for two related models. The first model is the transverse field quantum Ising model, an extension of the original Ising model which was introduced by Lieb, Schultz and Mattis in the 1960's. The second…
Using Monte Carlo techniques and a star-triangle transformation, Ising models with random, 'strong' and 'weak', nearest-neighbour ferromagnetic couplings on a square lattice with a (1,1) surface are studied near the phase transition. Both…
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…
We find the exact critical temperature $T_c$ of the nearest-neighbor ferromagnetic Ising model on an `equilibrium' random graph with an arbitrary degree distribution $P(k)$. We observe an anomalous behavior of the magnetization, magnetic…
Information percolation is a new method for analyzing stochastic spin systems through classifying and controlling the clusters of information-flow in the space-time slab. It yielded sharp mixing estimates (cutoff with an $O(1)$-window) for…