Related papers: Loop vs. Bernoulli percolation on trees: strict in…
Theoretical attempts proposed so far to describe ordinary percolation processes on real-world networks rely on the locally tree-like ansatz. Such an approximation, however, holds only to a limited extent, as real graphs are often…
Consider an infinite, rooted, connected graph where each vertex is labelled with an independent and identically distributed Uniform(0,1) random variable, plus a parameter $\theta$ times its distance from the root $\rho$. That is, we label…
In this paper, we study invariant Poisson processes of lines (i.e, bi-infinite geodesics) in the $3$-regular tree. More precisely, there exists a unique (up to multiplicative constant) locally finite Borel measure on the space of lines that…
We describe a percolation problem on lattices (graphs, networks), with edge weights drawn from disorder distributions that allow for weights (or distances) of either sign, i.e. including negative weights. We are interested whether there are…
This text is based on a lecture for the Sheffield Probability Day; its main purpose is to survey some recent asymptotic results about Bernoulli bond percolation on certain large random trees with logarithmic height. We also provide a…
We study the fundamental question of how likely it is that two randomly chosen trees are isomorphic to each other for different models of random trees. We show that the probability decays exponentially for rooted labeled trees as well as…
We establish sharp asymptotic bounds for the critical intensity of the Finitary Random Interlacements (FRI) model in four and higher dimensions with general trajectory length distributions. Our proof reveals that the construction of…
We consider a model of random loops on Galton-Watson trees with an offspring distribution with high expectation. We give the configurations a weighting of $\theta^{\#\text{loops}}$. For many $\theta>1$ these models are equivalent to certain…
We perform Monte-Carlo simulations to study the Bernoulli ($p$) bond percolation on the enhanced binary tree which belongs to the class of nonamenable graphs with one end. Our numerical results show that the system has two different…
We present a numerical study of topological descriptors of initially Gaussian and scale-free density perturbations evolving via gravitational instability in an expanding universe. We carefully evaluate and avoid numerical contamination in…
We study the critical parameter u^{*} of random interlacements percolation (introduced by A.S Sznitman in arXiv:0704.2560) on a Galton-Watson tree conditioned on the non-extinction event. Starting from the previous work of A. Teixeira in…
In this paper we address the problem of testing whether two observed trees $(t,t')$ are sampled either independently or from a joint distribution under which they are correlated. This problem, which we refer to as correlation detection in…
We consider the random walk loop soup on the discrete half-plane and study the percolation problem, i.e. the existence of an infinite cluster of loops. We show that the critical value of the intensity is equal to 1/2. The absence of…
One class of random walks with infinite memory, so called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We…
We study the random-cluster model on trees and treelike graphs at low temperatures. This is a model of dependent percolation parametrized by an edge probability $p\in (0,1)$ and a clustering weight $q\in [1,\infty)$, generalizing…
We study the extremes of branching random walks under the assumption that the underlying Galton-Watson tree has infinite progeny mean. It is assumed that the displacements are either regularly varying or they have lighter tails. In the…
Consider Bernoulli bond percolation on a locally finite, connected graph $G$ and let $p_{\mathrm{cut}}$ be the threshold corresponding to a "first-moment method" lower bound. Kahn (\textit{Electron.\ Comm.\ Probab.\ Volume 8, 184-187.}…
In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…
We consider a Bernoulli bond percolation on a random recursive tree of size $n\gg 1$, with supercritical parameter $p_n=1-c/\ln n$ for some $c>0$ fixed. It is known that with high probability, there exists then a unique giant cluster of…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…