English
Related papers

Related papers: First Passage percolation on a hyperbolic graph ad…

200 papers

We construct a category of examples of partially hyperbolic geodesic flows which are not Anosov, deforming the metric of a compact locally symmetric space of nonconstant negative curvature. Candidates for such example as the product metric…

Dynamical Systems · Mathematics 2013-03-12 Fernando A. Carneiro , Enrique R. Pujals

In the random $r$-neighbour bootstrap percolation process on a graph $G$, a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently with probability $p\in (0,1)$, and "healthy" vertices get…

Combinatorics · Mathematics 2024-06-21 Mihyun Kang , Michael Missethan , Dominik Schmid

It is believed that, under very general conditions, bi-infinite geodesics (or bigeodesics) do not exist for planar first and last passage percolation (LPP) models. However, if one endows the model with a natural dynamics, thereby gradually…

Probability · Mathematics 2025-11-03 Manan Bhatia

Every closed hyperbolic geodesic $\gamma$ on the triply--punctured sphere $M =\widehat{{\mathbb C}} - \{0,1,\infty\}$ has a self--intersection number $I(\gamma) \ge 1$ and a combinatorial length $L(\gamma) \ge 2$, the latter defined by the…

Geometric Topology · Mathematics 2017-03-09 Moira Chas , Curtis T. McMullen , Anthony Phillips

We construct an edge-weight distribution for i.i.d. first-passage percolation on $\mathbb{Z}^2$ whose limit shape is not a polygon and whose extreme points are arbitrarily dense in the boundary. Consequently, the associated Richardson-type…

Probability · Mathematics 2013-03-14 Michael Damron , Michael Hochman

Suppose that $X$ is an infinite, connected, locally finite, quasi-transitive graph with the property that every bi-infinite quasi-geodesic uniformly coarsely separates $X$ into exactly two deep pieces. We show that such an $X$ is…

Group Theory · Mathematics 2025-11-17 Joseph MacManus

Let $\mathbb{G}=\left(\mathbb{V},\mathbb{E}\right)$ be the graph obtained by taking the cartesian product of an infinite and connected graph $G=(V,E)$ and the set of integers $\mathbb{Z}$. We choose a collection $\mathcal{C}$ of finite…

Probability · Mathematics 2019-10-29 Bernardo N. B. de Lima , Humberto C. Sanna

In this paper we establish some relations between percolation on a given graph G and its geometry. Our main result shows that, if G has polynomial growth and satisfies what we call the local isoperimetric inequality of dimension d > 1, then…

Probability · Mathematics 2014-09-23 Augusto Teixeira

Given a geodesic line $\gamma$ the hyperbolic space $\mathbb H^n$ we formulate a necessary and sufficient condition for a function along this geodesic which measure the mean curvature of totally umbilical leaves of a foliation orthogonal to…

Differential Geometry · Mathematics 2018-06-27 Maciej Czarnecki

In this paper we study variations of an old result by M\"{u}ller, Reiterman, and the last author stating that a countable graph has a subgraph with infinite degrees if and only if in any labeling of the vertices (or edges) of this graph by…

Combinatorics · Mathematics 2019-05-10 Andrii Arman , Bradley Elliott , Vojtěch Rödl

We study a version of first passage percolation on $\mathbb{Z}^d$ where the random passage times on the edges are replaced by contact times represented by random closed sets on $\mathbb{R}$. Similarly to the contact process without…

Probability · Mathematics 2026-02-02 Benedikt Jahnel , Lukas Lüchtrath , Anh Duc Vu

Using systematically isothermal coordinates we show that there exist three different maximal extensions of the original Einstein-Rosen bridge. One of them, the hyperbolic Einstein-Rosen bridge, has two-dimensional sections diffeomorphic to…

General Relativity and Quantum Cosmology · Physics 2019-09-13 Pau Beltrán-Palau , Miguel Portilla

We construct cross sections for the geodesic flow on the orbifolds $\Gamma\backslash H$ which are tailor-made for the requirements of transfer operator approaches to Maass cusp forms and Selberg zeta functions. Here, $H$ denotes the…

Dynamical Systems · Mathematics 2013-05-14 Anke D. Pohl

We consider the model of i.i.d. first passage percolation on Z^d, where we associate with the edges of the graph a family of i.i.d. random variables with common distribution G on [0, +$\infty$] (including +$\infty$). Whereas the time…

Probability · Mathematics 2018-09-25 Raphaël Rossignol , Marie Théret

We show that adding epsilon-Bernoulli percolation to an everywhere percolating subgraph of Z^2 results in a graph which has large scale geometry similar to that of supercritical Bernoulli percolation, in various specific senses. We…

Probability · Mathematics 2009-10-31 Itai Benjamini , Olle Häggström , Oded Schramm

Moduli spaces of hyperbolic surfaces with geodesic boundary components of fixed lengths may be endowed with a symplectic structure via the Weil-Petersson form. We show that, as the boundary lengths are sent to infinity, the Weil-Petersson…

Geometric Topology · Mathematics 2010-10-21 Norman Do

We study an inverse problem on a finite connected graph G = (X, E), on whose vertices a conductivity {\gamma} is defined. Our data consists in a sequence of partial observations of a fractional random walk on G. The observations are partial…

Analysis of PDEs · Mathematics 2026-04-13 Giovanni Covi , Matti Lassas

There exists a Lipschitz embedding of a d-dimensional comb graph (consisting of infinitely many parallel copies of Z^{d-1} joined by a perpendicular copy) into the open set of site percolation on Z^d, whenever the parameter p is close…

Probability · Mathematics 2012-02-01 Alexander E. Holroyd , James Martin

Motivated by Gromov's geodesic flow problem on hyperbolic groups $G$, we develop in this paper an analog using random walks. This leads to a notion of a harmonic analog $\Theta$ of the Bowen-Margulis-Sullivan measure on $\partial^2 G$. We…

Probability · Mathematics 2026-02-03 Luzie Kupffer , Mahan Mj , Chiranjib Mukherjee

Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…

Combinatorics · Mathematics 2021-05-21 Omer Angel , Yinon Spinka