Related papers: The hyperbolic geometry of random transpositions

Let $\Gamma$ be a non-elementary Gromov-hyperbolic group, and $\partial \Gamma$ denote its Gromov boundary. We consider $\Gamma$-invariant proper $\delta$-hyperbolic, quasi-convex metric $d$ on $\Gamma$, and the associated…

For finitely supported random walks on finitely generated groups $G$ we prove that the identity map on $G$ extends to a continuous equivariant surjection from the Martin boundary to the Floyd boundary, with preimages of conical points being…

The motion of a graph is the minimal degree of its full automorphism group. Babai conjectured that the motion of a primitive distance-regular graph on $n$ vertices of diameter greater than two is at least $n/C$ for some universal constant…

The Gromov-Wasserstein (GW) distance enables comparing metric measure spaces based solely on their internal structure, making it invariant to isomorphic transformations. This property is particularly useful for comparing datasets that…

Let $(G_n) = \left((V_n,E_n)\right)$ be a sequence of finite connected vertex-transitive graphs with uniformly bounded vertex degrees such that $\lvert V_n \rvert \to \infty$ as $n \to \infty$. We say that percolation on $G_n$ has a sharp…

Let $(X,d)$ be a geodesic Gromov-hyperbolic space, $o \in X$ a basepoint and $\mu$ a countably supported non-elementary probability measure on $\operatorname{Isom}(X)$. Denote by $z_n$ the random walk on $X$ driven by the probability…

Let $G$ be a vertex-transitive graph of superlinear polynomial growth. Given $r>0$, let $G_r$ be the graph on the same vertex set as $G$, with two vertices joined by an edge if and only if they are at graph distance at most $r$ apart in…

Given $0<\alpha\leq\pi$, ${\epsilon}>0$ and $n$, we define random graphs on the $d$-dimensional sphere by drawing $n$ i.i.d. uniform random points for the vertices, and edges $u {\sim} v$ whenever the geodesic distance between $u$ and $v$…

The random walk with hyperbolic probabilities that we are introducing is an example of stochastic diffusion in a one-dimensional heterogeneous media. Although driven by site-dependent one-step transition probabilities, the process retains…

We propose a phenomenon of discrete-time quantum walks on graphs called the pulsation, which is a generalization of a phenomenon in the quantum searches. This phenomenon is discussed on a composite graph formed by two connected graphs…

We show that if H is a quasiconvex subgroup of a hyperbolic group G then the relative Cayley graph Y (also known as the Schreier coset graph) for G/H is Gromov-hyperbolic. We also observe that in this situation if G is torsion-free and…

We consider the following situation: G is a finite directed graph, where to each vertex of G is assigned an element of a finite group Gamma. We consider all walks of length N on G, starting from v_i and ending at v_j To each such walk $w$…

It is a fact simple to establish that the mixing time of the simple random walk on a d-regular graph $G_n$ with n vertices is asymptotically bounded from below by $d/ ((d-2)\log (d-1))\log n$. Such a bound is obtained by comparing the walk…

Gromov hyperbolicity of a metric space measures the distance of the space from a perfect tree-like structure. The measure has a "worst-case" aspect to it, in the sense that it detects a region in the space which sees the maximum deviation…

In this work we prove that the giant component of the Erd\"os--Renyi random graph $G(n,c/n)$ for c a constant greater than 1 (sparse regime), is not Gromov $\delta$-hyperbolic for any positive $\delta$ with probability tending to one as…

We give upper bounds, linear in rank, to the topological dimensions of the Gromov boundaries of the intersection graph, the free factor graph and the cyclic splitting graph of a finitely generated free group.

This paper deals with random walks on isometry groups of Gromov hyperbolic spaces, and more precisely with the dimension of the harmonic measure $\nu$ associated with such a random walk. We first establish a link of the form $\dim \nu \leq…

In this note we study the limiting behaviour of real valued functions on hyperbolic groups as we travel along typical geodesic rays in the Gromov boundary of the group. Our results apply to group homomorphisms, certain quasimorphisms and to…

Many signals evolve in time as a stochastic process, randomly switching between states over discretely sampled time points. Here we make an explicit link between the underlying stochastic process of a signal that can take on a bounded…

Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is crucial for studying its random…