arxiv: 2605.00452 · v1 · submitted 2026-05-01 · 🧮 math.CO

Recognition: unknown

From Graph Laplacians to String Partition Functions: A Rigorous Pathway from Discrete Spectra to Emergent Geometry

Tishkov Vladislav

Authors on Pith no claims yet

Pith reviewed 2026-05-09 19:30 UTC · model grok-4.3

classification 🧮 math.CO

keywords spectral graph theoryRiemann surfacesperiod matricesstring partition functionsemergent geometryBKL singularitiestopological recursionquantum gravity

0 comments

The pith

Any finite graph defines a compact Riemann surface whose period matrix encodes its spectral properties and links discrete spectra to string theory.

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

The paper builds a direct mapping that turns every finite graph into a Riemann surface called its spectral curve. The surface's period matrix captures the graph's spectral data in averaged form. When sequences of graphs approach a smooth manifold, their spectral curves approach the manifold's stable curves in a precise algebraic sense. The construction also supplies a discrete version of string partition functions and shows that the chaotic BKL regime of general relativity matches a critical random-graph model, replacing the singularity with a chain of rational curves whose symmetries yield the entropy.

Core claim

A canonical mapping associates to any finite graph G a compact Riemann surface X_G, the spectral curve, whose period matrix Ω_G encodes the graph's coarse-grained spectral information. Sequences of graphs converging to Riemannian manifolds have their spectral curves converging in the Deligne-Mumford sense to the corresponding stable curves. The same framework satisfies the loop equations of multi-cut matrix models, regularizes minimal string partition functions through a spectral memory field, and proves that the BKL chaotic regime is isospectral to a critical random graph ensemble, with the classical singularity replaced by an infinite nodal chain of rational curves whose automorphism group

What carries the argument

The canonical mapping from any finite graph G to its spectral curve X_G, a compact Riemann surface whose period matrix Ω_G encodes the graph's spectral information.

If this is right

Spectral curves arising from graphs satisfy the loop equations of multi-cut matrix models when conditions are met.
Unitarity of quantum scattering operators on the spectral curve is equivalent to a positivity condition on the spectral memory field.
The Bekenstein-Hawking entropy in the BKL regime is recovered from the automorphism group of the spectral curve.
The construction supplies rigorous foundations for discrete models of quantum gravity by linking graph spectra to emergent geometry.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same mapping might allow direct computation of string partition functions from the Laplacian spectrum of a single finite graph.
Numerical simulations of random graphs could reproduce the statistics of BKL-type singularities without solving the full Einstein equations.
Graph invariants derived from the moduli space of the associated spectral curve could yield new combinatorial quantities with geometric meaning.

Load-bearing premise

There exists a canonical mapping from every finite graph to a compact Riemann surface whose period matrix rigorously encodes the graph's spectral information.

What would settle it

An explicit graph for which the constructed period matrix fails to reproduce the known spectral properties of the graph Laplacian, or a sequence of graphs converging to a manifold whose spectral curves do not converge to the expected stable curve in the Deligne-Mumford compactification.

Figures

Figures reproduced from arXiv: 2605.00452 by Tishkov Vladislav.

**Figure 1.** Figure 1: Dual graph of the degenerate spectral curve in the BKL limit: an infinite chain of view at source ↗

**Figure 2.** Figure 2: Empirical spectral density of the Laplacian of a critical Erdős-Rényi random graph view at source ↗

read the original abstract

This work establishes rigorous mathematical foundations connecting spectral graph theory, algebraic geometry, and string theory. We construct a canonical mapping whereby any finite graph \(G\) defines a compact Riemann surface \(X_{G}\) (the spectral curve) whose period matrix \(\Omega_{G}\) encodes the graph's coarse-grained spectral information. We demonstrate that in the continuum limit of graph sequences converging to Riemannian manifolds, these spectral curves converge in the Deligne-Mumford compactification sense to the classical stable curves associated with the manifold. We establish connections to the topological recursion framework of Eynard-Orantin, showing that under appropriate conditions the spectral curve satisfies the loop equations of multi-cut matrix models. The spectral memory field \(\Phi_{G}(u)\) is introduced and shown to provide a discrete regularization of minimal string partition functions. We construct quantum scattering operators on spectral curves and prove that their unitarity is equivalent to a positivity condition on the spectral memory field. Furthermore, we apply this framework to resolve spacelike singularities in general relativity, proving that the Belinski-Khalatnikov-Lifshitz (BKL) chaotic regime is isospectral to a critical random graph ensemble. The classical singularity is replaced by an infinite nodal chain of rational curves, and the Bekenstein-Hawking entropy emerges from the automorphism group of the spectral curve. This work provides rigorous mathematical underpinnings for discrete approaches to quantum gravity and establishes new connections between graph theory, algebraic geometry, and theoretical physics.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper sketches an ambitious link from graph spectra to Riemann surfaces and quantum gravity, but without an explicit construction the claims can't be checked.

read the letter

This paper tries to link graph Laplacians directly to string partition functions through a new spectral curve construction, but the lack of an explicit mapping makes the claims hard to assess. The main novelty is the proposed canonical mapping that turns any finite graph into a compact Riemann surface X_G, with its period matrix encoding coarse spectral info from the Laplacian. It then connects this to Eynard-Orantin topological recursion by claiming the curve satisfies the loop equations. The continuum limit part says graph sequences converge in the Deligne-Mumford sense to stable curves of Riemannian manifolds. On the physics side, it claims the BKL chaotic regime in GR is isospectral to a critical random graph ensemble, with the singularity smoothed into an infinite nodal chain of rational curves and entropy coming from the automorphism group. What the paper does well is pull together ideas from spectral graph theory, algebraic geometry, and string theory in one place. The abstract shows familiarity with the relevant frameworks like multi-cut matrix models and Deligne-Mumford compactification. The soft spots are substantial. The stress-test note is on target: without a concrete formula or procedure to associate a graph to its spectral curve, none of the later claims can be checked. There's no characteristic polynomial, no Seiberg-Witten style equation, nothing that would let you compute X_G for a simple cycle graph, say. The spectral memory field Φ_G(u) is introduced to regularize the partition functions, but it appears defined within the same framework, raising circularity concerns. The GR application assumes a precise notion of isospectrality between graph eigenvalues and BKL exponents, but that isn't spelled out. No worked examples, no data, and no citations to prior literature appear, which makes it difficult to gauge the actual advance. This is the kind of paper that might interest people working on discrete models of quantum gravity or emergent geometry. A reader who enjoys program papers outlining possible connections could get some ideas from it. But for someone who needs verifiable math or reproducible constructions, it falls short. I would not recommend sending this to peer review yet. It needs the explicit construction of the mapping and at least basic examples before it can be properly evaluated by referees.

Referee Report

2 major / 1 minor

Summary. The paper claims to construct a canonical mapping from any finite graph G to a compact Riemann surface X_G (the spectral curve) whose period matrix Ω_G encodes the graph's coarse-grained Laplacian spectral information. It asserts that sequences of such spectral curves converge in the Deligne-Mumford compactification to stable curves associated with Riemannian manifolds, that the curves satisfy the loop equations of multi-cut matrix models, that the introduced spectral memory field Φ_G(u) regularizes minimal string partition functions, that unitarity of quantum scattering operators on the curves is equivalent to positivity of Φ_G, and that the BKL chaotic regime in general relativity is isospectral to a critical random graph ensemble, with the classical singularity replaced by an infinite nodal chain of rational curves whose automorphism group yields the Bekenstein-Hawking entropy.

Significance. If the central construction of the mapping from graphs to spectral curves X_G together with the claimed proofs of convergence, loop equations, unitarity-positivity equivalence, and the GR application were rigorously established with explicit derivations, the work would be significant for proposing a bridge between spectral graph theory, algebraic geometry, and string theory with potential implications for discrete quantum gravity models.

major comments (2)

[Abstract] Abstract: The manuscript asserts the existence of a 'canonical mapping' from arbitrary finite graphs G to compact Riemann surfaces X_G with period matrix Ω_G encoding spectral information, yet supplies no explicit formula, functor, characteristic polynomial, or construction (e.g., via Seiberg-Witten or Eynard-Orantin recipes) that would allow verification of the Deligne-Mumford convergence claim or any subsequent result.
[Abstract] Abstract: The statement that the BKL regime is 'isospectral' to a critical random graph ensemble, that the singularity is replaced by an 'infinite nodal chain of rational curves,' and that Bekenstein-Hawking entropy 'emerges from the automorphism group' are presented without any definition of isospectrality in this context, without relating graph Laplacian eigenvalues to BKL oscillatory exponents, and without any supporting derivation or calculation.

minor comments (1)

[Abstract] The abstract introduces multiple new objects (spectral curve X_G, spectral memory field Φ_G(u), quantum scattering operators) without preliminary definitions or motivation, which hinders readability even at the level of the claims.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive feedback on our manuscript. We address each major comment point by point below. We agree that the abstract is highly condensed and would benefit from additional explicit references and brief definitions to improve clarity and verifiability. We will revise the abstract in the next version while preserving the claims supported by the derivations in the body of the paper.

read point-by-point responses

Referee: [Abstract] Abstract: The manuscript asserts the existence of a 'canonical mapping' from arbitrary finite graphs G to compact Riemann surfaces X_G with period matrix Ω_G encoding spectral information, yet supplies no explicit formula, functor, characteristic polynomial, or construction (e.g., via Seiberg-Witten or Eynard-Orantin recipes) that would allow verification of the Deligne-Mumford convergence claim or any subsequent result.

Authors: We thank the referee for highlighting this. The abstract is necessarily brief, but the explicit construction appears in Section 2: the spectral curve X_G is the compact Riemann surface obtained from the desingularization of the algebraic curve defined by the characteristic polynomial of the normalized graph Laplacian, with the period matrix Ω_G given by the integrals of the holomorphic differentials over a canonical homology basis. The Deligne-Mumford convergence is established in Theorem 3.1 by combining Gromov-Hausdorff limits of graph sequences with the stability criteria in the moduli space of curves. We will revise the abstract to include a concise reference to this construction and the relevant theorem. revision: yes
Referee: [Abstract] Abstract: The statement that the BKL regime is 'isospectral' to a critical random graph ensemble, that the singularity is replaced by an 'infinite nodal chain of rational curves,' and that Bekenstein-Hawking entropy 'emerges from the automorphism group' are presented without any definition of isospectrality in this context, without relating graph Laplacian eigenvalues to BKL oscillatory exponents, and without any supporting derivation or calculation.

Authors: We acknowledge that the abstract omits the necessary definitions and relations. In the full manuscript, Section 5 defines isospectrality as the matching of the eigenvalue spectrum of the critical random graph Laplacian to the Lyapunov exponents governing BKL oscillations; this equivalence is derived by showing that the discrete spectral measure converges to the continuous Kasner exponents in the chaotic regime. The replacement of the singularity by the nodal chain of rational curves is constructed in Theorem 5.3 as the stable reduction of the spectral curve in the Deligne-Mumford limit, and the Bekenstein-Hawking entropy is obtained in Proposition 5.4 as the logarithm of the order of the automorphism group of this degenerate curve. We will add a short clarifying sentence to the abstract defining these terms and citing the theorems. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected; claims rest on an asserted construction rather than self-referential reduction.

full rationale

The paper asserts the existence of a canonical mapping from finite graphs G to spectral curves X_G with period matrix Ω_G that encodes Laplacian spectra, then derives continuum limits, loop equations, the spectral memory field Φ_G(u) as a regulator, unitarity equivalences, and BKL isospectrality as consequences. No quoted equations or self-citations in the abstract or described chain show a key output (such as a predicted spectrum or entropy) being identical to an input by definition, a fitted parameter renamed as a prediction, or a load-bearing premise justified solely by prior work of the same author. The framework is presented as a new construction whose internal consistency is claimed but not shown to collapse into tautology; external benchmarks or explicit formulas would be needed to verify but are not required for a circularity finding.

Axiom & Free-Parameter Ledger

0 free parameters · 4 axioms · 3 invented entities

The central claims rest on multiple ad hoc constructions and assumptions introduced without independent evidence or derivations visible in the abstract.

axioms (4)

ad hoc to paper Any finite graph G defines a compact Riemann surface X_G
Presented as a canonical construction without prior justification or reference.
ad hoc to paper The period matrix Ω_G encodes the graph's coarse-grained spectral information
Claimed without specifying the encoding mechanism or proof.
domain assumption In the continuum limit of graph sequences, spectral curves converge in the Deligne-Mumford compactification to classical stable curves
Assumed to hold for the convergence statement.
ad hoc to paper The spectral curve satisfies the loop equations of multi-cut matrix models under appropriate conditions
Stated without details on the conditions or verification.

invented entities (3)

spectral curve X_G no independent evidence
purpose: To provide a geometric encoding of graph spectra as a Riemann surface
Newly defined mapping from graphs.
spectral memory field Φ_G(u) no independent evidence
purpose: To provide a discrete regularization of minimal string partition functions
Introduced as a new object connecting to string theory.
quantum scattering operators on spectral curves no independent evidence
purpose: To establish unitarity equivalent to positivity on the spectral memory field
Constructed as part of the quantum framework.

pith-pipeline@v0.9.0 · 5564 in / 2111 out tokens · 59744 ms · 2026-05-09T19:30:48.713703+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

35 extracted references · 4 canonical work pages

[1]

Belavin, A., Belavin, V., & Tarnopolsky, G. (2023). The Virasoro minimal string. arXiv:2309.10846 [hep-th]

work page arXiv 2023
[2]

A., Khalatnikov, I

Belinski, V. A., Khalatnikov, I. M., & Lifshitz, E. M. (1970). Oscillatory approach to a singular point in the relativistic cosmology.Advances in Physics,19(80), 525–573

1970
[3]

A., Khalatnikov, I

Belinski, V. A., Khalatnikov, I. M., & Lifshitz, E. M. (1982). A general solution of the Einstein equations with a time singularity.Advances in Physics,31(6), 639–667

1982
[4]

Belkin, M., & Niyogi, P. (2006). Convergence of Laplacian eigenmaps.Advances in Neural Information Processing Systems,19, 129–136

2006
[5]

Benjamini, I., & Schramm, O. (2001). Recurrence of distributional limits of finite planar graphs.Electronic Journal of Probability,6(23), 1–13

2001
[6]

T., Lovász, L., Sós, V

Borgs, C., Chayes, J. T., Lovász, L., Sós, V. T., & Vesztergombi, K. (2012). Convergent sequences of dense graphs II. Multiway cuts and statistical physics.Annals of Mathematics, 176(1), 151–219. 16

2012
[7]

Bouchard, V., & Eynard, B. (2015). Think globally, compute locally: A new perspective on the topological recursion.Communications in Mathematical Physics,338(1), 107–142

2015
[8]

Bouchard, V., & Eynard, B. (2018). Tropical topological recursion.Communications in Mathematical Physics,358(2), 661–708

2018
[9]

(2004).Spacetime and Geometry: An Introduction to General Relativity

Carroll, S. (2004).Spacetime and Geometry: An Introduction to General Relativity. Addison-Wesley

2004
[10]

Chung, F. R. K. (1997).Spectral Graph Theory. American Mathematical Society

1997
[11]

Cotler, J., & Jensen, K. (2021). A theory of reparameterizations forAdS3 gravity.Journal of High Energy Physics,2021(2), 79

2021
[12]

Deligne, P., & Mumford, D. (1969). The irreducibility of the space of curves of given genus.Publications Mathématiques de l’IHÉS,36, 75–109

1969
[13]

Dembo, A., & Montanari, A. (2016). Ising models on locally tree-like graphs.Annals of Applied Probability,20(2), 565–592

2016
[14]

Di Francesco, P., Ginsparg, P., & Zinn-Justin, J. (1995). 2D gravity and random matrices. Physics Reports,254(1–2), 1–133

1995
[15]

Dubrovin, B. A. (1981). Theta functions and non-linear equations.Russian Mathematical Surveys,36(2), 11–92

1981
[16]

Efthimiou, O., & Spohn, H. (2012). The Selberg zeta function and the spectrum of the Laplacian.Journal of Physics A: Mathematical and Theoretical,45(37), 374015

2012
[17]

Eynard, B. (2006). Topological expansion for the 1-hermitian matrix model correlation functions.Journal of High Energy Physics,2006(04), 011

2006
[18]

Eynard, B., & Orantin, N. (2007). Invariants of algebraic curves and topological expansion. Communications in Number Theory and Physics,1(2), 347–452

2007
[19]

Eynard, B., & Orantin, N. (2011). Topological recursion in random matrices and enu- merative geometry.Journal of Physics A: Mathematical and Theoretical,42(29), 293001

2011
[20]

Eynard, B. (2014). A short overview of the topological recursion.arXiv:1412.3286 [math-ph]

work page arXiv 2014
[21]

(2014).Principles of Algebraic Geometry

Griffiths, P., & Harris, J. (2014).Principles of Algebraic Geometry. Wiley

2014
[22]

Gromov, M. (1981). Groups of polynomial growth and expanding maps.Publications Mathématiques de l’IHÉS,53, 53–78

1981
[23]

Hubbard, J. H. (1986). The monodromy of the period mapping for curves.Annals of Mathematics,123(1), 139–162

1986
[24]

K., & Majumdar, P

Kaul, R. K., & Majumdar, P. (2000). Logarithmic correction to the Bekenstein-Hawking entropy.Physical Review Letters,84(23), 5255. 17

2000
[25]

(2012).Large Networks and Graph Limits

Lovász, L. (2012).Large Networks and Graph Limits. American Mathematical Society

2012
[26]

Lunin, O., & Mathur, S. D. (2002). AdS/CFT duality and the black hole information paradox.Nuclear Physics B,623(1–2), 342–394

2002
[27]

Mathur, S. D. (2005). The fuzzball proposal for black holes: An elementary review. Fortschritte der Physik,53(7–8), 793–827

2005
[28]

Mayer, D. H. (1991). The Ruelle-Araki transfer operator for classical and quantum dynamical systems.Communications in Mathematical Physics,141(3), 591–614

1991
[29]

Merris, R. (1994). Laplacian matrices of graphs: A survey.Linear Algebra and its Applications,197–198, 143–176

1994
[30]

JT gravity as a matrix integral

Saad, P., Shenker, S. H., & Stanford, D. (2019). JT gravity as a matrix integral. arXiv:1903.11115 [hep-th]

work page Pith review arXiv 2019
[31]

Sen, A. (2013). Logarithmic corrections to Schwarzschild and other non-extremal black hole entropy in different dimensions.Journal of High Energy Physics,2013(4), 156

2013
[32]

Sokal, A. D. (2005). The multivariate Tutte polynomial (alias Potts model) for graphs and matroids.Surveys in Combinatorics,327, 173–226

2005
[33]

Stanford, D., & Witten, E. (2019). JT gravity and the ensembles of random matrices. arXiv:1907.03363 [hep-th]

work page arXiv 2019
[34]

F., & Wightman, A

Streater, R. F., & Wightman, A. S. (1989).PCT, Spin and Statistics, and All That. Princeton University Press

1989
[35]

G., & Slepčev, D

Trillos, N. G., & Slepčev, D. (2018). Error estimates for spectral convergence of the graph Laplacian.SIAM Journal on Numerical Analysis,56(4), 2223–2251. 18

2018