Single-graph inference for fractal Gaussian networks
Abstract
We study inference on the strength of Gaussian multiplicative chaos from one geometric graph with unobserved vertex positions. In the planar model, the edge-count statistic has a piecewise deterministic limit with a transition at γ=1, whereas degree quantiles consistently estimate ν=γ2/2 throughout the subcritical range. Fractional moments give uniform finite-sample risk bounds. At finite resolution, common graph envelopes calibrate tests over continuous parameter boxes with unknown Poisson intensity. They give simultaneous coverage under adaptive refinement for a fixed statistic, and conditional coverage for an independently piloted size--degree residual on a fixed partition. For the exact periodic FFT--pixel approximation, we prove explicit total-variation rates for the annealed spatial Cox law and the observed graph law, uniformly on every compact subcritical range 0≤γ≤Γ<2. The rates allow intensity to grow with resolution and imply uniform asymptotic coverage after recalibration at each resolution. Numerical studies examine parameter refinement, residual calibration, and multiresolution stability.
Related
- Generalized Discrete Fractal Dimensions of Graph Families
- Fractal dimension of critical Gaussian free field sign clusters
- Scalable Sparse Autoregressive Variational Inference for Non-Gaussian Spatial Fields
- Local increment inference for time-inhomogeneous drift in Gaussian processes
- Failure Evolution and Fractal Damage Characteristics of Bolt-Reinforced Rock Under True-Triaxial Single-Face Unloading
BibTeX
@misc{cai2026singlegraph,
title = {{Single-graph inference for fractal Gaussian networks}},
author = {Chunhao Cai},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.11597},
eprint = {2610.11597},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.11597},
}
RIS
TY - UNPB
TI - Single-graph inference for fractal Gaussian networks
AU - Chunhao Cai
PY - 2026
DA - 2026/10/08
PB - arXiv
DO - 10.48550/arxiv.2610.11597
UR - https://arxiv.org/abs/2610.11597
AB - We study inference on the strength of Gaussian multiplicative chaos from one geometric graph with unobserved vertex positions. In the planar model, the edge-count statistic has a piecewise deterministic limit with a transition at γ=1, whereas degree quantiles consistently estimate ν=γ^2/2 throughout the subcritical range. Fractional moments give uniform finite-sample risk bounds. At finite resolution, common graph envelopes calibrate tests over continuous parameter boxes with unknown Poisson intensity. They give simultaneous coverage under adaptive refinement for a fixed statistic, and conditional coverage for an independently piloted size--degree residual on a fixed partition. For the exact periodic FFT--pixel approximation, we prove explicit total-variation rates for the annealed spatial Cox law and the observed graph law, uniformly on every compact subcritical range 0≤γ≤Γ<2. The rates allow intensity to grow with resolution and imply uniform asymptotic coverage after recalibration at each resolution. Numerical studies examine parameter refinement, residual calibration, and multiresolution stability.
ER -