Spectral gaps for noncompact hyperbolic surfaces with linearly many cusps

Bobo Hua; Qi Guo; Yang Shen

Spectral gaps for noncompact hyperbolic surfaces with linearly many cusps

T0 review · 3 major / 4 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper constructs non-compact hyperbolic surfaces with linearly many cusps and a uniform positive spectral gap.

desk verdict Strong construction paper with a genuine but likely repairable gap in the surface transfer for looped graphs; worth refereeing. read the letter →

arxiv 2507.16794 v3 pith:5WISRY6W submitted 2025-07-22 math.DG math.COmath.GT

Qi Guo , Bobo Hua , Yang Shen This is my paper · ORCID

classification math.DGmath.COmath.GT MSC 05C8058J50

keywords CheegerconstantconfigurationmodelexpandergraphsspectralgaphyperbolicsurfacesLaplacianeigenvaluesStekloveigenvaluetree-plantingmethod

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper proves that expansion can be engineered in a random configuration model with many degree-1 vertices, and then transferred to hyperbolic geometry. Its main theorem (Theorem 1.4) states that for every $\theta>0$ there is a sequence of complete, non-compact, finite-area hyperbolic surfaces $S_{g,n(g)}$ whose cusp count satisfies $n(g)/g\to\theta$ and whose Laplace spectrum has no eigenvalues below a uniform positive constant. Such surfaces are called $\delta$-expander surfaces, and the paper's construction makes $\delta$ a universal constant divided by $(1+\theta)$. If the theorem is right, linear cusp growth does not by itself force small eigenvalues, and the known cusp-count growth rate for uniform spectral gaps improves from the arithmetic $n\asymp g^{2/3}$ to the natural $n\asymp g$. The proof runs through graphs: first expanders in the configuration model $\mathcal{F}_{\chi,n}$, then a pants-decomposition lemma that exports the graph Cheeger constant to a surface Cheeger constant.

What carries the argument

The carrying object is the configuration model $\mathcal{F}_{\chi,n}$, random good partitions of $3\chi+n$ half-edges in which every paired edge contains at least one half-edge from one of the $\chi$ interior vertices of degree 3, so each of the $n$ boundary vertices of degree 1 is attached to an interior vertex. Four mechanisms run on this object. The first is a counting estimate for disconnected subgraphs that proves connectivity with high probability when $n=o(\chi^{2/3})$ and failure when $n\gg\chi^{2/3}$. The second is the $\mu$-pair subgraph count: for any $\mu<0.02$, the expected number of small connected subgraphs whose edge boundary is at most $\mu$ times their size tends to zero, forcing $\lambda_1(G)\ge \mu^2/18$ by Cheeger's inequality. The third is the Steklov comparison $\lambda_1(G)\le\sigma_1(G)\le 16(g+1)/(3n)$, obtained by removing $g+1$ edges to split the graph into two trees and using a test function supported on a balanced subsurface. The fourth is the tree-planting method: replace each edge of a cubic expander with the tree $T_k$, adding many degree-1 vertices without destroying expansion; choosing $k$ from $\theta$ gives $n(g)/g\to\theta$. Lemma 6.4 then transfers $h(G)$ to $h(X(G))$ through the pants decomposition, and Proposition 6.2 plus Cheeger's inequality finish Theorem 1.4.

What would settle it

Test Lemma 6.4 on the explicit surfaces $X(G(g))$ by computing the geometric Cheeger constant directly: since only finitely many simple closed multi-geodesics lie below any length bound, enumerate the separating multicurves of bounded length and compute $\ell(\alpha)/\min\{\operatorname{Area}(A),\operatorname{Area}(B)\}$. If for some $\theta>0$ these ratios are not bounded below by a positive universal constant (equivalently $h(X(G(g)))/\min\{h(G(g)),1\}\to0$), the transfer lemma fails and the spectral gap does not follow. The local target is the pair-of-pants arc $\beta_i$ in Lemma 6.4 with both endpoints on the same boundary geodesic: its length must be bounded below by a constant depending only on the fixed boundary length $a$, and any sequence of such arcs with length tending to zero would break the proof.

Watch

Extended reading notes

Core claim

The central claim is the simultaneous construction of expanding graph families and expanding surfaces in the critical regime where the number of degree-1 'boundary' vertices is proportional to the genus. On the graph side, Theorem 1.3 asserts that for any $\theta>0$ there are connected graphs $G_g\in\mathcal{F}_{2g-2+n(g),n(g)}$ with $n(g)/g\to\theta$ and $\liminf_{g\to\infty}\lambda_1(G_g)\ge 1/(648(\theta+4)^2)$. On the surface side, Theorem 1.4 converts each such graph into a complete finite-area hyperbolic surface $X(G_g)$ of genus $g$ with $n(g)$ cusps by replacing every degree-3 vertex with a pair of pants of fixed boundary length and every degree-1 vertex with a cusp. Lemma 6.4 is the load-bearing transfer: the Cheeger constant of the surface is at least a universal constant times the minimum of the graph Cheeger constant and $1$, so Cheeger's inequality and the standard criterion that a Rayleigh quotient below $1/4$ yields a non-zero eigenvalue turn the graph spectral gap into a surface spectral gap $\delta^2/(1+\theta)^2$. The construction is explicit enough to answer the paper's own question: expanders can survive at $n(g)\sim\theta g$.

Load-bearing premise

The load-bearing premise is that replacing each interior vertex by a fixed pair of pants and each boundary vertex by a cusp preserves expansion: the smallest cut ratio of the resulting surface is at least a universal constant times the graph's cut ratio, with constants that do not degrade as the genus and cusp count grow.

Editorial extensions

If this is right

For every $\theta>0$, the paper's Question has a negative answer: $n(g)\sim\theta g$ does not force $\lambda_1\to0$, and explicit connected graphs in $\mathcal{F}_{2g-2+n(g),n(g)}$ satisfy $\liminf\lambda_1\ge 1/(648(\theta+4)^2)$.
There exist infinitely many finite-area noncompact hyperbolic surfaces with $n(g)/g\to\theta$ and no Laplace eigenvalues below a uniform positive constant, extending the regime of known uniform spectral gaps from arithmetic surfaces with $n\asymp g^{2/3}$ to the linear regime $n\asymp g$.
The condition $\lim n(g)/g=\infty$ is necessary for the known vanishing result (1.1): at exactly linear cusp growth, positive uniform gaps can still occur, so the rate $\theta$ alone does not determine spectral collapse.
In the opposite direction, if $n(\chi)$ grows faster than $\chi^{2/3}$, almost every graph in $\mathcal{F}_{\chi,n}$ is disconnected, and if $g/n\to0$, Theorem 1.2 gives $\lambda_1(G)\le\sigma_1(G)\le 16(g+1)/(3n)\to0$, so those regimes cannot host expanders.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

Beyond the paper: the pants-replacement transfer should apply to any uniformly expanding family of graphs with degree-1 vertices attached to degree-3 vertices, so other configuration-model or combinatorial expander constructions could generate many noncompact expander surfaces with different geometric data; the paper's explicit route is one template.
Beyond the paper: since the surfaces are built from explicit pants decompositions, one could compute Fenchel–Nielsen coordinates, systole, or diameter for the constructed sequence; the paper does not pursue these invariants.
Beyond the paper: the probabilistic model has a sharp connectivity threshold at $n\asymp\chi^{2/3}$. A natural next test is whether random graphs in that exact critical window already expand with positive probability, or whether planted constructions like the tree-planting method are genuinely necessary there; the paper proves only the generic failure for faster growth.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

I read this carefully, and the stress-test note is on target. The paper's core contribution is real: a configuration model with boundary vertices, a clean threshold n = o(χ^{2/3}) for connectivity and expansion, a Steklov upper bound that rules out expanders when g/n → 0, and a deterministic tree-planting construction achieving n ≍ g with a uniform spectral gap. The transfer to hyperbolic surfaces with cusp count linear in genus and uniformly positive spectral gaps is a natural capstone, improving the arithmetic n ≍ g^{2/3} relation. The combinatorial estimates in Sections 3–5 are mostly careful; the good-partition definition is a nice way to force boundary vertices to attach to interior vertices, and the counting in Proposition 4.3 is genuinely involved. The tree-planting argument is explicit and the tuning of n(g)/g → θ is done well. Using Bollobás's cubic expanders as an external ingredient is fine.

The soft spot is exactly in Lemma 6.4. The decomposition of the realizing multicurve α into arcs β_i inside pants and common boundary geodesics γ_j misses the case where two boundary components of the same pants are glued to each other—i.e., when the graph has loops, as in the construction for Theorem 1.3. Then there is a simple closed geodesic lying entirely in the interior of that pants, contributing neither a β_i nor a γ_j. The length bound (6.11) and the counting inequality 3(|V3|+q) ≥ |∂V2'| are therefore not justified for the looped graphs actually used. This is a genuine proof gap, not a cosmetic issue. But it is probably repairable: add the core geodesics of self-gluings as a third class, give them a lower length bound depending on a, and charge them to the V3 side or redefine the graph boundary. The constants and the inequality chain would change, but the overall strategy should survive. The other issues—terse pruning in Lemma 5.3, the isolation step in Lemma 6.1, and the unaddressed half-edge-level handling of loops in the configuration model—are minor in comparison. The authors should also state plainly how loops enter the random pairing model, since the construction deliberately creates them.

Who is this for? Spectral geometers and graph theorists. It answers a natural question and the main theorems are plausible. I would send it to a serious referee with a conditional accept and a request to close the Lemma 6.4 gap. If that closes, the paper is a strong addition to the expander-surface literature.

Referee Report

3 major / 4 minor

Summary. The paper studies a configuration model F_{χ,n} in which χ interior vertices of degree 3 and n boundary vertices of degree 1 are paired by a good partition. It proves that when n=o(χ^{2/3}), a random graph is connected with high probability and has a Laplacian spectral gap bounded below by a uniform constant (Theorem 1.1). It also establishes an upper bound λ1(G) ≤ σ1(G) ≤ 16(g+1)/(3n) for connected graphs (Theorem 1.2). In the critical regime n ≍ g, the authors give an explicit combinatorial construction, the tree-planting method, of connected expander graphs with n(g)/g → θ and λ1 uniformly bounded below (Theorem 1.3). They then replace degree-3 vertices by pairs of pants and boundary vertices by cusps to obtain complete noncompact finite-area hyperbolic surfaces S_{g,n(g)} whose cusp count is linear in genus and whose spectrum has a uniform gap (Theorem 1.4). The main theorems are quantitative and the paper situates itself against recent work on random hyperbolic surfaces and spectral gaps.

Significance. If the proofs are completed, Theorem 1.4 is a striking result: it provides noncompact finite-area hyperbolic surfaces with genus g, cusp count n(g) ≍ g, and a uniform positive spectral gap, improving the arithmetic construction with n ≍ g^{2/3} to a linear cusp count. The paper also gives a probabilistic expander theorem for a boundary-vertex configuration model, with explicit constants, and a negative result when n grows faster than χ^{2/3}. The combinatorial tree-planting construction is explicit and quantitative, and the application to hyperbolic surfaces is natural. The paper does not rely on fitting data or circular derivations; it benchmarks against Bollobás cubic expanders and Shi–Yu’s Steklov comparison. However, the key bridge from graph expansion to surface expansion, Lemma 6.4, is not fully proved as written, and the pruning argument in Lemma 5.3 is also under-justified.

major comments (3)

[Section 6.2, Lemma 6.4] The decomposition of the realizing multicurve α into β_i segments and γ_j common boundary geodesics is not exhaustive. A component of α may be the simple closed geodesic obtained by gluing two boundary components of the same pair of pants to each other; this is exactly the loop case used in Theorem 1.3, since adding a loop at a degree-1 vertex turns it into a degree-3 vertex whose surface replacement has two boundary components identified. Such a component is neither a β_i segment with endpoints on boundary geodesics nor a γ_j common boundary of two distinct pants with v1∈V1 and v2∈V2. Therefore the length bound (6.11) and the subsequent Cheeger comparison are not justified for the surfaces X(G(g)) used in Theorem 1.4. The gap appears repairable by adding a separate term for self-glued boundary components, whose lengths are at least a, and by reworking the inequality chain; but as written the proof does not establish the transfer.
[Section 5, Lemma 5.3] The pruning step in Lemma 5.3 asserts that after removing two edges inside T1, the chosen component T2 satisfies |∂V(T2)| ≤ |∂V(T1)|. This is not automatic: the two cut edges become new boundary edges, and the decrease in edges from T2 to T1' may not compensate. For example, if T1 is a path with a single external edge to T1', removing two edges to take a large subcomponent can produce a boundary of size 2, exceeding |∂V(T1)| = 1. Since this lemma underpins the upper bound in Theorem 1.2, the proof needs a more careful accounting of the boundary edges, for instance by choosing T2 to contain all vertices of T1 incident to the external edges, or by a different global argument.
[Section 4, Sublemma 4.1] The proof of Sublemma 4.1 asserts a numerical inequality of the form e^{μ/2} μ^{-μ} (1-μ)^{-(1-μ)/2} (1/1.9)^{(1-3μ)/6} < 0.999 for μ<0.02, but the verification is not shown. The argument depends on this constant being strictly less than 1, so a short explicit verification or an analytic monotonicity argument would make the proof complete. This is not a claim of an error, but the delicate constant regime deserves a written justification.

minor comments (4)

[Title and Abstract] The title contains a spacing error ('exp anding') and the text has several typographical issues, including 'probabilty' in Section 3 and 'Mirazkhani' in Remark 6.3 (should be Mirzakhani).
[Section 3, proof of Proposition 3.3] In the final summation, the notation 'χ1≥χ2/3' is ambiguous; it should read χ1 ≥ χ^{2/3} to match Case-I. The current typesetting could confuse the reader about which case is being summed.
[Section 6.2, proof of Theorem 1.4] The universal constant δ in the statement of Theorem 1.4 is never identified in the proof. The proof should explicitly set δ (for example, in terms of the constants C and θ from Lemma 6.4 and (6.12)) to make the claimed δ²/(1+θ)² gap concrete.
[Section 2.1, Definition 2.1] The display defining a partition has a typo: 'P = (i1j1)(i1j2)...' should be 'P = (i1j1)(i2j2)...'.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: The central graph and surface constructions are supported by external expander results and in-paper combinatorial inequalities; self-citations are contextual only.

full rationale

The main derivation chain is not circular. Theorem 1.3 begins from Bollobás' external existence theorem for cubic expanders (cited as h(G(m)) ≥ 2/11), then proves Lemma 6.1 in-paper and adjusts the degree counts to make n(g)/g → θ by explicit arithmetic; the lower bound on λ1(G(g)) is obtained from the external Cheeger inequality Proposition 2.4. Theorem 1.4 then transfers this graph bound to hyperbolic surfaces using the in-paper Lemma 6.4, with Mirzakhani's Proposition 6.2 and the standard surface Cheeger inequality (6.12) as external bridges. No parameter is fitted to the final spectral gap, and no equation is defined in terms of the quantity it is meant to predict. The authors' own prior work appears only in a limiting-case remark (the tree case reducing to [24]), in background references for Steklov/Cheeger facts ([30], [31]), and in motivational comparisons ([46], [47]); none of these supplies the existence or uniqueness result on which Theorems 1.3 and 1.4 depend. The skeptical concern about Lemma 6.4 is a proof-gap argument, not a circularity: the alleged omission of closed geodesic components associated with loop edges would affect the validity of inequality (6.11) and the counting estimate 3(|V3|+q) ≥ |∂V′_2|, but it does not show that the surface spectral gap is equivalent to the graph expansion assumption by construction. The proof may need repair in the loop case, but the derivation does not reduce to its own inputs.

Assumptions & free parameters 4 free parameters · 6 assumptions · 0 invented entities

The central results depend on standard graph and surface spectral theory, on one external existence result for cubic expanders from Bollobas, and on a pants-gluing comparison whose constants are not tracked explicitly. No free parameter is fitted to data; all parameters are arbitrary thresholds used inside proofs.

free parameters (4)

mu = any constant below 0.02
Chosen small enough for the exponential estimates in Sublemma 4.1; the final spectral gap lower bound is (1/18)mu^2.
sigma = 0 < sigma < (1-mu)/16
Auxiliary exponent introduced to split the proof of Proposition 4.3 into sublemmas; no data dependence.
k = integer with theta <= 3k < theta+3
Controls the target slope n/g approximately theta in the tree-planting construction.
a = any positive real
Fixed boundary length of pants in the surface construction; only the existence of a positive constant matters.

assumptions (6)

standard math Stirling's approximation for factorials and binomial coefficients
Used throughout Section 3 and Section 4 to estimate the sizes of configuration model classes.
standard math Graph Cheeger inequality: lambda_1(G) >= (1/18) h(G)^2
Proposition 2.4, cited to Grigoryan, converts Cheeger lower bounds into spectral gap lower bounds.
standard math Steklov eigenvalues dominate Laplacian eigenvalues on graphs
Theorem 2.5 from Shi-Yu [48] is used in the proof of Theorem 1.2 to go from sigma_1 to lambda_1.
domain assumption Existence of cubic graphs with Cheeger constant at least 2/11
Bollobas's result [6] provides the base expander family needed for the tree-planting construction; the paper does not reprove this.
standard math Buser's Cheeger inequality and Reed-Simon theorem for noncompact hyperbolic surfaces
Used in Section 6.2 to pass from a lower bound on the surface Cheeger constant to a lower bound on the Laplace spectral gap and to guarantee a nonzero eigenvalue.
domain assumption The geometric Cheeger constant H(X) is realized by a finite simple closed multicurve
Stated in Section 6.2 and used in Lemma 6.4; the argument relies on finiteness of short simple closed geodesics.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Spectral gaps for noncompact hyperbolic surfaces with linearly many cusps." pith.science (2026). https://pith.science/paper/5WISRY6W

@misc{pith2026250716794,
  author       = {Pith},
  title        = {Pith review of: Spectral gaps for noncompact hyperbolic surfaces with linearly many cusps},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/5WISRY6W}},
  note         = {Machine review of arXiv:2507.16794}
}

abstract

We construct complete finite-area noncompact hyperbolic surfaces with linearly many cusps and a uniform spectral gap. More precisely, for every $\theta>0$, we construct a sequence $S_{g,n(g)}\in\mathcal{M}_{g,n(g)}$ such that $\lim\limits_{g\to\infty}\frac{n(g)}{g}=\theta$ and the spectrum of the Laplacian has a uniform gap above zero. The construction is based on explicit expanding $(1,3)$-graphs, viewed as combinatorial skeletons for pants decompositions. We also establish a Steklov-type upper bound showing that expansion cannot persist when the number of boundary vertices is much larger than the genus.