Related papers: Unimodular Hyperbolic Triangulations: Circle Packi…
We prove that in any recurrent reversible random rooted graph, two independent simple random walks started at the same vertex collide infinitely often almost surely. This applies to the Uniform Infinite Planar Triangulation and…
We consider a random walk on the support of a stationary simple point process on $R^d$, $d\geq 2$ which satisfies a mixing condition w.r.t.the translations or has a strictly positive density uniformly on large enough cubes. Furthermore the…
We study large uniform random maps with one face whose genus grows linearly with the number of edges, which are a model of discrete hyperbolic geometry. In previous works, several hyperbolic geometric features have been investigated. In the…
We prove that random walks on Thompson's group $F$ driven by strictly non-degenerate finitely supported probability measures $\mu$ have a non-trivial Poisson boundary. The proof consists in an explicit construction of two different…
We consider the simple random walk on the infinite cluster of a general class of percolation models on $\mathbb{Z}^d$, $d\geq 3$, including Bernoulli percolation as well as models with strong, algebraically decaying correlations. For almost…
Let N be a topologically finite, orientable 3-manifold with ideal triangulation. We show that if there is a solution to the hyperbolic gluing equations, then all edges in the triangulation are essential. This result is extended to a…
We obtain sharp estimates on the growth rate of stable commutator length on random (geodesic) words, and on random walks, in hyperbolic groups and groups acting nondegenerately on hyperbolic spaces. In either case, we show that with high…
Framing triangulations of unit flow polytopes have received a great deal of recent study with rich connections to various generalizations of Catalan and Cambrian combinatorics as well as volume and h*-polynomial formulas. This story has…
In this paper, we prove that given a hyperbolic polyhedral metric with an inversive distance circle packing, and a target discrete curvature satisfying Gauss-Bonnet formula, there exist a unique inversive distance circle packing which is…
We investigate lower asymptotic bounds of number variances for invariant locally square-integrable random measures on Euclidean and real hyperbolic spaces. In the Euclidean case we show that there are subsequences of radii for which the…
Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…
We consider the Poisson Boolean model of continuum percolation on a homogeneous Riemannian manifold $M$. Let $lambda$ be intensity of the Poisson process in the model and let $lambda_u$ be the infimum of the set of intensities that a.s.…
We consider one-dimensional Brownian motion conditioned (in a suitable sense) to have a local time at every point and at every moment bounded by some fixed constant. Our main result shows that a phenomenon of entropic repulsion occurs: that…
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…
Let $\Gamma$ be the fundamental group of a closed orientable surface of genus at least two. Consider the composition of a uniformly random element of $\mathrm{Hom}(\Gamma,S_n)$ with the $(n-1)$-dimensional irreducible representation of…
We consider the $N$-particle noncolliding Bernoulli random walk --- a discrete time Markov process in $\mathbb{Z}^{N}$ obtained from a collection of $N$ independent simple random walks with steps $\in\{0,1\}$ by conditioning that they never…
We study the local limits of uniform random triangulations with boundaries in the regime where the genus is proportional to the number of faces. Budzinski and Louf proved in 2020 that when there are no boundaries, the local limits exist and…
The main purpose of this article is to demonstrate three techniques for proving algebraicity statements about circle packings. We give proofs of three related theorems: (1) that every finite simple planar graph is the contact graph of a…
We prove the sharpness of the phase transition for speed in the biased random walk on the supercritical percolation cluster on Z^d. That is, for each d at least 2, and for any supercritical parameter p > p_c, we prove the existence of a…
Let H be a 3-uniform hypergraph with N vertices. A tight Hamilton cycle C \subset H is a collection of N edges for which there is an ordering of the vertices v_1, ..., v_N such that every triple of consecutive vertices {v_i, v_{i+1},…