Related papers: Percolation with constant freezing
We investigate percolation on growing networks where the evolution of connected components resembles a non-equilibrium version of the multiplicative coalescent. The supercritical $\pi> \pi_c$ regime for a host of such models was conjectured…
We examine the percolation model on $\mathbb{Z}^d$ by an approach involving lattice animals and their surface-area-to-volume ratio. For $\beta \in [0,2(d-1))$, let $f(\beta)$ be the asymptotic exponential rate in the number of edges of the…
Suspensions of hard core spherical particles of diameter $D$ with inter-core connectivity range $\delta$ can be described in terms of random geometric graphs, where nodes represent the sphere centers and edges are assigned to any two…
We investigate the behavior of large connected components in the Poisson Random Connection model in non-critical regimes with any bounded connection function. We show that the asymptotic size of the largest component restricted to a window…
In the Constrained-degree percolation model on a graph $(\mathbb{V},\mathbb{E})$ there are a sequence, $(U_e)_{e\in\mathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open…
In this paper, we are interested in the loop cluster model on $\mathbb{Z}^d$ for $d\geq 3$. It is a long range model with two parameters $\alpha$ and $\kappa$, where the non-negative parameter $\alpha$ measures the amount of loops, and…
Numerical simulations of Diffusion-Limited and Reaction-Limited Cluster-Cluster Aggregation processes of identical particles are performed in a two-dimensional box. It is shown that, for concentrations larger than a characteristic gel…
Given a graph $G$, we consider a model for a random cover of $G$ by taking two parallel copies of $G$ and crossing every pair of parallel edges randomly with probability $q$ independently of each other. The resulting graph $G_q$, is a…
We consider the growth of clusters in disordered media at zero temperature, as exemplified by supercritical generalized percolation and by the random field Ising model. We show that the morphology of such clusters and of their surfaces can…
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 percolation phase transition in hierarchical scale-free nets. Depending on the method of construction, the nets can be fractal or small-world (the diameter grows either algebraically or logarithmically with the net size),…
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 analyze the freezing and collapse transition of a simple model for flexible polymer chains on simple cubic and face-centered cubic lattices by means of sophisticated chain-growth methods. In contrast to bond-fluctuation polymer models in…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
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…
We investigate the component sizes of the critical configuration model, as well as the related problem of critical percolation on a supercritical configuration model. We show that, at criticality, the finite third moment assumption on the…
We present results from density functional theory and computer simulations that unambiguously predict the occurrence of first-order freezing transitions for a large class of ultrasoft model systems into cluster crystals. The clusters…
We study percolation as a critical phenomenon on a multifractal support. The scaling exponents of the the infinite cluster size ($\beta$ exponent) and the fractal dimension of the percolation cluster ($d_f$) are quantities that seem do not…
We consider first-passage percolation on $\mathbb{Z}^2$ with i.i.d. weights, whose distribution function satisfies $F(0) = p_c = 1/2$. This is sometimes known as the "critical case" because large clusters of zero-weight edges force passage…
We show that the infinite percolating cluster (with density P_inf) of central-force networks is composed of: a fractal stress-bearing backbone (Pb) and; rigid but unstressed ``dangling ends'' which occupy a finite volume-fraction of the…