Related papers: Self-similar groups and holomorphic dynamics: Reno…
We present relations between growth, growth of diameters and the rate of vanishing of the spectral gap in Schreier graphs of automaton groups. In particular, we introduce a series of examples, called Hanoi Towers groups since they model the…
Many tools from the field of graph signal processing exploit knowledge of the underlying graph's structure (e.g., as encoded in the Laplacian matrix) to process signals on the graph. Therefore, in the case when no graph is available, graph…
We introduce an intrinsic deformation of the algebra of smooth functions on a compact Riemannian manifold using only the Laplace spectral decomposition. The construction twists the canonical multiplication-projection channels by unimodular…
We investigate connections between the symmetries (automorphisms) of a graph and its spectral properties. Whenever a graph has a symmetry, i.e. a nontrivial automorphism $\phi$, it is possible to use $\phi$ to decompose any matrix…
We evaluate spectral zeta-functions of certain network Laplacians that can be treated exactly with the renormalization group. As specific examples we consider a class of Hanoi networks and those hierarchical networks obtained by the…
This paper investigates spectral properties of the deformed Laplacian matrix, which merges the Laplacian and signless Laplacian matrices of a graph through a one-parameter family of matrices. We present general results on the eigenvalues of…
In this article, various aspects of Laplacian spectra of power graphs of finite cyclic, dicyclic and finite $p$-groups are studied. Algebraic connectivity of power graphs of the above groups are considered and determined completely for that…
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…
This work establishes rigorous mathematical foundations connecting spectral graph theory, algebraic geometry, and string theory. We construct a canonical mapping whereby any finite graph \(G\) defines a compact Riemann surface \(X_{G}\)…
It is known that non-isomorphic strongly regular graphs with the same parameters must be cospectral (have the same eigenvalues). In this paper, we investigate whether the spectra of higher order Laplacians associated with these graphs can…
In this paper we investigate the controllability and observability properties of a family of linear dynamical systems, whose structure is induced by the Laplacian of a grid graph. This analysis is motivated by several applications in…
In this paper we study the groups of isometries and the set of bi-Lipschitz automorphisms of spectral triples from a metric viewpoint, in the propinquity framework of Latremoliere. In particular we prove that these groups and sets are…
We consider a family of compact, oriented and connected Riemannian manifolds shrinking to a metric graph and describe the asymptotic behaviour of the eigenvalues of the Hodge Laplacian. We apply our results to produce manifolds with…
We develop a theory of ultrametric graphons as limiting objects for random networks with nested hierarchical community structure. A graphon $W:[0,1]^2\to[0,1]$ is called ultrametric if $W(x,y)=w(d(x,y))$, where $d$ is an ultrametric on…
This paper explores a previously uncharted automaton group generated by a 5-state automaton $(\Pi, A)$ acts by self-similarity on the regular rooted tree $A^{*}$ over a 2-letter alphabet set $A$. Group $G$ has been subjected to several…
We show that amenability of a group acting by homeomorphisms can be deduced from a certain local property of the action and recurrency of the orbital Schreier graphs. This covers amenability of a wide class groups, the amenability of which…
We study the limiting behavior of the discrete spectra associated to the principal congruence subgroups of a reductive group over a number field. While this problem is well understood in the cocompact case (i.e., when the group is…
To some extent, graph evolutionary mechanisms can be explained by its spectra. Here, we are interested in two graph operations, namely, motif (subgraph) doubling and attachment that are biologically relevant. We investigate how these two…
The eigenvalues of the normalized Laplacian of a graph provide information on its topological and structural characteristics and also on some relevant dynamical aspects, specifically in relation to random walks. In this paper we determine…
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of…