A fully specified protocol is presented for extracting the spectral-dimension flow ds(t) fromensembles of discrete quantum-geometry graphs (Causal Dynamical Triangulations (CDT), Eu-clidean Dynamical Triangulations (EDT), Group Field Theory/spin-foam graphs, causal sets,and related adjacency-based discretizations): the protocol fixes a lazy random-walk kernel,pooled-count smoothing for zero returns, admissible-window artifact cuts, and a weighted locallog–log regression estimator with configuration-jackknife uncertainties. The pipeline is validatedby a minimal benchmark suite and is supplemented by a literature-based Option A pipeline whenraw configurations are unavailable. A reference implementation and reproducibility packagespecification (benchmarks, simulation, estimator, figure reproduction, and exact JSON param-eters) is provided.
Building similarity graph...
Analyzing shared references across papers
Loading...
SIKX HILTON
Building similarity graph...
Analyzing shared references across papers
Loading...
SIKX HILTON (Wed,) studied this question.
synapsesocial.com/papers/69a75bbac6e9836116a23983 — DOI: https://doi.org/10.5281/zenodo.18406796