Related papers: A percolation process on the binary tree where lar…
Percolation has long served as a model for diverse phenomena and systems. The percolation transition, that is, the formation of a giant cluster on a macroscopic scale, is known as one of the most robust continuous transitions. Recently,…
Multiplicity fluctuations of intermediate-mass fragments are studied with the percolation model. It is shown that super-Poissonian fluctuations occur near the percolation transition and that this behavior is associated with the…
A simple, discrete, parametric model is proposed to describe conditional (correlated) deposition of particles on a surface and formation of a connecting (percolating) cluster. The surface changes spontaneously its properties (phase…
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…
This paper studies growth, percolation, and correlations in disordered fiber networks. We start by introducing a 2D continuum deposition model with effective fiber-fiber interactions represented by a parameter $p$ which controls the degree…
This article reviews some effects of disorder in percolation systems even away from the critical density p_c. For densities below p_c, the statistics of large clusters defines the animals problem. Its relation to the directed animals…
In the usual Achlioptas processes the smallest clusters of a few randomly chosen ones are selected to merge together at each step. The resulting aggregation process leads to the delayed birth of a giant cluster and the so-called explosive…
Let $G$ be the product of finitely many trees $T_1\times T_2 \times \cdots \times T_N$, each of which is regular with degree at least three. We consider Bernoulli bond percolation and the Ising model on this graph, giving a short proof that…
As a generation of the classical percolation, clique percolation focuses on the connection of cliques in a graph, where the connection of two $k$-cliques means that they share at least $l<k$ vertices. In this paper, we develop a theoretical…
A theoretical and numerically study of dynamical properties in the sol-gel transition is presented. In particular, the complex phenomenology observed experimentally and numerically in gelling systems is reproduced in the framework of…
Given any regularly varying dislocation measure, we identify a natural self-similar fragmentation tree as scaling limit of discrete fragmentation trees with unit edge lengths. As an application, we obtain continuum random tree limits of…
A set of discrete individual points located in an embedding continuum space can be seen as percolating or non-percolating, depending on the radius of the discs/spheres associated with each of them. This problem is relevant in theoretical…
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…
We consider the internal diffusion limited aggregation (IDLA) process on the infinite cluster in supercritical Bernoulli bond percolation on Euclidean lattices. It is shown that the process on the cluster behaves like it does on the…
We study the percolation transition in growing networks under an Achlioptas process (AP). At each time step, a node is added in the network and, with the probability $\delta$, a link is formed between two nodes chosen by an AP. We find that…
We study percolation on nonamenable groups at the uniqueness threshold $p_u$, the critical value that separates the phase in which there are infinitely many infinite clusters from the phase in which there is a unique infinite cluster. The…
Interacting particle systems can often be constructed from a graphical representation, by applying local maps at the times of associated Poisson processes. This leads to a natural coupling of systems started in different initial states. We…
We consider a type of long-range percolation problem on the positive integers, motivated by earlier work of others on the appearance of (in)finite words within a site percolation model. The main issue is whether a given infinite binary word…
We show that for all p>p_c(\Z^d) percolation parameters, the probability that the cluster of the origin is finite but has at least t vertices at distance one from the infinite cluster is exponentially small in t. We use this to give a short…
We consider Bernoulli hyper-edge percolation on $\mathbb{Z}^d$. This model is a generalization of Bernoulli bond percolation. An edge connects exactly two vertices and a hyper-edge connects more than two vertices. As in the classical…