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

A set $S$ of vertices in a graph $G$ is a paired dominating set if every vertex of $G$ is adjacent to a vertex in $S$ and the subgraph induced by $S$ contains a perfect matching (not necessarily as an induced subgraph). The paired…

We study random walks on the lampshuffler group $\mathrm{FSym}(H)\rtimes H$, where $H$ is a finitely generated group and $\mathrm{FSym}(H)$ is the group of finitary permutations of $H$. We show that for any step distribution $\mu$ with a…

In this paper we study spectral properties of adjacency and Laplace operators on percolation subgraphs of Cayley graphs of amenable, finitely generated groups. In particular we describe the asymptotic behaviour of the integrated density of…

The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. This paper provides three basic structural results on the critical group of a line graph. The first deals with connected…

We determine the asymptotic behavior of the Green function for zero-drift random walks confined to multidimensional convex cones. As a consequence, we prove that there is a unique positive discrete harmonic function for these processes (up…

The scattering process on multiloop infinite p+1-valent graphs (generalized trees) is studied. These graphs are discrete spaces being quotients of the uniform tree over free acting discrete subgroups of the projective group $PGL(2, {\bf…

We show that any periodic with respect to normal subgroups (of the group representation of the Cayley tree) of finite index $p$-harmonic function is a constant. For some normal subgroups of infinite index we describe a class of…

In this paper, we investigate the problem of the existence of the bounded harmonic functions on a simply connected Riemannian manifold $\widetilde{M}$ without conjugate points, which can be compactified via the ideal boundary…

We prove that random d-regular Cayley graphs of the symmetric group asymptotically almost surely have girth at least (log_{d-1}|G|)^{1/2}/2 and that random d-regular Cayley graphs of simple algebraic groups over F_q asymptotically almost…

Any Zariski dense countable subgroup of $SL(d,R)$ is shown to carry a non-degenerate finitely supported symmetric random walk such that its harmonic measure on the flag space is singular. The main ingredients of the proof are: (1) a new…

We consider weak solutions to a class of Dirichlet boundary value problems invloving the $p$-Laplace operator, and prove that the second weak derivatives are in $L^{q}$ with $q$ as large as it is desirable, provided $p$ is sufficiently…

This document contains supplementary material for the main articles in our Random Cayley Graphs project. We prove refined results about simple random walks on the integers and on the cycle. We are primarily interested in the entropy of…

Given a permutational wreath product sequence of cyclic groups we investigate its minimal generating set, minimal generating set for its commutator and some properties of its commutator subgroup. We strengthen the result of author…

A graph $G$ is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with the same spectrum is isomorphic to $G$. van Dam and Haemers (2003) conjectured that almost all graphs have this property, but that is…

In our study of electrical networks we develop two themes: finding explicit formulas for special classes of functions defined on the vertices of a transient network, namely monopoles, dipoles, and harmonic functions. Secondly, our interest…

We investigate the concept of effective resistance in connection graphs, expanding its traditional application from undirected graphs. We propose a robust definition of effective resistance in connection graphs by focusing on the duality of…

Gravitationally collapsed objects are known to be biased tracers of an underlying density contrast. Using symmetry arguments, generalised biasing schemes have recently been developed to relate the halo density contrast $\delta_h$ with the…

This paper addresses the behavior of the Lov\'asz number for dense random circulant graphs. The Lov\'asz number is a well-known semidefinite programming upper bound on the independence number. Circulant graphs, an example of a Cayley graph,…

We study the empirical spectral distribution of the normalized Laplacian of linear preferential attachment graphs in the Barab{\'a}si-Albert regime with fixed out-degree. For the resulting sequence of random multigraphs, we prove that the…

The power graph \( \mathcal{G}_G \) of a group \( G \) is a graph whose vertex set is \( G \), and two elements \( x, y \in G \) are adjacent if one is an integral power of the other. In this paper, we determine the adjacency, Laplacian,…