Related papers: Co-spectral radius of intersections

We consider inclusions $\mathcal{S}\leq \mathcal{R}$ of discrete, probability measure-preserving orbit equivalence relations. In previous work with Ab\'{e}rt-Fra\c{c}zyk, we established the pointwise almost sure existence of the cospectral…

It is shown that an undirected graph $G$ is cospectral with the Hermitian adjacency matrix of a mixed graph $D$ obtained from a subgraph $H$ of $G$ by orienting some of its edges if and only if $H=G$ and $D$ is obtained from $G$ by a…

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 prove that if a countable group $\Gamma$ contains infinite commuting subgroups $H, H'\subset \Gamma$ with $H$ non-amenable and $H'$ ``weakly normal'' in $\Gamma$, then any measure preserving $\Gamma$-action on a probability space which…

We define $G$-cospectrality of two $G$-gain graphs $(\Gamma,\psi)$ and $(\Gamma',\psi')$, proving that it is a switching isomorphism invariant. When $G$ is a finite group, we prove that $G$-cospectrality is equivalent to cospectrality with…

We study the gaps between consecutive singular values of random rectangular matrices. Specifically, if $M$ is an $n \times p$ random matrix with independent and identically distributed entries and $\Sigma$ is a $n \times n$ deterministic…

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…

As an analogue of the topological boundary of discrete groups $\Gamma$, we define the noncommutative topological boundary of tracial von Neumann algebras $(M, \tau)$ and apply it to generalize the main results of [AHO23], showing that for a…

We obtain some results on symmetries of sub-Riemannian surfaces. In case of contact sub-Riemannian surface we base on invariants found by Hughen \cite{Hughen}. Using these invariants, we find conditions under which a sub-Riemannian surface…

Let $X=G/H$ be a reductive homogeneous space with $H$ noncompact, endowed with a $G$-invariant pseudo-Riemannian structure. Let $L$ be a reductive subgroup of $G$ acting properly on $X$ and $\Gamma$ a torsion-free discrete subgroup of $L$.…

We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of convergence, intended to play the role of the already existing notion for discrete graphs, means that the restriction of the quantum graph to a…

Recently, several research efforts showed that the analysis of joint spectral characteristics of sets of matrices is greatly eased when these matrices share an invariant cone. In this short note we prove two new results in this direction.…

We give a bound on the spectral radius of subgraphs of regular graphs with given order and diameter. We give a lower bound on the smallest eigenvalue of a nonbipartite regular graph of given order and diameter.

Spontaneous vibrational Raman scattering is a ubiquitous form of light-matter interaction whose description necessitates quantization of the electromagnetic field. It is usually considered as an incoherent process because the scattered…

We investigate joint spectral characteristics of a family of matrices $\mathcal F $, associated with products in the semigroup generated by $\mathcal F$. In the literature, extremal measures such as the well-known joint spectral radius and…

In this paper we compare the different phenomena that occur when intersecting geometric objects with random geodesics on the unit sphere and inside convex bodies. On the high dimensional sphere we see that with probability bounded away from…

The notion of mutual unbiasedness for coarse-grained measurements of quantum continuous variable systems is considered. It is shown that while the procedure of "standard" coarse graining breaks the mutual unbiasedness between conjugate…

The spectral radius of a uniform hypergraph $G$ is the the maximum modulus of the eigenvalues of the adjacency tensor of $G$. For $k\ge 2$, among connected $k$-uniform hypergraphs with $m\ge 1$ edges, we show that the $k$-uniform loose path…

For $0\le\alpha<1$ and a uniform hypergraph $G$, the $\alpha$-spectral radius of $G$ is the largest $H$-eigenvalue of $\alpha \mathcal{D}(G) +(1-\alpha)\mathcal{A}(G)$, where $\mathcal{D}(G)$ and $\mathcal{A}(G)$ are the diagonal tensor of…

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…