Related papers: First passage percolation on nilpotent Cayley grap…

We establish several equivalent characterisations of the anchored isoperimetric dimension of supercritical clusters in Bernoulli bond percolation on transitive graphs. We deduce from these characterisations together with a theorem of…

The $n$-dimensional binary hypercube is the graph whose vertices are the binary $n$-tuples $\{0, 1\}^n$ and where two vertices are connected by an edge if they differ at exactly one coordinate. We prove that if the edges are assigned…

We show that the total variation mixing time is not quasi-isometry invariant, even for Cayley graphs. Namely, we construct a sequence of pairs of Cayley graphs with maps between them that twist the metric in a bounded way, while the ratio…

This monograph resolves - in a dense class of cases - several open problems concerning geodesics in i.i.d. first-passage percolation on $\mathbb{Z}^d$. Our primary interest is in the empirical measures of edge-weights observed along…

One model of real-life spreading processes is First Passage Percolation (also called SI model) on random graphs. Social interactions often follow bursty patterns, which are usually modelled with i.i.d.~heavy-tailed passage times on edges.…

We study non-random fluctuation in the first passage percolation on $\mathbb{Z}^d$ and show that it diverges for any dimension. We also prove the divergence of the non-random shape fluctuation, which was conjectured in [Yu Zhang. The…

Given a quasi-transitive infinite graph $G$ with volume growth rate ${\rm gr}(G),$ a transient biased electric network $(G,\, c_1)$ with bias $\lambda_1\in (0,\,{\rm gr}(G))$ and a recurrent biased one $(G,\, c_2)$ with bias $\lambda_2\in…

We study a geometric version of first-passage percolation on the complete graph, known as long-range first-passage percolation. Here, the vertices of the complete graph $\mathcal K_n$ are embedded in the $d$-dimensional torus $\mathbb…

We investigate fast diffusions on finite directed graphs. We prove results in a way dual to presented in Bobrowski, A. Ann. Henri Poincar\'e (2012) 13(6): 1501-1510 and Bobrowski, A., Morawska, K. DCDS-B (2012), 17(7): 2313-2327, and obtain…

In this paper we study spectral properties of adjacency and Laplace operators on percolation subgraphs of Cayley graphs of amenable, finitely generated groups. In particular we describe the asymptotic behaviour of the integrated density of…

Consider $\Xi$ a homogeneous Poisson point process on $\mathbb{R}^d$ ($d\geq 2$) with unit intensity with respect to the Lebesgue measure. For $\varepsilon\geq 0$, we define the Boolean model $\Sigma_{p, \varepsilon}$ as the union of the…

We study upper bounds for the first non-zero eigenvalue of the Steklov problem defined on finite graphs with boundary. For finite graphs with boundary included in a Cayley graph associated to a group of polynomial growth, we give an upper…

The connective constant $\mu(G)$ of an infinite transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. In earlier work of Grimmett and Li, a locality theorem was proved for connective…

We introduce a generalisation of Sch\"{u}tz and Trimper's elephant random walk to finitely generated groups. We focus on the simplest non-abelian setting, i.e. groups whose Cayley graphs are homogeneous trees of degree $d \ge 3$. We show…

Recently, we adapted exploration and martingale arguments of Nachmias and Peres, in turn based on ideas of Martin-L\"of, Karp and Aldous, to prove asymptotic normality of the number $L_1$ of vertices in the largest component $C$ of the…

Let $G$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. We prove that if $G$ is nonamenable and $p > p_c(G)$ then there exists a positive constant $c_p$ such that \[\mathbf{P}_p(n \leq |K| <…

Let $(G_n)$ be a sequence of finite connected vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)$ is a percolation threshold if for every $\varepsilon > 0$, the proportion $\left\lVert K_1…

Let $T$ be a random ergodic pseudometric over $\mathbb R^d$. This setting generalizes the classical \emph{first passage percolation} (FPP) over $\mathbb Z^d$. We provide simple conditions on $T$, the decay of instant one-arms and…

We prove hypergraph variants of the celebrated Alon-Roichman theorem on spectral expansion of sparse random Cayley graphs. One of these variants implies that for every prime $p\geq 3$ and any $\varepsilon > 0$, there exists a set of…

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…