Related papers: Growth Series and Random Walks on Some Hyperbolic …

Extending the analogous result of Cannon and Wagreich for the fundamental groups of surfaces, we show that, for the l-regular graphs X associated to regular tessellations of hyperbolic plane by m-gons, the denominators of the growth series…

Consider $G=SL_2(\mathbb{Z})/\{\pm I\}$ acting on the complex upper half plane $H$ by $h_M(z)=\frac{az+b}{cz+d},$ for $M \in G$. Let $D=\{z \in H: |z|\geq 1, |\Re(z)|\leq 1/2\}$. We consider the set $\mathcal{E} \subset G$ with the $9$…

We show the existence of a trace process at infinity for random walks on hyperbolic groups of conformal dimension < 2 and relate it to the existence of a reflecting random walk. To do so, we employ the theory of Dirichlet forms which…

In the hyperbolic plane there are infinite regular lattices. From a fix vertex of a lattice tree graphs can be constructed recursively to the next layers with edges of the lattice. In this article we examine the properties of the growing of…

The starting point is the known fact that some much-studied random walks on permutations, such as the Tsetlin library, arise from walks on real hyperplane arrangements. This paper explores similar walks on complex hyperplane arrangements.…

In this paper we construct spanning trees in hyperbolic graphs that represent their hyperbolic compactification in a good way: so that the tree has a bounded number of distinct rays to each boundary point. The bound depends only on the…

We show that simple random walks on (non-trivial) relatively hyperbolic groups stay $O(\log(n))$-close to geodesics, where $n$ is the number of steps of the walk. Using similar techniques we show that simple random walks in mapping class…

We propose the study of Markov chains on groups as a "quasi-isometry invariant" theory that encompasses random walks. In particular, we focus on certain classes of groups acting on hyperbolic spaces including (non-elementary) hyperbolic and…

We define some new sequences of recursively constructed random combinatorial trees, and show that, after properly rescaling graph distance and equipping the trees with the uniform measure on vertices, each sequence converges almost surely…

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…

We present a careful approximation of the geodesics in trees of hyperbolic or relatively hyperbolic groups. As an application we prove a combination theorem for finite graphs of relatively hyperbolic groups, with both Farb's and Gromov's…

We study the random planar maps obtained from supercritical Galton--Watson trees by adding the horizontal connections between successive vertices at each level. These are the hyperbolic analog of the maps studied by Curien, Hutchcroft and…

We show an efficient algorithm for generating geodesic regular tree structures for periodic hyperbolic and Euclidean tessellations and experimentally verify its performance on tessellations.

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…

We investigate the translation lengths of group elements that arise in random walks on the isometry groups of Gromov hyperbolic spaces. In particular, without any moment condition, we prove that non-elementary random walks exhibit at least…

Random graphs are a central element of the study of complex dynamical networks such as the internet, the brain, or socioeconomic phenomena. New methods to generate random graphs can spawn new applications and give insights into more…

We present two constructions, both inspired by ideas from graph theory, of sequences random surfaces of growing area, whose systoles grow logarithmically as a function of their area. This also allows us to prove a new lower bound on the…

We generalize the notion of tight geodesics in the curve complex to tight trees. We then use tight trees to construct model geometries for certain surface bundles over graphs. This extends some aspects of the combinatorial model for doubly…

Let G be a countable group which acts by isometries on a separable, but not necessarily proper, Gromov hyperbolic space X. We say the action of G is weakly hyperbolic if G contains two independent hyperbolic isometries. We show that a…