Related papers: Lamplighters, Diestel-Leader graphs, random walks,…

Numerical estimates are given for the spectral radius of simple random walks on Cayley graphs. Emphasis is on the case of the fundamental group of a closed surface, for the usual system of generators.

The paper consists of two parts. In the first part we review recent work on limit theorems for random walks in random environment (RWRE) on a strip with jumps to the nearest layers. In the second part, we prove the quenched Local Limit…

We define a random walk problem which admits analytic results, on a class of infinite periodic lattices which are directed and colored. Our approach is motivated from the fact that such lattices arise in string theoretic constructs of…

Focusing on coupling between edges, we generalize the relationship between the normalized graph Laplacian and random walks on graphs by devising an appropriate normalization for the Hodge Laplacian -- the generalization of the graph…

The random billiard walk is a stochastic process $(L_t)_{t\geq 0}$ in which a laser moves through the Coxeter arrangement of an affine Weyl group in $\mathbb{R}^d$, reflecting at each hyperplane with probability $p\in (0, 1)$ and…

We define a new stochastic process on general simplicial complexes which allows to study their spectral and homological properties. Some results for random walks on graphs are shown to hold in this general setting. As an application, the…

Let $G$ be a group. A group is said to be $k$-generated if it can be generated by its $k$ elements. A generating set of $G$ is called a minimal generating set if no proper subset of it generates $G.$ A minimal generating set of a group can…

In early 80's Vadim Kaimanovich presented a construction of a non-degenerate measure, on the standard lamplighter group, that has a trivial left and non-trivial right random walk tail boundary. We show that examples of such kind are…

In this paper, we study a family of generating functions whose coefficients are polynomials that enumerate partitions in lower order ideals of Young's lattice. Our main result is that this family satisfies a rational recursion and are…

The unitary Cayley graph of $\mathbb{Z} /n \mathbb{Z}$, denoted $X_{\mathbb{Z} / n \mathbb{Z}}$, has vertices $0,1, \dots, n-1$ with $x$ adjacent to $y$ if $x-y$ is relatively prime to $n$. We present results on the tightness of the known…

Let $\psi:{\mathcal{D}}\rightarrow{\mathbf{R}}$ be a harmonic function such that $\Delta\psi(x)=0$ for all $x\in\mathcal{D}\subset{\mathbf{R}}^{n}$. There are then many well-established classical results:the Dirichlet problem and Poisson…

We construct Green functions of Dirichlet boundary value problems for sub-Laplacians on certain unbounded domains of a prototype Heisenberg-type group (prototype H-type group, in short). We also present solutions in an explicit form of the…

Graph complements G(n) of cyclic graphs are circulant, vertex-transitive, claw-free, strongly regular, Hamiltonian graphs with a Z(n) symmetry, Shannon capacity 2 and known Wiener and Harary index. There is an explicit spectral zeta…

We show that for a uniformly irreducible random walk on a graph, with bounded range, there is a Floyd function for which the random walk converges to its corresponding Floyd boundary. Moreover if we add the assumptions, $p^{(n)}(v,w)\leq C…

We consider a nonlinear Dirichlet problem driven by the $(p,q)$-Laplacian and with a reaction having the combined effects of a singular term and of a parametric $(p-1)$-superlinear perturbation. We prove a bifurcation-type result describing…

We consider the random walk in an \emph{i.i.d.} random environment on the infinite $d$-regular tree for $d \geq 3$. We consider the tree as a Cayley graph of free product of finitely many copies of $\Zbold$ and $\Zbold_2$ and define the…

Combining the study of the simple random walk on graphs, generating functions (especially Green functions), complex dynamics and general complex analysis we introduce a new method of spectral analysis on self-similar graphs. We give an…

We propose an algebraic framework for generalized graph Laplacians which unifies the study of resistor networks, the critical group, and the eigenvalues of the Laplacian and adjacency matrices. Given a graph with boundary $G$ together with…

In 2021 Baudier, Motakis, Schlumprecht, and Zs\'ak proved that if a sequence of graphs $(G_k)_{k\in{\mathbb{N}}}$ contains the sequence of complete graphs with uniformly bounded distortion, then the sequence of lamplighter graphs on $G_k$'s…

Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities…