Related papers: A pattern theorem for lattice clusters
We derive "quenched" subdiffusive lower bounds for the exit time tau(n) from a box of size n for the simple random walk on the planar invasion percolation cluster. The first part of the paper is devoted to proving an almost sure analog of…
In this article we focus on a general model of random walk on random marked trees. We prove a recurrence criterion, analogue to the recurrence criterion proved by R. Lyons and Robin Pemantle (1992) in a slightly different model. In the…
We consider diffusion limited aggregation of particles of two different kinds. It is assumed that a particle of one kind may adhere only to another particle of the same kind. The particles aggregate on a linear substrate which consists of…
Let $\{V_{i,j}; (i,j)\in\N^2\}$ be a two-dimensional array of i.i.d.\ random variables. The limit laws of the sum of independent random products $$ Z_n=\sum_{i=1}^{N_n} \prod_{j=1}^{n} e^{V_{i,j}} $$ as $n,N_n\to\infty$ have been…
A new ``Percolation with Clustering'' (PWC) model is introduced, where (the probabilities of) site percolation configurations on the leaf set of a binary tree are rewarded exponentially according to a generic function, which measures the…
We consider the problem of constructing dense lattices of R^n with a given automorphism group. We exhibit a family of such lattices of density at least cn/2^n, which matches, up to a multiplicative constant, the best known density of a…
We study percolation on nonamenable groups at the uniqueness threshold $p_u$, the critical value that separates the phase in which there are infinitely many infinite clusters from the phase in which there is a unique infinite cluster. The…
An overview is presented of recent work on some statistical problems on multiparticle random walks. We consider a Euclidean, deterministic fractal or disordered lattice and N >> 1 independent random walkers initially (t=0) placed onto the…
We present a framework for the partitioning of a spatial trajectory in a sequence of segments based on spatial density and temporal criteria. The result is a set of temporally separated clusters interleaved by sub-sequences of unclustered…
Given a class of objects, a pattern theorem is a powerful result describing their structure. We show that alternating knots exhibit a pattern theorem, and use this result to prove a long-standing conjecture that alternating knots grow rare.…
We demonstrate that a tree-based theory for various dynamical processes yields extremely accurate results for several networks with high levels of clustering. We find that such a theory works well as long as the mean intervertex distance…
By proving a local limit theorem for higher-order transitions, we determine the time required for necklace chains to be close to stationarity. Because necklace chains, built by arranging identical smaller chains around a directed cycle, are…
For $d \geq 2$ and $n \in \mathbb{N}$, let $\mathsf{W}_n$ denote the uniform law on self-avoiding walks beginning at the origin in the integer lattice $\mathbb{Z}^d$, and write $\Gamma$ for a $\mathsf{W}_n$-distributed walk. We show that…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…
We consider a discrete time simple symmetric random walk on Z^d, d>=1, where the path of the walk is perturbed by inserting deterministic jumps. We show that for any time n and any deterministic jumps that we insert, the expected number of…
Classical blockmodel is known as the simplest among models of networks with community structure. The model can be also seen as an extremely simply example of interconnected networks. For this reason, it is surprising that the percolation…
We give exact relations for a number of amplitude combinations that occur in the study of self-avoiding walks, polygons and lattice trails. In particular, we elucidate the lattice-dependent factors which occur in those combinations which…
The two-dimensional comb lattice $C_2$ is a natural spanning tree of the Euclidean lattice $\mathbb{Z}^2$. We study three related cluster growth models on $C_2$: internal diffusion limited aggregation (IDLA), in which random walkers move on…
Genome wide comparisons between enteric bacteria yield large sets of conserved putative regulatory sites on a gene by gene basis that need to be clustered into regulons. Using the assumption that regulatory sites can be represented as…
We prove central limit theorems (CLTs) for topological functionals of Bernoulli bond percolation on infinite graphs beyond the Euclidean lattice $\mathbb{Z}^{d}$. For quasi-transitive graphs of subexponential growth, we show that the number…