Related papers: Rigidity percolation in a field
We prove a nonuniqueness theorem for Bernoulli site percolation on properly embedded planar graphs, and we obtain a general connectivity principle beyond planarity. Let $G$ be an infinite connected graph properly embedded in $\RR^2$ with…
In their seminal paper introducing the theory of random graphs, Erd\H{o}s and R\'{e}nyi considered the evolution of the structure of a random subgraph of $K_n$ as the density increases from $0$ to $1$, identifying two key points in this…
We study the Gierer-Meinhardt model of reaction-diffusion on a site-disordered square lattice. Let $p$ be the site occupation probability of the square lattice. For $p$ greater than a critical value $p_c$, the steady state consists of…
We complete the analysis of the extremal eigenvalues of the the adjacency matrix $A$ of the Erd\H{o}s-R\'enyi graph $G(N,d/N)$ in the critical regime $d \asymp \log N$ of the transition uncovered in [arXiv:1704.02953,arXiv:1704.02945],…
We study a one parameter family of random graph models that spans a continuum between traditional random graphs of the Erd\H{o}s-R\'enyi type, where there is no underlying structure, and percolation models, where the possible edges are…
Disagreement percolation connects a Gibbs lattice gas and i.i.d. site percolation on the same lattice such that non-percolation implies uniqueness of the Gibbs measure. This work generalises disagreement percolation to the hard-sphere model…
We investigate the bond percolation model on transient weighted graphs ${G}$ induced by the excursion sets of the Gaussian free field on the corresponding metric graph. We assume that balls in ${G}$ have polynomial volume growth with growth…
Working in the setting of i.i.d. last-passage percolation on $\mathbb{R}^D$ with no assumptions on the underlying edge\hyp{}weight distribution, we arrive at the notion of grid entropy - a Subadditive Ergodic Theorem limit of the entropies…
Porous materials made up of impermeable polyhedral grains constrain fluid flow to voids around the impenetrable constituent barrier particles. A percolation transition marks the boundary between assemblies of grains which contain system…
Percolation has two mean-field theories, the Gaussian fixed point (GFP) and the Landau mean-field theory or the complete graph (CG) asymptotics. By large-scale Monte Carlo simulations, we systematically study the interplay of the GFP and CG…
Rigidity percolation (RP) is the emergence of mechanical stability in networks. Motivated by the experimentally observed fractal nature of materials like colloidal gels and disordered fiber networks, we study RP in a fractal network.…
Discontinuous transition is observed in the equilibrium cluster properties of a percolation model with suppressed cluster growth as the growth parameter g0 is tuned to the critical threshold at sufficiently low initial seed concentration…
A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. Assuming that the nodes of the wireless network are distributed as a…
During the last few years, a number of works in computer simulation have focused on the clustering and percolation properties of simple fluids based in an energetic connectivity criterion proposed long ago by T.L. Hill [J. Chem. Phys. 23,…
In this paper we will consider the contact process in a very simple type of random environment that physicists call the random dilution model. We start with the contact process on a graph, here either $\mathbb{Z}^d$, a $d$-dimensional torus…
We discuss numerically the non-perturbative effects in exponential random graphs which are analogue of eigenvalue instantons in matrix models. The phase structure of exponential random graphs with chemical potential for 4-cycles and degree…
The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence…
We study the percolation phase transition on preferential attachment models, in which vertices enter with $m$ edges and attach proportionally to their degree plus $\delta$. We identify the critical percolation threshold as…
We give a geometrically exact treatment of percolation through voids around assemblies of randomly placed impermeable barrier particles, introducing a computationally inexpensive approach to finding critical barrier density thresholds…
We study site and bond percolation on directed simple random graphs with a given degree distribution and derive the expressions for the critical value of the percolation probability above which the giant strongly connected component emerges…