Related papers: Phase transition for percolation on a randomly str…
We study a random graph model which combines properties of the edge percolation model on Z^d and a classical random graph G(n,c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called "rank 1…
Explosive Percolation describes the abrupt onset of large-scale connectivity that results from a simple random process designed to delay the onset of the transition on an underlying random network or lattice. Explosive percolation…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
Let $\phi:X\to \mathbb R$ be a continuous potential associated with a symbolic dynamical system $T:X\to X$ over a finite alphabet. Introducing a parameter $\beta>0$ (interpreted as the inverse temperature) we study the regularity of the…
A first-order percolation transition, called explosive percolation, was recently discovered in evolution networks with random edge selection under a certain restriction. However, the network percolation with more realistic evolution…
We consider the following oriented percolation model of $\mathbb {N} \times \mathbb{Z}^d$: we equip $\mathbb {N}\times \mathbb{Z}^d$ with the edge set $\{[(n,x),(n+1,y)] | n\in \mathbb {N}, x,y\in \mathbb{Z}^d\}$, and we say that each edge…
We study the phase transition of random radii Poisson Boolean percolation: Around each point of a planar Poisson point process, we draw a disc of random radius, independently for each point. The behavior of this process is well understood…
We study random walks evolving in continuous time on a one-dimensional lattice where each site $x$ hosts a quenched random potential $U_x$. The potentials on different sites are independent, identically distributed Gaussian random…
We study the frog model with death on the biregular tree $\mathbb{T}_{d_1,d_2}$. Initially, there is a random number of awake and sleeping particles located on the vertices of the tree. Each awake particle moves as a discrete-time…
We revisit the scaling properties of a model for non-equilibrium wetting [Phys. Rev. Lett. 79, 2710 (1997)], correcting previous estimates of the critical exponents and providing a complete scaling scheme. Moreover, we investigate a special…
The interchange process on a finite graph is obtained by placing a particle on each vertex of the graph, then at rate 1, selecting an edge uniformly at random and swapping the two particles at either end of this edge. In this paper we…
We introduce a new approach to disordered two-dimensional Ising models based on the extension of the combinatorial solution to randomized supercells. Applying it to the site-diluted Ising model on the square lattice, we resolve the full…
Although it is well-known that some exponential family random graph model (ERGM) families exhibit phase transitions (in which small parameter changes lead to qualitative changes in graph structure), the behavior of other models is still…
We investigate the crossover properties of the frustrated percolation model on a two-dimensional square lattice, with asymmetric distribution of ferromagnetic and antiferromagnetic interactions. We determine the critical exponents nu, gamma…
We carry out extensive Monte Carlo simulations of the three-dimensional (3D) uniformly frustrated XY model with uncorrelated randomly perturbed couplings, as a model for the equilibrium behavior of an extreme type-II superconductor with…
We study the site-bond percolation on a hierarchical scale-free network, namely, the decorated (2,2)-flower, by using the renormalization group technique. The phase diagram essentially depends on the fraction of occupied sites.…
In this note we study the phase transition for percolation on quasi-transitive graphs with quasi-transitively inhomogeneous edge-retention probabilities. A quasi-transitive graph is an infinite graph with finitely many different "types" of…
The stochastic addition of either vertices or connections in a network leads to the observation of the percolation transition, a structural change with the appearance of a connected component encompassing a finite fraction of the system.…
We briefly introduce hysteresis in spatially extended systems and the dynamic phase transition observed as the frequency of the oscillating field increases beyond a critical value. Hysteresis and the decay of metastable phases are closely…
We introduce a very general model of an inhomogenous random graph with independence between the edges, which scales so that the number of edges is linear in the number of vertices. This scaling corresponds to the p=c/n scaling for G(n,p)…