Related papers: Co-spectral radius for countable equivalence relat…

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 extend the proof in [M.~Crouzeix and C.~Palencia, {\em The numerical range is a $(1 + \sqrt{2})$-spectral set}, SIAM Jour.~Matrix Anal.~Appl., 38 (2017), pp.~649-655] to show that other regions in the complex plane are $K$-spectral sets.…

A measure on a locally compact group is called spread out if one of its convolution powers is not singular with respect to Haar measure. Using Markov chain theory, we conduct a detailed analysis of random walks on homogeneous spaces with…

We consider random $n\times n$ matrices $X$ with independent and centered entries and a general variance profile. We show that the spectral radius of $X$ converges with very high probability to the square root of the spectral radius of the…

We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete.…

Random fields play a central role in the analysis of spatially correlated data and, as a result, have a significant impact on a broad array of scientific applications. This paper studies the cepstral random field model, providing recursive…

We study covariate shift in the context of nonparametric regression. We introduce a new measure of distribution mismatch between the source and target distributions that is based on the integrated ratio of probabilities of balls at a given…

Iterated conformal mappings are used to obtain exact multifractal spectra of the harmonic measure for arbitrary Laplacian random walks in two dimensions. Separate spectra are found to describe scaling of the growth measure in time, of the…

Let G be a simple connected graph of order n with degree sequence d_1, d_2, ..., d_n in non-increasing order. The spectral radius rho(G) of G is the largest eigenvalue of its adjacency matrix. For each positive integer L at most n, we give…

We study linear cocycles generated by nonautonomous delay equations in a suitable Hilbert space and their extensions, called compound cocycles, to exterior powers. Using a recent version of the frequency theorem, we develop analytical…

For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix. In this paper, of all trees with both given order and fixed diameter, the trees with the minimal distance spectral radius are completely…

In this paper, we study the spectra of regular hypergraphs following the definitions from Feng and Li (1996). Our main result is an analog of Alon's conjecture for the spectral gap of the random regular hypergraphs. We then relate the…

Two simple undirected graphs are cospectral if their respective adjacency matrices have the same multiset of eigenvalues. Cospectrality yields an equivalence relation on the family of graphs which is provably weaker than isomorphism. In…

Two graphs are cospectral if their respective adjacency matrices have the same multiset of eigenvalues, and generalized cospectral if they are cospectral and so are their complements. We study generalized cospectrality in relation to…

Several notions of spectral radius arise in the study of nonlinear order-preserving positively homogeneous self-maps of cones in Banach spaces. We give conditions that guarantee that all these notions lead to the same value. In particular,…

Clustering short text embeddings is a foundational task in natural language processing, yet remains challenging due to the need to specify the number of clusters in advance. We introduce a scalable spectral method that estimates the number…

We consider the change-of-rings spectral sequence as it applies to Hochschild cohomology, obtaining a description of the differentials on the first page which relates it to the multiplicative stucture on cohomology. Using this information,…

We study cospectral vertices on finite graphs in relation to the echolocation problem on Riemannian manifolds. First, We prove a computationally simple criterion to determine whether two vertices are cospectral. Then, we use this criterion…

We introduce a notion of mean cohomological independence dimension for actions of discrete amenable groups on compact metrizable spaces, as a variant of mean dimension, and use it to obtain lower bounds for the radius of comparison of the…

For a unimodular random graph $(G,\rho)$, we consider deformations of its intrinsic path metric by a (random) weighting of its vertices. This leads to the notion of the conformal growth exponent of $(G,\rho)$, which is the best asymptotic…