Related papers: Co-spectral radius for countable equivalence relat…
We interpret the probabilistic notion of unimodularity for measures on the space of rooted locally finite connected graphs in terms of the theory of measured equivalence relations. It turns out that the right framework for this consists in…
The square of a connected graph $G$ is obtained from $G$ by adding an edge between every pair of vertices at distance $2$. In this paper we give some upper or lower bounds for the spectral radius of the square of connected graphs, trees and…
We present a simple yet rigorous approach to the determination of the spectral dimension of random trees, based on the study of the massless limit of the Gaussian model on such trees. As a byproduct, we obtain evidence in favor of a new…
For random matrices with tree-like structure there exists a recursive relation for the local Green functions whose solution permits to find directly many important quantities in the limit of infinite matrix dimensions. The purpose of this…
We show the homological Serre spectral sequence with coefficients in a field is a spectral sequence of coalgebras. We also identify the comultiplication on the $E^2$ page of the spectral sequence as being induced by the usual…
We introduce two natural notions of cogrowth for finitely generated semigroups --- one local and one global --- and study their relationship with amenability and random walks. We establish the minimal and maximal possible values for…
Let $G$ be a simple connected undirected graph. The Laplacian spectral ratio of $G$, denoted by $R_L(G)$, is defined as the quotient between the largest and second smallest Laplacian eigenvalues of $G$, which is closely related to the…
It is well-known that the spectral radius of a connected uniform hypergraph is an eigenvalue of the hypergraph. However, its algebraic multiplicity remains unknown. In this paper, we use the Poisson Formula and matching polynomials to…
We present progress on the problem of asymptotically describing the adjacency eigenvalues of random and complete uniform hypergraphs. There is a natural conjecture arising from analogy with random matrix theory that connects these spectra…
Originating from spectral graph theory, cospectrality is a powerful generalization of exchange symmetry and can be applied to all real-valued symmetric matrices. Two vertices of an undirected graph with real edge weights are cospectral iff…
We present a spectral sequence connecting the continuous and 'locally continuous' group cohomologies for topological groups. As an application it is shown that for contractible topological groups these cohomology concepts coincide. Similar…
We study some natural generalizations of the spectral spaces in the contexts of commutative rings and distributive lattices. We obtain a topological characterization for the spectra of commutative (not necessarily unitary) rings and we find…
The lower spectral radius, or joint spectral subradius, of a set of real $d \times d$ matrices is defined to be the smallest possible exponential growth rate of long products of matrices drawn from that set. The lower spectral radius arises…
The spectral radius {\rho}(G) of a digraph G is the maximum modulus of the eigenvalues of its adjacency matrix. We present bounds on {\rho}(G) that are often tighter and are applicable to a larger class of digraphs than previously reported…
Random walks on bounded degree expander graphs have numerous applications, both in theoretical and practical computational problems. A key property of these walks is that they converge rapidly to their stationary distribution. In this work…
A $\mathbb{T}$-gain graph is a simple graph in which a unit complex number is assigned to each orientation of an edge, and its inverse is assigned to the opposite orientation. The associated adjacency matrix is defined canonically, and is…
This work is about self-similar sequences of growing connected graphs. We explain how to construct such sequences and why they are important. We show for instance that all the connected graphs in a self-similar sequence have not only the…
Multivariate spatial field data are increasingly common and whose modeling typically relies on building cross-covariance functions to describe cross-process relationships. An alternative viewpoint is to model the matrix of spectral…
Consider the long-range percolation model on the integer lattice $\mathbb{Z}^d$ in which all nearest-neighbour edges are present and otherwise $x$ and $y$ are connected with probability $q_{x,y}:=1-\exp(-|x-y|^{-s})$, independently of the…
The notion of a spectral geometry on a compact metric space X is introduced. This notion serves as a discrete approximation of X motivated by the notion of a spectral triple from non-commutative geometry. A set of axioms charaterising…