Related papers: Mean field frozen percolation
How a system initially at infinite temperature responds when suddenly placed at finite temperatures is a way to check the existence of phase transitions. It has been shown in [R. da Silva, IJMPC 2023] that phase transitions are imprinted in…
We consider a variant of the classical Erd\H{o}s-R\'enyi random graph, where components with surplus are slowed down to prevent the apparition of complex components. The sizes of the components of this process undergo a similar phase…
We study two closely related processes on the triangular lattice: frozen percolation, where connected components of occupied vertices freeze (they stop growing) as soon as they contain at least $N$ vertices, and forest fire processes, where…
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…
In this paper, we develop a mean-field model for simulating the microstructure evolution of crystalline materials during static recrystallization. The model considers a population of individual cells (i.e. grains and subgrains) growing in a…
We prove a moderate deviations principles for the size of the largest connected component in a random $d$-uniform hypergraph. The key tool is a version of the exploration process, that is also used to investigate the giant component of an…
We establish central limit theorems for a large class of supercritical branching Markov processes in infinite dimension with spatially dependent and non-necessarily local branching mechanisms. This result relies on a fourth moment…
The statement of the mean field approximation theorem in the mean field theory of Markov processes particularly targets the behaviour of population processes with an unbounded number of agents. However, in most real-world engineering…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
We give an example of a long range Bernoulli percolation process on a group non-quasi-isometric with $\mathbb{Z}$, in which clusters are almost surely finite for all values of the parameter. This random graph admits diverse equivalent…
We study the mean-field limit of an elasto-plastic model introduced to describe the yielding transition of athermally and quasi-statically sheared amorphous solids. We focus on the sample-to-sample fluctuations, which we characterize…
A local order parameter which is important in the analysis of phase transitions in frustrated combinatorial problems is the probability that a node is frozen in a particular state. There is a percolative transition when an infinite…
Infinite-range spin-glass models with Levy-distributed interactions show a freezing transition similar to disordered spin systems on finite connectivity random graphs. It is shown that despite diverging moments of the local field…
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p=n^{-alpha} and alpha=alpha(n) is bounded away from 0. We show…
We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…
We study the random connection model on hyperbolic space $\mathbb{H}^d$ in dimension $d=2,3$. Vertices of the spatial random graph are given as a Poisson point process with intensity $\lambda>0$. Upon variation of $\lambda$ there is a…
We consider the Erd\"{o}s--R\'{e}nyi random graph $G_{n,p}$ and we analyze the simple irreversible epidemic process on the graph, known in the literature as bootstrap percolation. We give a quantitative version of some results by Janson et…
We introduce perhaps the simplest models of graph evolution with choice that demonstrate discontinuous percolation transitions and can be analyzed via mathematical evolution equations. These models are local, in the sense that at each step…
In frozen percolation, i.i.d. uniformly distributed activation times are assigned to the edges of a graph. At its assigned time, an edge opens provided neither of its endvertices is part of an infinite open cluster; in the opposite case, it…
The self-consistent probabilistic approach has proven itself powerful in studying the percolation behavior of interdependent or multiplex networks without tracking the percolation process through each cascading step. In order to understand…