Search arXivSearch

arXiv · 2609.14945

Long-range expanders: construction and cutoff

Abstract

Long-range expansion is a tree-like volume growth condition on bounded-degree regular graphs, introduced by Dodos, Tikhomirov, Tyros, and the author to prove quantitative nonlinear Poincaré inequalities and non-embedding theorems. Motivated by fundamental questions in geometric group theory and nonlinear functional analysis about superexpanders of logarithmic girth, our first main result is that every Ramanujan graph has long-range expansion. This gives explicit long-range expanders with logarithmic girth (such as Lubotzky--Phillips--Sarnak graphs) and establishes a strict hierarchy: Ramanujan expansion implies long-range expansion, which implies spectral expansion, with neither converse holding. We subsequently compare the different notions of expansion from the perspective of dynamics. Our second main result establishes cutoff with an explicit Gaussian limit profile for the random walk on every fixed-degree long-range expander sequence. In particular, the cutoff location and profile coincide with those for Ramanujan graphs. This offers intermediate progress between cutoff for Ramanujan graphs---proven by Lubetzky and Peres---and the long-standing conjecture of cutoff for transitive spectral expanders.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dylan J. Altschuler. 2026-09-14. Long-range expanders: construction and cutoff. https://arxiv.org/abs/2609.14945

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO