Related papers: Evolution of scale-free random graphs: Potts model…
On a large finite connected graph let edges $e$ become "open" at independent random Exponential times of arbitrary rates $w_e$. Under minimal assumptions, the time at which a giant component starts to emerge is weakly concentrated around…
In dynamical percolation, the status of every bond is refreshed according to an independent Poisson clock. For graphs which do not percolate at criticality, the dynamical sensitivity of this property was analyzed extensively in the last…
We consider the heavy-dense limit of QCD at finite fermion density in the canonical formulation and approximate it by a 3-state Potts model. In the strong coupling limit, the model is free of the sign problem. Away from the strong coupling,…
We study the properties of the q-state frustrated bond percolation model by a Monte Carlo "bond flip" dynamics, using an algorithm originally devised by Sweeny and suitably modified to treat the presence of frustration. We analyze the…
We consider bond percolation on $n$ vertices on a circle where edges are permitted between vertices whose spacing is at most some number L=L(n). We show that the resulting random graph gets a giant component when $L\gg(\log n)^2$ (when the…
We study the spread of information in finite and infinite inhomogeneous spatial random graphs. We assume that each edge has a transmission cost that is a product of an i.i.d. random variable L and a penalty factor: edges between vertices of…
We introduce a new oriented evolving graph model inspired by biological networks. A node is added at each time step and is connected to the rest of the graph by random oriented edges emerging from older nodes. This leads to a statistical…
It is proposed that the $O(n)$ spin and geometrical percolation models can help to study the QCD phase diagram due to the universality properties of the phase transition. In this paper, correlations and fluctuations of various sizes of…
We study random digraphs on sequences of expanders with bounded average degree {which converge locally in probability}. We prove that the threshold for the existence of a giant strongly connected component, as well as the asymptotic…
The percolated random geometric graph $G_n(\lambda, p)$ has vertex set given by a Poisson Point Process in the square $[0,\sqrt{n}]^2$, and every pair of vertices at distance at most 1 independently forms an edge with probability $p$. For a…
We study the percolation of strongly connected clusters (SCCs), in which sites are mutually reachable through directed paths, in systems with randomly oriented bonds by extensive simulations on hypercubic lattices from dimension $d=2$ to…
We present exact solutions for the size of the giant connected component (GCC) of graphs composed of higher-order homogeneous cycles, including weak cycles and cliques, following bond percolation. We use our theoretical result to find the…
We consider the scaling limit of the two-dimensional $q$-state Potts model for $q\leq 4$. We use the exact scattering theory proposed by Chim and Zamolodchikov to determine the one and two-kink form factors of the energy, order and disorder…
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 use a previously introduced mapping between the continuum percolation model and the Potts fluid (a system of interacting s-states spins which are free to move in the continuum) to derive the low density expansion of the pair…
We consider the problem of sampling from the ferromagnetic Potts and random-cluster models on a general family of random graphs via the Glauber dynamics for the random-cluster model. The random-cluster model is parametrized by an edge…
The universality of the crossing probability $\pi_{hs}$ of a system to percolate only in the horizontal direction, was investigated numerically by using a cluster Monte-Carlo algorithm for the $q$-state Potts model for $q=2,3,4$ and for…
We consider large random graphs with prescribed degrees, such as those generated by the configuration model. In the regime where the empirical degree distribution approaches a limit $\mu$ with finite mean, we establish the systematic…
We propose a bond-percolation model intended to describe the consumption, and eventual exhaustion, of resources in transport networks. Edges forming minimum-length paths connecting demanded origin-destination nodes are removed if below a…
Following Bradonji\'c and Saniee, we study a model of bootstrap percolation on the Gilbert random geometric graph on the $2$-dimensional torus. In this model, the expected number of vertices of the graph is $n$, and the expected degree of a…