相关论文: A Potts/Ising Correspondence on Thin Graphs

We propose a notion of contraction function for a family of graphs and establish its connection to the strong spatial mixing for spin systems. More specifically, we show that for anti-ferromagnetic Potts model on families of graphs…

Correlations are known to play a crucial role in determining the structure of complex networks. Here we study how their presence affects the computation of the percolation threshold in random hypergraphs. In order to mimic the correlation…

We consider the two-dimensional random bond $q$-state Potts model within the recently introduced exact framework of scale invariant scattering, exhibit the line of stable fixed points induced by disorder for arbitrarily large values of $q$,…

Enormous advances have been made in the past 20 years in our understanding of the random-field Ising model, and there is now consensus on many aspects of its behavior at least in thermal equilibrium. In contrast, little is known about its…

We compute the combined two and three loop order correction to the spin-spin correlation functions for the 2D Ising and q-states Potts model with random bonds at the critical point. The procedure employed is the renormalisation group…

The critical properties of the 2D Ising and 3-state Potts models are investigated using Monte Carlo simulations. Special interest is given to measurement of 3-point correlation functions and associated universal objects, i.e. structure…

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…

We present a new solution of the asymmetric two-matrix model in the large $N$ limit which only involves a saddle point analysis. The model can be interpreted as Ising in the presence of a magnetic field, on random dynamical lattices with…

We prove that the q-states Potts model on graph is spontaneously magnetized at finite temperature if and only if the graph presents percolation on the average. Percolation on the average is a combinatorial problem defined by averaging over…

Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…

In this essay, we briefly discuss recent developments, started a decade ago in the seminal work of Smirnov and continued by a number of authors, centered around the conformal invariance of the critical planar Ising model on $\mathbb{Z}^2$…

We consider the fractal dimensions of critical clusters occurring in configurations of a q-state Potts model coupled to the planar random graphs of the dynamical triangulations formulation of Euclidean quantum gravity in two dimensions. For…

Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…

We establish an intriguing connection between geometry and thermodynamics in the critical q-state Potts model on two-dimensional lattices, using the q-state bond-correlated percolation model (QBCPM) representation. We find that the number…

We study connection probabilities between vertices of the square lattice for the critical random-cluster (FK) model with cluster weight 2, which is related to the critical Ising model. We consider the model on the plane and on domains…

In 2011, Penttila and Williford constructed an infinite new family of primitive $Q$-polynomial 3-class association schemes, not arising from distance regular graphs, by exploring the geometry of the lines of the unitary polar space…

We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…

A T-graph (a special case of a chordal graph) is the intersection graph of connected subtrees of a suitable subdivision of a fixed tree T . We deal with the isomorphism problem for T-graphs which is GI-complete in general - when T is a part…

Scanning probes reveal complex, inhomogeneous patterns on the surface of many condensed matter systems. In some cases, the patterns form self-similar, fractal geometric clusters. In this paper, we advance the theory of criticality as it…

A Monte Carlo algorithm is proposed to simulate ferromagnetic q-state Potts model for any real q>0. A single update is a random sequence of disordering and deterministic moves, one for each link of the lattice. A disordering move attributes…