Related papers: Mean-field behavior for nearest-neighbor percolati…

We study long-range Bernoulli percolation on $\mathbb{Z}^d$ in which each two vertices $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta \|x-y\|^{-d-\alpha})$. It is a theorem of Noam Berger (CMP, 2002) that if…

We consider neighbor-induced damage percolation, a model describing systems where the inactivation of some elements may damage their neighboring active ones, making them unusable. We present an exact solution for the size of the giant…

First-passage percolation is the study of the metric space $(\mathbb{Z}^d,T)$, where $T$ is a random metric defined as the weighted graph metric using random edge-weights $(t_e)_{e\in \mathcal{E}^d}$ assigned to the nearest-neighbor edges…

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…

We define a random graph obtained via connecting each point of $\mathbb{Z}^d$ independently to a fixed number $1 \leq k \leq 2d$ of its nearest neighbors via a directed edge. We call this graph the directed $k$-neighbor graph. Two natural…

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…

We consider percolation on the discrete torus $\mathbb{Z}_n^d$ at $p_c(\mathbb{Z}^d)$, the critical value for percolation on the corresponding infinite lattice $\mathbb{Z}^d$, and within the scaling window around it. We assume that $d$ is a…

A celebrated result of Alon from 1993 states that any $d$-regular graph on $n$ vertices (where $d=O(n^{1/9})$) has a bisection with at most $\frac{dn}{2}(\frac{1}{2}-\Omega(\frac{1}{\sqrt{d}}))$ edges, and this is optimal. Recently, this…

For $r\geq1$, the $r$-neighbour bootstrap process in a graph $G$ starts with a set of infected vertices and, in each time step, every vertex with at least $r$ infected neighbours becomes infected. The initial infection percolates if every…

Motivated by considerations from neuroscience (macroscopic behavior of large ensembles of interacting neurons), we consider a population of mean field interacting diffusions in $\mathbf {R}^m$ in the presence of a random environment and…

Consider an independent site percolation model with parameter $p \in (0,1)$ on $\Z^d,\ d\geq 2$ where there are only nearest neighbor bonds and long range bonds of length $k$ parallel to each coordinate axis. We show that the percolation…

Consider long-range Bernoulli percolation on $\mathbb{Z}^d$ in which we connect each pair of distinct points $x$ and $y$ by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta\geq 0$ is a…

Using a recently introduced algorithm for simulating percolation in microcanonical (fixed-occupancy) samples, we study the convergence with increasing system size of a number of estimates for the percolation threshold for an open system…

We consider first-passage percolation on the $d$ dimensional cubic lattice for $d \geq 2$; that is, we assign independently to each edge $e$ a nonnegative random weight $t_e$ with a common distribution and consider the induced random graph…

Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $\lambda,\mu$. For any $\lambda>0$ we consider the percolation…

We first review the derivation of the exact expression for the average distance $<r_n>$ of the n-th neighbour of a reference point among a set of N random points distributed uniformly in a unit volume of a D-dimensional geometric space.…

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 describe the component sizes in critical independent p-bond percolation on a random d-regular graph on n vertices, where d \geq 3 is fixed and n grows. We prove mean-field behavior around the critical probability p_c=1/(d-1). In…

Here we prove critical exponents for Random Connections Models (RCMs) with random marks. The vertices are given by a marked Poisson point process on $\mathbb{R}^d$ and an edge exists between any pair of vertices independently with a…

In recent years, important progress has been made in the field of two-dimensional statistical physics. One of the most striking achievements is the proof of the Cardy-Smirnov formula. This theorem, together with the introduction of…