Related papers: Exceptional times for percolation under exclusion …
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 prove that near-critical percolation and dynamical percolation on the triangular lattice $\eta \mathbb{T}$ have a scaling limit as the mesh $\eta \to 0$, in the "quad-crossing" space $\mathcal{H}$ of percolation configurations introduced…
$k$-core percolation is a percolation model which gives a notion of network functionality and has many applications in network science. In analysing the resilience of a network under random damage, an extension of this model is introduced,…
We describe the effect of power-law initial distributions of clusters on ordinary percolation and its generalizations, specifically, models of explosive percolation processes based on local optimization. These aggregation processes were…
The behavior of the percolation threshold and the jamming coverage for isotropic random sequential adsorption samples has been studied by means of numerical simulations. A parallel algorithm that is very efficient in terms of its speed and…
Kinetically constrained models (KCM) are reversible interacting particle systems on $\mathbb{Z}^d$ with continuous-time constrained Glauber dynamics. They are a natural non-monotone stochastic version of the family of cellular automata with…
This work is the first in a series of papers devoted to the construction and study of scaling limits of dynamical and near-critical planar percolation and related objects like invasion percolation and the Minimal Spanning Tree. We show here…
We study percolation on the hierarchical lattice of order $N$ where the probability of connection between two points separated by distance $k$ is of the form $c_k/N^{k(1+\delta)},\; \delta >-1$. Since the distance is an ultrametric, there…
Percolation refers to the emergence of a giant connected cluster in a disordered system when the number of connections between nodes exceeds a critical value. The percolation phase transitions were believed to be continuous until recently…
Classically, percolation critical exponents are linked to the power laws that characterize percolation cluster fractal properties. It is found here that the gradient percolation power laws are conserved even for extreme gradient values for…
We consider a continuum percolation model on $\R^d$, $d\geq 1$.For $t,\lambda\in (0,\infty)$ and $d\in\{1,2,3\}$, the occupied set is given by the union of independent Brownian paths running up to time $t$ whoseinitial points form a Poisson…
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…
We introduce a cluster growth process that provides a clear connection between equilibrium statistical mechanics and an explosive percolation model similar to the one recently proposed by Achlioptas et al. [Science 323, 1453 (2009)]. We…
Consider a Markov process \omega_t at equilibrium and some event C (a subset of the state-space of the process). A natural measure of correlations in the process is the pairwise correlation \Pr[\omega_0,\omega_t \in C] - \Pr[\omega_0 \in…
We investigate the percolation properties of a planar reinforced network model. In this model, at every time step, every vertex chooses $k \ge 1$ incident edges, whose weight is then increased by 1. The choice of this $k$-tuple occurs…
Random arrangements of points in the plane, interacting only through a simple hard core exclusion, are considered. An intensity parameter controls the average density of arrangements, in analogy with the Poisson point process. It is proved…
Spatial self-similarity is a hallmark of critical phenomena. We investigate the dynamic process of percolation, in which bonds are incrementally inserted to an empty lattice until fully occupied, and track the gaps describing the changes in…
We study the autocorrelation time of the size of the cluster at the origin in discrete-time dynamical percolation. We focus on binary trees and high-dimensional tori, and show in both cases that this autocorrelation time is linear in the…
We develop the theory of the k-core (bootstrap) percolation on uncorrelated random networks with arbitrary degree distributions. We show that the k-core percolation is an unusual, hybrid phase transition with a jump emergence of the k-core…
A kernel-based framework for spatio-temporal data analysis is introduced that applies in situations when the underlying system dynamics are governed by a dynamic equation. The key ingredient is a representer theorem that involves…