Related papers: Evolution of scale-free random graphs: Potts model…
We derive the finite size dependence of the clustering coefficient of scale-free random graphs generated by the configuration model with degree distribution exponent $2<\gamma<3$. Degree heterogeneity increases the presence of triangles in…
Herein, we propose a site random cluster model by introducing an additional cluster weight in the partition function of the traditional site percolation. To simulate the model on a square lattice, we combine the color-assignation and the…
We note that it is possible to construct a bond vertex model that displays q-state Potts criticality on an ensemble of phi3 random graphs of arbitrary topology, which we denote as ``thin'' random graphs in contrast to the fat graphs of the…
The self-dual random-bond eight-state Potts model is studied numerically through large-scale Monte Carlo simulations using the Swendsen-Wang cluster flipping algorithm. We compute bulk and surface order parameters and susceptibilities and…
An analytical approach to calculating bond percolation thresholds, sizes of $k$-cores, and sizes of giant connected components on structured random networks with non-zero clustering is presented. The networks are generated using a…
We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$.…
There is proposed a model of scale-free random graphs which are locally close to the uncorrelated complex random networks with divergent $\langle k^2 \rangle$ studied in e.g. S. N. Dorogovtsev {\it et al}, Rev. Mod. Phys. {\bf 80}, 1275…
Random graphs with power-law degrees can model scale-free networks as sparse topologies with strong degree heterogeneity. Mathematical analysis of such random graphs proved successful in explaining scale-free network properties such as…
The $i$-dimensional plaquette random-cluster model on a finite cubical complex is the random complex of $i$-plaquettes with each configuration having probability proportional to $$p^{\text{# of plaquettes}}(1-p)^{\text{# of complementary…
The state space of our model is the Euclidean space in dimension d = 2. Simultaneously, from all points of a homogeneous Poisson point process, we let grow independent and identically distributed random continuum paths. Each path stops…
We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…
A random growth lattice filling model of percolation with touch and stop growth rule is developed and studied numerically on a two dimensional square lattice. Nucleation centers are continuously added one at a time to the empty sites and…
Fixing $\beta \ge 0$ and an integer $q \ge 2$, consider the ferromagnetic $q$-Potts measures $\mu_n^{\beta,B}$ on finite graphs ${\sf G}_n$ on $n$ vertices, with external field strength $B \ge 0$ and the corresponding random cluster…
Universality is a fundamental concept in modern physics. For the $q$-state Potts model, the critical exponents are merely determined by the order-parameter symmetry $S_q$, spatial dimensionality and interaction range, independent of…
Motivated by network resilience and insurance premiums in the context of cyber security, we derive universal upper bounds for the first and second moments of the size of bond percolation clusters on finite regular graphs. Thinking of the…
We study the giant component problem slightly above the critical regime for percolation on Poissonian random graphs in the scale-free regime, where the vertex weights and degrees have a diverging second moment. Critical percolation on…
We prove that the $q$-state Potts model and the random-cluster model with cluster weight $q>4$ undergo a discontinuous phase transition on the square lattice. More precisely, we show - Existence of multiple infinite-volume measures for the…
Let $(G_n)_{n \geq 1} = ((V_n,E_n))_{n \geq 1}$ be a sequence of finite, connected, vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)_{n \geq 1}$ in $[0,1]$ is supercritical with respect…
The class of random-cluster models is a unification of a variety of stochastic processes of significance for probability and statistical physics, including percolation, Ising, and Potts models; in addition, their study has impact on the…
We describe the component sizes in critical independent p-bond percolation on a random d-regular graph on n vertices, where d \geq 3 is fixed and n grows. We prove mean-field behavior around the critical probability p_c=1/(d-1). In…