English
Related papers

Related papers: Singular Values Versus Expansion in Directed and U…

200 papers

We show that the Cheeger constant of compact surfaces is bounded by a function of the area. We apply this to isoperimetric profiles of bounded genus non-compact surfaces, to show that if their isoperimetric profile grows faster than $\sqrt…

Differential Geometry · Mathematics 2007-07-02 Panos Papasoglu

A directed dominating set in a directed graph $D$ is a set $S$ of vertices of $V$ such that every vertex $u \in V(D) \setminus S$ has an adjacent vertex $v$ in $S$ with $v$ directed to $u$. The directed domination number of $D$, denoted by…

Combinatorics · Mathematics 2010-10-13 Yair Caro , Michael A. Henning

In this paper, we give a short proof of the weak convergence to the Kesten-McKay distribution for the normalized spectral measures of random $N$-lifts. This result is derived by generalizing a formula of Friedman involving Chebyshev…

Combinatorics · Mathematics 2024-10-15 Yulin Gong , Wenbo Li , Shiping Liu

Cheeger inequality is a classical result emerging from the isoperimetric problem in the field of geometry. In the graph theory, a discrete version of Cheeger inequality was also studied deeply and the notion was further extended for higher…

Combinatorics · Mathematics 2023-09-22 Satoshi Kamei

We introduce \emph{expander evolution algebras} (EEAs), a class of nonassociative algebras defined over an arbitrary field $\K$ in which the underlying undirected loopless graph of the algebra -- in the sense of Kowalski -- is an expander…

Rings and Algebras · Mathematics 2026-05-14 Piero Giacomelli

The unitary Cayley graph of $\mathbb{Z}/n\mathbb{Z}$, denoted $X_n$, is the graph on $\{0,\dots,n-1\}$ where vertices $a$ and $b$ are adjacent if and only if $\gcd(a-b,n) = 1$. We answer a question of Defant and Iyer by constructing a…

Combinatorics · Mathematics 2018-12-27 Amanda Burcroff

For any $\epsilon > 0$, we show that if $G$ is a regular graph on $n \gg_\epsilon 1$ vertices that is $\epsilon$-far (differs by at least $\epsilon n^2$ edges) from any Tur\'{a}n graph, then its second eigenvalue $\lambda_2$ satisfies…

Combinatorics · Mathematics 2025-07-15 Shengtong Zhang

In this note we study the eigenvalue growth of infinite graphs with discrete spectrum. We assume that the corresponding Dirichlet forms satisfy certain Sobolev-type inequalities and that the total measure is finite. In this sense, the…

Spectral Theory · Mathematics 2018-04-24 Bobo Hua , Matthias Keller , Michael Schwarz , Melchior Wirth

Let $G$ be a connected tree on $n$ vertices and let $L = D-A$ denote the Laplacian matrix on $G$. The second-smallest eigenvalue $\lambda_{2}(G) > 0$, also known as the algebraic connectivity, as well as the associated eigenvector $\phi_2$…

Combinatorics · Mathematics 2023-03-13 Roy R. Lederman , S. Steinerberger

We study crossing numbers of dense graph drawings whose vertices are uniformly distributed either on the unit sphere or in a compact convex planar domain. We prove a sharp inequality for weighted geodesic drawings on $\mathbb S^2$ in a…

Combinatorics · Mathematics 2026-05-19 Saba Lepsveridze , Oriol Solé-Pi

On a compact metric graph, we consider the spectrum of the Laplacian defined with a mix of standard and Dirichlet vertex conditions. A Cheeger-type lower bound on the gap $\lambda_2 - \lambda_1$ is established, with a constant that depends…

Spectral Theory · Mathematics 2023-01-19 David Borthwick , Evans M. Harrell , Haozhe Yu

We consider two recent conjectures of Harrington, Henninger-Voss, Karhadkar, Robinson and Wong concerning relationships between the sum index, difference index and exclusive sum number of graphs. One conjecture posits an exact relationship…

Combinatorics · Mathematics 2023-03-22 John Haslegrave

We analyze the distribution of the distance between two nodes, sampled uniformly at random, in digraphs generated via the directed configuration model, in the supercritical regime. Under the assumption that the covariance between the…

Probability · Mathematics 2017-04-24 Pim van der Hoorn , Mariana Olvera-Cravioto

We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…

Spectral Theory · Mathematics 2019-06-04 Gregory Berkolaiko , James B. Kennedy , Pavel Kurasov , Delio Mugnolo

We use the concept of intrinsic metrics to give a new definition for an isoperimetric constant of a graph. We use this novel isoperimetric constant to prove a Cheeger-type estimate for the bottom of the spectrum which is nontrivial even if…

Spectral Theory · Mathematics 2012-09-25 Frank Bauer , Matthias Keller , Radosław K. Wojciechowski

The symmetric difference of two graphs $G_1,G_2$ on the same set of vertices $V$ is the graph on $V$ whose set of edges are all edges that belong to exactly one of the two graphs $G_1,G_2$. For a fixed graph $H$ call a collection ${\cal G}$…

Combinatorics · Mathematics 2023-09-08 Noga Alon

Recently, it has been shown that a connected graph $\Gamma$ with $d+1$ distinct eigenvalues and odd-girth $2d+1$ is distance-regular. The proof of this result was based on the spectral excess theorem. In this note we present an alternative…

Combinatorics · Mathematics 2012-08-27 Edwin R. van Dam , Miquel Angel Fiol

We present an asymptotic expansion for quaternionic self-adjoint matrix integrals. The Feynman diagrams appearing in the expansion are ordinary ribbon graphs and their non-orientable counterparts. The result exhibits a striking duality…

Mathematical Physics · Physics 2009-11-07 Motohico Mulase , Andrew Waldron

We establish the first quantitative Berry-Esseen bounds for edge eigenvector statistics in random regular graphs. For any $d$-regular graph on $N$ vertices with fixed $d \geq 3$ and deterministic unit vector $\mathbf{q} \perp \mathbf{e}$,…

Probability · Mathematics 2025-07-18 Leonhard Nagel

The unitary Cayley graph of $\mathbb{Z} /n \mathbb{Z}$, denoted $X_{\mathbb{Z} / n \mathbb{Z}}$, has vertices $0,1, \dots, n-1$ with $x$ adjacent to $y$ if $x-y$ is relatively prime to $n$. We present results on the tightness of the known…

Combinatorics · Mathematics 2018-06-29 Colin Defant , Sumun Iyer