Related papers: The bunkbed problem and the random cluster model
We determine the sharp threshold for the containment of all $n$-vertex trees of bounded degree in random geometric graphs with $n$ vertices. This provides a geometric counterpart of Montgomery's threshold result for binomial random graphs,…
Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deterministic spreading rule with a fixed parameter k: if a vacant site has…
Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper we study the convergence of random tree sequences with given…
We consider translationally-invariant percolation models on $\mathbb{Z}^d$ satisfying the finite energy and the FKG properties. We provide explicit upper bounds on the probability of having two distinct clusters going from the endpoints of…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general…
In this article, we introduce a formal definition of the concept of probability tree and conduct a detailed and comprehensive study of its fundamental structural properties. In particular, we define what we term an inductive probability…
We study homogeneous, independent percolation on general quasi-transitive graphs. We prove that in the disorder regime where all clusters are finite almost surely, in fact the expectation of the cluster size is finite. This extends a…
A split tree of cardinality $n$ is constructed by distributing $n$ "balls" in a subset of vertices of an infinite tree which encompasses many types of random trees such as $m$-ary search trees, quad trees, median-of-$(2k+1)$ trees,…
We consider simple random walk on the incipient infinite cluster for the spread-out model of oriented percolation on $Z^d \times Z_+$. In dimensions $d>6$, we obtain bounds on exit times, transition probabilities, and the range of the…
An important conjecture in percolation theory is that almost surely no infinite cluster exists in critical percolation on any transitive graph for which the critical probability is less than 1. Earlier work has established this for the…
We give an example of a long range Bernoulli percolation process on a group non-quasi-isometric with $\mathbb{Z}$, in which clusters are almost surely finite for all values of the parameter. This random graph admits diverse equivalent…
We study the emergence of the giant component in the random cluster model on the complete graph, which was first studied by Bollob\'as, Grimmett, and Janson. We give an alternative analysis using a thermodynamic/large deviations approach…
Let $G$ be a finitely generated group and $X$ its Cayley graph with respect to a finite, symmetric generating set $S$. Furthermore, let $H$ be a finite group and $H \wr G$ the lamplighter group (wreath product) over $G$ with group of…
In the context of percolation in a regular tree, we study the size of the largest cluster and the length of the longest run starting within the first d generations. As d tends to infinity, we prove almost sure and weak convergence results.
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…
The Gy\'arf\'as tree packing conjecture asserts that any set of trees with $2,3, ..., k$ vertices has an (edge-disjoint) packing into the complete graph on $k$ vertices. Gy\'arf\'as and Lehel proved that the conjecture holds in some special…
We prove that there is $c>0$ such that for all sufficiently large $n$, if $T_1,\dots,T_n$ are any trees such that $T_i$ has $i$ vertices and maximum degree at most $cn/\log n$, then $\{T_1,\dots,T_n\}$ packs into $K_n$. Our main result…
We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…
We prove that, for every $k=1,2,...,$ every shortest-path metric on a graph of pathwidth $k$ embeds into a distribution over random trees with distortion at most $c$ for some $c=c(k)$. A well-known conjecture of Gupta, Newman, Rabinovich,…