Related papers: Random interlacement is a factor of i.i.d
We study the contact process on a class of geometric random graphs with scale-free degree distribution, defined on a Poisson point process on $\mathbb{R}^d$. This class includes the age-dependent random connection model and the soft Boolean…
A random geometric graph $G(\mathcal{X}_n, r_n)$ is formed by taking a binomial process $\mathcal{X}_n$ as the set of vertices and joining any two distinct points with an edge if they lie within distance $r_n$ of each other. We investigate…
We consider the random walk in an independent and identically distributed (i.i.d.) random environment on a Cayley graph of a finite free product of copies of $\mathbb{Z}$ and $\mathbb{Z}_2$. Such a Cayley graph is readily seen to be a…
We introduce a construction that gives rise to a variety of "geometric" finite random graphs, and describe connections to the Poisson boundary, Naim's kernel, and Sznitman's random interlacements.
Random intersection graphs are characterized by three parameters: $n$, $m$ and $p$, where $n$ is the number of vertices, $m$ is the number of objects, and $p$ is the probability that a given object is associated with a given vertex. Two…
In this article, we consider a Branching Random Walk on the real line. The genealogical structure is assumed to be given through a supercritical branching process in the i.i.d. environment and satisfies the Kesten-Stigum condition. The…
We study the size of connected components of random nearest-neighbor graphs with vertex set the points of a homogeneous Poisson point process in ${\mathbb{R}}^d$. The connectivity function is shown to decay superexponentially, and we…
We introduce a natural extension of the exclusion process to hypergraphs and prove an upper bound for its mixing time. In particular we show the existence of a constant $C$ such that for any connected, regular hypergraph $G$ within some…
Consider a set of $n$ vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for…
We consider the limiting behavior of the count of subgraphs isomorphic to a graph $G$ with $m\geq 0$ fixed endpoints (or roots) in the random-connection model, as the intensity $\lambda$ of the underlying Poisson point process tends to…
The on-line nearest-neighbour graph on a sequence of $n$ uniform random points in $(0,1)^d$ ($d \in \N$) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this…
We study two random processes on an $n$-vertex graph inspired by the internal diffusion limited aggregation (IDLA) model. In both processes $n$ particles start from an arbitrary but fixed origin. Each particle performs a simple random walk…
A random field $X = (X_v)_{v \in G}$ on a quasi-transitive graph $G$ is a factor of i.i.d. if it can be written as $X=\varphi(Y)$ for some i.i.d. process $Y= (Y_v)_{v \in G}$ and equivariant map $\varphi$. Such a map, also called a coding,…
Answering a question of Benjamini, we present an isometry-invariant random partition of the Euclidean space $\mathbb{R}^d$, $d\geq 3$, into infinite connected indistinguishable pieces, such that the adjacency graph defined on the pieces is…
We study a continuous-time simple random walk on a regular rooted tree of depth $n$ in two settings: either the walk is started from a leaf vertex and run until the tree root is first hit or it is started from the root and run until it has…
For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…
In the series of models with interacting particles in stochastic geometry, a new contribution presents the facet process which is defined in arbitrary Euclidean dimension. In 2D, 3D specially it is a process of interacting segments, flat…
We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we…
We present local mappings that relate the marginal probabilities of a global probability mass function represented by its primal normal factor graph to the corresponding marginal probabilities in its dual normal factor graph. The mapping is…
Consider the interchange process on a connected graph $G=(V,E)$ on $n$ vertices. I.e.\ shuffle a deck of cards by first placing one card at each vertex of $G$ in a fixed order and then at each tick of the clock, picking an edge uniformly at…