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

Consider a stochastic process that behaves as a $d$-dimensional simple and symmetric random walk, except that, with a certain fixed probability, at each step, it chooses instead to jump to a given site with probability proportional to the…

In this article, we study a simple random walk on a decorated Galton-Watson tree, obtained from a Galton-Watson tree by replacing each vertex of degree $n$ with an independent copy of a graph $G_n$ and gluing the inserted graphs along the…

We bound the rate of convergence to uniformity for certain random walks on the complete monomial groups G \wr S_n for any group G. These results provide rates of convergence for random walks on a number of groups of interest: the…

We give an overview of how to construct continued fractions on the Heisenberg group $\mathbb{H}$, the projective and planar Siegel models of the group, and how to perform computations on the group using matrices. We discuss and work with…

Real networks often grow through the sequential addition of new nodes that connect to older ones in the graph. However, many real systems evolve through the branching of fundamental units, whether those be scientific fields, countries, or…

Complex networks have become increasingly popular for modeling various real-world phenomena. Realistic generative network models are important in this context as they avoid privacy concerns of real data and simplify complex network research…

The study of matter fields on an ensemble of random geometries is a difficult problem still in need of new methods and ideas. We will follow a point of view inspired by probability theory techniques that relies on an expansion of the two…

Let $\mathcal{M}_g$ be the moduli space of hyperbolic surfaces of genus g endowed with the Weil-Petersson metric. In this paper, we introduce a function $L(g)$ of genus $g$ and call the geodesics whose length less than $L(g)$ short…

Hyperbolicity is a graph parameter related to how much a graph resembles a tree with respect to distances. Its computation is challenging as the main approaches consist in scanning all quadruples of the graph or using fast matrix…

Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…

We study graph-theoretic properties of the trace of a random walk on a random graph. We show that for any $\varepsilon>0$ there exists $C>1$ such that the trace of the simple random walk of length $(1+\varepsilon)n\ln{n}$ on the random…

We give upper bounds for $L^p$ norms of eigenfunctions of the Laplacian on compact hyperbolic surfaces in terms of a parameter depending on the growth rate of the number of short geodesic loops passing through a point. When the genus $g \to…

In this work we propose a novel method to calculate mean first-passage times (MFPTs) for random walks on graphs, based on a dimensionality reduction technique for Markov State Models, known as local-equilibrium (LE). We show that for a…

We extend some properties of random walks on hyperbolic groups to random walks on convergence groups. In particular we prove that if a convergence group $G$ acts on a compact metrizable space $M$ with the convergence property then we can…

Given a connected graph $G$ with some subset of its vertices excited and a fixed target vertex, in the geodesic-biased random walk on $G$, a random walker moves as follows: from an unexcited vertex, she moves to a uniformly random…

Let $S=\Gamma\backslash \mathbb{H}$ be a hyperbolic surface of finite topological type, such that the Fuchsian group $\Gamma \le \operatorname{PSL}_2(\mathbb{R})$ is non-elementary, and consider any generating set $\mathfrak S$ of $\Gamma$.…

We investigate the statistics of three kinds of records associated with planar random walks, namely diagonal, simultaneous and radial records. The mean numbers of these records grow as universal power laws of time, with respective exponents…

This paper gives lower bounds on the spectral radius of vertex-transitive graphs, based on the number of ``prime cycles'' at a vertex. The bounds are obtained by constructing circuits in the graph that resemble ``cactus trees'', and…

We discuss recurrence and ergodicity properties of random walks and associated skew products for large classes of locally compact groups and homogeneous spaces. In particular we show that a closed subgroup of a product of finitely many…

Stack-triangulations appear as natural objects when one wants to define some increasing families of triangulations by successive additions of faces. We investigate the asymptotic behavior of rooted stack-triangulations with $2n$ faces under…