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

We analyze site percolation on directed and undirected graphs with site-dependent open-site probabilities. We construct upper bounds on cluster susceptibilities, vertex connectivity functions, and the expected number of simple open cycles…

For massless vertex-transitive transient graphs, the percolation phase transition for the level sets of the Gaussian free field on the associated continuous cable system is particularly well understood, and in particular the associated…

Recently, many results have been established drawing a parallel between Bernoulli percolation and models given by levels of smooth Gaussian fields with unbounded, strongly decaying correlation. In a previous work with D. Gayet , we started…

We examine quantum transport in periodic quantum graphs with a vertex coupling non-invariant with respect to time reversal. It is shown that the graph topology may play a decisive role in the conductivity properties illustrating this claim…

We study arc graphs and curve graphs for surfaces of infinite topological type. First, we define an arc graph relative to a finite number of (isolated) punctures and prove that it is a connected, uniformly hyperbolic graph of infinite…

In this paper, we prove that Bernoulli percolation on bounded degree graphs with isoperimetric dimension $d>4$ undergoes a non-trivial phase transition (in the sense that $p_c<1$). As a corollary, we obtain that the critical point of…

We investigate a novel first-passage percolation model, referred to as the Brochette first-passage percolation model, where the passage times associated with edges lying on the same line are equal. First, we establish a point-to-point…

We consider the branching random walk $\{\mathcal R^N_z: z\in V_N\}$ with Gaussian increments indexed over a two-dimensional box $V_N$ of side length $N$, and we study the first passage percolation where each vertex is assigned weight…

We consider standard first-passage percolation on $\Z^d$. Let $e_1$ be the first coordinate vector. Let $a(n)$ be the expected passage time from the origin to $ne_1$. In this short paper, we note that $a(n)$ is increasing under some strong…

We prove Schramm's locality conjecture for Bernoulli bond percolation on transitive graphs: If $(G_n)_{n\geq 1}$ is a sequence of infinite vertex-transitive graphs converging locally to a vertex-transitive graph $G$ and $p_c(G_n) \neq 1$…

We study random walks on supercritical percolation clusters on wedges in $\Z^3$, and show that the infinite percolation cluster is (a.s.) transient whenever the wedge is transient. This solves a question raised by O. Haggstrom and E.…

We show that a geodesic metric space is hyperbolic in the sense of Gromov if and only if intersections of balls have bounded eccentricity. In particular, $\R$-trees are characterized among geodesic metric spaces by the property that the…

We show that a bijection $f:\mathbb{H}^2\rightarrow\mathbb{H}^2$ of the hyperbolic plane that sends horocycles to horocycles (respectively hypercycles to hypercycles) is an isometry. This extends a previous result of J. Jeffers on geodesics…

Let $G=(V,E)$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. In recent work, we conjectured that if $G$ is nonamenable then the matrix of critical connection probabilities…

In this paper we exhibit Morse geodesics, often called "hyperbolic directions", in infinite unbounded torsion groups. The groups studied are lacunary hyperbolic groups and constructed using graded small cancellation conditions. In all…

An isoperimetric upper bound on the resistance is given. As a corollary we resolve two problems, regarding mean commute time on finite graphs and resistance on percolation clusters. Further conjectures are presented.

Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Alavi, Erd\H{o}s, Malde and Schwenk made the conjecture that if $G$ is a tree then the independent set sequence $\{i_t(G)\}_{t\geq 0}$ of $G$ is unimodal; Levit and…

We give a combinatorial proof, using the hyperbolicity of the curve graphs, of the bounded geodesic image theorem of Masur and Minsky. Recently it has been shown that curve graphs are uniformly hyperbolic, thus a universal bound can be…

The jigsaw percolation process on graphs was introduced by Brummitt, Chatterjee, Dey, and Sivakoff as a model of collaborative solutions of puzzles in social networks. Percolation in this process may be viewed as the joint connectedness of…

In this paper we study a version of (non-Markovian) first passage percolation on graphs, where the transmission time between two connected vertices is non-iid, but increases by a penalty factor polynomial in their expected degrees. Based on…