Metraipolis › archive › dc_49ee9eb16ce9
Single-graph inference for fractal Gaussian networks — arXiv:2610.11597
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.11597
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T06:28:17.571Z
- SHA-256 of the archived text
8c0812d9915bfa7801a4b5300a3adf12e867ab64b755c0c494fb0be95f4b8d2f- Stable URL of this page
https://metraipolis.com/documento/dc_49ee9eb16ce9
How to cite
Single-graph inference for fractal Gaussian networks — arXiv:2610.11597 — arXiv (en), https://arxiv.org/abs/2610.11597 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_49ee9eb16ce9 (Metraipolis archive dc_49ee9eb16ce9, sha256 8c0812d9915bfa7801a4b5300a3adf12e867ab64b755c0c494fb0be95f4b8d2f)
BibTeX
@misc{dc49ee9eb16ce9,
title = {Single-graph inference for fractal Gaussian networks — arXiv:2610.11597},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.11597},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_49ee9eb16ce9; sha256 8c0812d9915bfa7801a4b5300a3adf12e867ab64b755c0c494fb0be95f4b8d2f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.11597. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 $\gamma=1$, whereas degree quantiles consistently estimate $\nu=\gamma^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\le\gamma\le\Gamma<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. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.ST, nuovi lavori del giorno). Categorie arXiv: Statistics Theory (math.ST) ; Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2610.11597 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T05:52:46.496Z dalla pagina https://arxiv.org/list/math.ST/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).