Related papers: Spectral computations on lamplighter groups and Di…
We introduce a new measure of complexity (called spectral complexity) for directed graphs. We start with splitting of the directed graph into its recurrent and non-recurrent parts. We define the spectral complexity metric in terms of the…
In this article we study spectral properties of the family of Schreier graphs associated to the action of the Thompson group $F$ on the interval [0,1]. In particular, we describe spectra of Laplace type operators associated to these…
Let $G$ be a finite group, and $S$ be a subset of $G\setminus\{1\}$ such that $S=S^{-1}$. Suppose that $Cay(G,S)$ is the Cayley graph on $G$ with respect to the set $S$ which is the graph whose vertex set is $G$ and two vertices $a,b\in G$…
This paper presents the Persistent Weisfeiler-Lehman Random walk scheme (abbreviated as PWLR) for graph representations, a novel mathematical framework which produces a collection of explainable low-dimensional representations of graphs…
The spectral gap of the graph Laplacian with Dirichlet boundary conditions is computed for the graphs of several communication networks at the IP-layer, which are subgraphs of the much larger global IP-layer network. We show that the…
Consider the ensembles of real symmetric Toeplitz matrices and real symmetric Hankel matrices whose entries are i.i.d. random variables chosen from a fixed probability distribution p of mean 0, variance 1, and finite higher moments.…
In this paper, we give a short proof of the weak convergence to the Kesten-McKay distribution for the normalized spectral measures of random $N$-lifts. This result is derived by generalizing a formula of Friedman involving Chebyshev…
We give the first example of a connected 4-regular graph whose Laplace operator's spectrum is a Cantor set, as well as several other computations of spectra following a common ``finite approximation'' method. These spectra are simple…
We describe the infinite family of spider-web graphs $S_{k,M,N }$, $k \geq 2$, $M \geq 1$ and $N \geq 0$, studied in physical literature as tensor products of well-known de Brujin graphs $B_{k,N}$ and cyclic graphs $C_M$ and show that these…
We obtain the Plancherel theorem for the quotient of a simple Lie group of real rank one by a convex-cocompact discrete subgroup and its consequences for the spectrum of locally invariant differential operators on bundles over Kleinian…
We show a norm convergence result for the Laplacian on a class of post-critically finite fractals with arbitrary Borel regular probability measure which can be approximated by a sequence of finite-dimensional graph Laplacians with…
Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an…
We introduce a notion of "simulation" for labelled graphs, in which edges of the simulated graph are realized by regular expressions in the simulating graph, and prove that the tiling problem (aka "domino problem") for the simulating graph…
Regular ring lattices (RRLs) are defined as peculiar undirected circulant graphs constructed from a cycle graph, wherein each node is connected to pairs of neighbors that are spaced progressively in terms of vertex degree. This kind of…
We establish spectral theorems for random walks on mapping class groups of connected, closed, oriented, hyperbolic surfaces, and on $\text{Out}(F_N)$. In both cases, we relate the asymptotics of the stretching factor of the…
Let $\Gamma_d(q)$ denote the group whose Cayley graph with respect to a particular generating set is the Diestel-Leader graph $DL_d(q)$, as described by Bartholdi, Neuhauser and Woess. We compute both $Aut(\Gamma_d(q))$ and…
The main goal of this thesis is to show the crucial role that plays the symbol in analysing the spectrum the sequence of matrices resulting from PDE approximation and in designing a fast method to solve the associated linear problem. In the…
The Plancherel formula for the universal covering group of $SL(2, R)$ derived earlier by Pukanszky on which Herb and Wolf build their Plancherel theorem for general semisimple groups is reconsidered. It is shown that a set of unitarily…
Kirchoff's matrix tree theorem of 1847 connects the number of spanning trees of a graph to the spectral determinant of the discrete Laplacian [22]. Recently an analogue was obtained for quantum graphs relating the number of spanning trees…
Given a differential operator $\mathcal{L}$ along with its own eigenvalue problem $\mathcal{L}u = \lambda u$ and an associated algebraic equation $\mathcal{L}^{(n)} \mathbf{u}_n = \lambda\mathbf{u}_n$ obtained by means of a discretization…