Related papers: Horocyclic products of trees

By developing the entropy theory of random walks on equivalence relations and analyzing the asymptotic geometry of horospheric products we describe the Poisson boundary for random walks on random horospheric products of trees.

We introduce the peak normal form of elements of the Baumslag-Solitar groups BS(p,q). This normal form is very close to the length-lexicographical normal form, but more symmetric. Both normal forms are geodesic. This means the normal form…

The main goal of this paper is to determine the Poisson boundary of lamplighter random walks over a general class of discrete groups $\Gamma$ endowed with a rich boundary. The starting point is the Strip Criterion of identification of the…

We explore the geometry of the Cayley graphs of the lamplighter groups and a wide range of wreath products. We show that these groups have dead end elements of arbitrary depth with respect to their natural generating sets. An element $w$ in…

Let $t,q$ and $n$ be positive integers. Write $[q] = \{1,2,\ldots,q\}$. The generalized Hamming graph $H(t,q,n)$ is the graph whose vertex set is the cartesian product of $n$ copies of $[q]$ ($q\ge 2$), where two vertices are adjacent if…

We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

Let $S$ be a set of transpositions that generates the symmetric group $S_n$, where $n \ge 3$. The transposition graph $T(S)$ is defined to be the graph with vertex set $\{1,\ldots,n\}$ and with vertices $i$ and $j$ being adjacent in $T(S)$…

Suppose we are given a homogeneous tree $\mathcal{T}_q$ of degree $q\geq 3$, where at each vertex sits a lamp, which can be switched on or off. This structure can be described by the wreath product $(\mathbb{Z}/2)\wr \Gamma$, where…

This article provides a method to calculate the fixed-point proportion of any iterated wreath product acting on a $d$-regular tree. Moreover, the method applies to a generalization of iterated wreath products acting on a $d$-regular tree,…

Generalizing works of D'Angeli and Donno, we describe, starting from an infinite sequence over $r$ letters with $r \neq 4i$ and $i \in \mathbb{N}$, a sequence of pointed finite graphs. We study the pointed Gromov-Hausdorff limit graphs…

The usual random walk on a group (homogeneous both in time and in space) is determined by a probability measure on the group. In a random walk with random transition probabilities this single measure is replaced with a stationary sequence…

We define an inhomogeneous percolation model on "ladder graphs" obtained as direct products of an arbitrary graph $G = (V,E)$ and the set of integers $\mathbb{Z}$ (vertices are thought of as having a "vertical" component indexed by an…

In this paper we study the description of the functional graphs associated with the power maps over finite groups. We present a structural result which describes the isomorphism class of these graphs for abelian groups and also for flower…

Suppose Gamma is an S-arithmetic subgroup of a connected, semisimple algebraic group G over a global field Q (of any characteristic). It is well known that Gamma acts by isometries on a certain CAT(0) metric space X_S that is a Cartesian…

We give a complete description of the Poisson boundary of wreath products $A\wr B= \bigoplus_{B} A\rtimes B$ of countable groups $A$ and $B$, for probability measures $\mu$ with finite entropy where lamp configurations stabilize almost…

As a vital link between group theory and graph theory, Cayley graphs provide a geometric framework for encoding algebraic structures. This study explores the properties of Cayley graphs derived from cyclic groups whose order is the square…

We examine the geometry of the Cayley graph of the lamplighter group with respect to the generating set rising from its interpretation as an automata group due to Grigorchuk and Zuk. We find some metric behavior with respect to this…

For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…

Let $\Gamma$ be a torsion free cocompact lattice in $\aut(\cl T_1)\times\aut(\cl T_2)$, where $\cl T_1$, $\cl T_2$ are trees whose vertices all have degree at least three. The group $H_2(\Gamma, \bb Z)$ is determined explicitly in terms of…

We study a special class of graphs with a strong transience feature called uniform transience. We characterize uniform transience via a Feller-type property and via validity of an isoperimetric inequality. We then give a further…