Related papers: Percolation and Connectivity in AB Random Geometri…
Consider a graph on $n$ uniform random points in the unit square, each pair being connected by an edge with probability $p$ if the inter-point distance is at most $r$. We show that as $n\to\infty$ the probability of full connectivity is…
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…
Bootstrap percolation in (random) graphs is a contagion dynamics among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$…
Let A be the annulus in R^2 centered at the origin with inner and outer radii r(1-\epsilon) and r, respectively. Place points {x_i} in R^2 according to a Poisson process with intensity 1 and let G_A be the random graph with vertex set {x_i}…
We study the number of isolated nodes in a soft random geometric graph whose vertices constitute a Poisson process on the torus of length L (the line segment [0,L] with periodic boundary conditions), and where an edge is present between two…
A bootstrap percolation process on a graph G is an "infection" process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round every uninfected node which has at least r infected neighbours…
Percolation with edge-passage probability p and first-passage percolation are studied for the n-cube B_n ={0,1}^n with nearest neighbor edges. For oriented and unoriented percolation, p=e/n and p=1/n are the respective critical…
We analyze site percolation on directed and undirected graphs with site-dependent open-site probabilities. We construct upper bounds on cluster susceptibilities, vertex connectivity functions, and the expected number of simple open cycles…
We study the random connection model driven by a stationary Poisson process. In the first part of the paper, we derive a lace expansion with remainder term in the continuum and bound the coefficients using a new version of the BK…
We estimate locations of the regions of the percolation and of the non-percolation in the plane $(\lambda,\beta)$: the Poisson rate -- the inverse temperature, for interacted particle systems in finite dimension Euclidean spaces. Our…
We consider connectivity properties of certain i.i.d. random environments on $\Z^d$, where at each location some steps may not be available. Site percolation and oriented percolation can be viewed as special cases of the models we consider.…
Equip each point $x$ of a homogeneous Poisson process $\mathcal{P}$ on $\mathbb{R}$ with $D_x$ edge stubs, where the $D_x$ are i.i.d. positive integer-valued random variables with distribution given by $\mu$. Following the stable…
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 consider the hard-core model in $\mathbb{R}^2$, in which a random set of non-intersecting unit disks is sampled with an intensity parameter $\lambda$. Given $\varepsilon>0$ we consider the graph in which two disks are adjacent if they…
Bootstrap percolation is a process that is used to model the spread of an infection on a given graph. In the model considered here each vertex is equipped with an individual threshold. As soon as the number of infected neighbors exceeds…
We investigate expansions for connectedness functions in the random connection model of continuum percolation in powers of the intensity. Precisely, we study the pair-connectedness and the direct-connectedness functions, related to each…
On a geometric model for complex networks (introduced by Krioukov et al.) we investigate the bootstrap percolation process. This model consists of random geometric graphs on the hyperbolic plane having $N$ vertices, a dependent version of…
Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or…
We study site and bond percolation on directed simple random graphs with a given degree distribution and derive the expressions for the critical value of the percolation probability above which the giant strongly connected component emerges…
A popular question in Bernoulli percolation models is if the probability of connection between two vertices in a transitive graph decays monotonically with the distance between these two vertices. For example, on the square lattice is an…