Related papers: Lamplighters, Diestel-Leader graphs, random walks,…
Our objective is to explore random walks on the general linear group, constrained to a specific domain, with a primary focus on establishing the conditioned local limit theorem. This paper marks the initial stride toward achieving this…
Given a finite graph G, a vertex of the lamplighter graph consists of a zero-one labeling of the vertices of G, and a marked vertex of G. For transitive graphs G, we show that, up to constants, the relaxation time for simple random walk in…
A lattice is a partially ordered set supporting a meet (or join) operation that returns the largest lower bound (smallest upper bound) of two elements. Just like graphs, lattices are a fundamental structure that occurs across domains…
The kernel of the natural projection of a graph product of groups onto their direct product is called the Cartesian subgroup of the graph product. This construction generalises commutator subgroups of right-angled Coxeter and Artin groups.…
In this article, we introduce halo products as a natural generalisation of wreath products. They also encompass lampshuffler groups $\mathrm{FSym}(H) \rtimes H$ and lampcloner groups $\mathrm{FGL}(H) \rtimes H$, as well as many possible…
A new characterization of the Lovasz theta function is provided by relating it to the (weighted) walk-generating function, thus establishing a relationship between two seemingly quite distinct concepts in algebraic graph theory. An…
A practical approach is proposed to construct short presentations for Euclidean crystallographic groups in terms of generators and relations. For our purposes a short presentation is the one with a small number of short relators for a given…
In this article we start a systematic study of the bi-Lipschitz geometry of lamplighter graphs. We prove that lamplighter graphs over trees bi-Lipschitzly embed into Hamming cubes with distortion at most~$6$. It follows that lamplighter…
We introduce a theory of probability in $\lambda$-rings designed to efficiently describe random variables valued in multisets of complex numbers, varieties over a field, or other similar enriched settings. A key role is played by the…
A resistance network is a connected graph $(G,c)$. The conductance function $c_{xy}$ weights the edges, which are then interpreted as resistors of possibly varying strengths. The relationship between the natural Dirichlet form $\mathcal E$…
The goal is to extend a non-standard amenability test for groups, based on random walks and superharmonic functions, to group actions on sets, and to apply it to Thompson's group F using certain properties of extensive amenability. While no…
We observe that embeddings into random metrics can be fruitfully used to study the $L_1$-embeddability of lamplighter graphs or groups, and more generally lamplighter metric spaces. Once this connection has been established, several new…
In this paper, we investigate spectral properties of discrete Laplacians. Our study is based on the Hardy inequality and the use of super-harmonic functions. We recover and improve lower bounds for the bottom of the spectrum and of the…
Let $G$ be a compact Lie group and $P_{e,a}(G)=C([0,1]\to G~|~\gamma(0)=e, \gamma(1)=a)$ be the pinned path space with a pinned Brownian motion measure $\nu_{\lambda,a}$ defined by the heat kernel $p(\lambda^{-1}t,x,y)$, where $\lambda$ is…
We develop a general theory of random walks on hypergraphs which includes, as special cases, the different models that are found in literature. In particular, we introduce and analyze general random walk Laplacians for hypergraphs, and we…
We study the boundary value problems for harmonic functions on open connected subsets of post-critically finite (p.c.f.) self-similar sets, on which the Laplacian is defined through a strongly recurrent self-similar local regular Dirichlet…
We consider multidimensional random walks in pyramidal cones (or multidimensional orthants), which are intersections of a finite number of half-spaces. We explore the connection between the existence of (positive) discrete harmonic…
We consider the well-known Rosenbloom-Tsfasman function field lattices in the special case of Hermitian function fields. We show that in this case the resulting lattices are generated by their minimal vectors, provide an estimate on the…
Random walks on the circle group $\mathbb{R}/\mathbb{Z}$ whose elementary steps are lattice variables with span $\alpha \not\in \mathbb{Q}$ or $p/q \in \mathbb{Q}$ taken mod $\mathbb{Z}$ exhibit delicate behavior. In the rational case we…
We consider random walks $\lambda$-biased towards the root on a Galton-Watson tree, whose offspring distribution $(p_k)_{k\geq 1}$ is non-degenerate and has finite mean $m>1$. In the transient regime $0<\lambda<m$, the loop-erased…