Related papers: Self-similar groups and holomorphic dynamics: Reno…
In this paper we study two classes of graphs, the (m,k)-stars and l-dependent graphs, investigating the relation between spectrum characteristics and graph structure: conditions on the topology and edge weights are given in order to get…
Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a $d$-dimensional…
Continuing work begin in arXiv:1910.12609, we interpret the Hurewicz homomorphism for Baker and Richter's noncommutative complex cobordism spectrum $M\xi$ in terms of characteristic numbers (indexed by quasi-symmetric functions) for…
We calculate the spectra and spectral measures associated to random walks on restricted wreath products of finite groups with the infinite cyclic group, by calculating the Kesten-von Neumann-Serre spectral measures for the random walks on…
We employ the functional renormalization group approach formulated on the Schwinger-Keldysh contour to calculate real-time correlation functions in scalar field theories. We provide a detailed description of the formalism, discuss suitable…
We define a graph to be $S$-regular if it contains an equitable partition given by a matrix $S$. These graphs are generalizations of both regular and bipartite, biregular graphs. An $S$-regular matrix is defined then as a matrix on an…
We construct the new one-dimensional Dirac Hamiltonians that are spectrally isomorphic (not isospectral) with the known exactly solvable models. Explicit formulas for their spectra and eigenstates are provided. The operators are utilized…
We present a renormalization group analysis of the problem of Anderson localization on a Random Regular Graph (RRG) which generalizes the renormalization group of Abrahams, Anderson, Licciardello, and Ramakrishnan to infinite-dimensional…
In this article, we relate the spectrum of the discrete magnetic Laplacian (DML) on a finite simple graph with two structural properties of the graph: the existence of a perfect matching and the existence of a Hamiltonian cycle of the…
We adapt modulus of continuity estimates to the study of spectra of combinatorial graph Laplacians, as well as the Dirichlet spectra of certain weighted Laplacians. The latter case is equivalent to stoquastic Hamiltonians and is of current…
We introduce an abstract framework for the study of clustering in metric graphs: after suitably metrising the space of graph partitions, we restrict Laplacians to the clusters thus arising and use their spectral gaps to define several…
We consider the bulk eigenvalue statistics of Laplacian matrices of large Erd\H{o}s-R\'enyi random graphs in the regime $p \geq N^{\delta}/N$ for any fixed $\delta >0$. We prove a local law down to the optimal scale $\eta \gtrsim N^{-1}$…
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…
How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to…
We consider normalized Laplacians and their perturbations by periodic potentials (Schr\"odinger operators) on periodic discrete graphs. The spectrum of the operators consists of an absolutely continuous part (a union of a finite number of…
Classical spectral graph theory relies on the symmetry of the adjacency and Laplacian operators, which guarantees orthogonal eigenbases and energy-preserving Fourier transforms. However, real-world networks are intrinsically directed and…
We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…
This paper addresses the challenge of spectral analysis and structural investigation for graphs that are not distance-regular, where computing the spectrum using standard methods based on equitable and orbit partitions can be complex. Our…
The renormalization group (RG) approach is largely responsible for the considerable success that has been achieved in developing a quantitative theory of phase transitions. Physical properties emerge from spectral properties of the…
We develop a renormalization group method to investigate synchronization clusters in a one-dimensional chain of nearest-neighbor coupled phase oscillators. The method is best suited for chains with strong disorder in the intrinsic…