arXiv (All)
open access
Single-graph inference for fractal Gaussian networks
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$ throug
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Scaling limit for Brownian motions on the l-level Sierpinski gaskets: the fractal to Euclidean crossover#203078
- The Fractal Physics of Human Cycles: Integrating Chaos Theory, Synchronization Dynamics, and Gentle Steering through Load Minimization Theory#688651
- Equivalence between the zero distributions of the Riemann zeta function and a two-dimensional Ising model with randomly distributed competing interactions#128323
- Gradient Fractals - The Fractal Veldt - Essay II: The Algebraic and Computational Ground - The Scale-Invariant Algebraic Tower, the Interaction Formula, and the Computational Syntax of Multi-Node Processing#726031
- An $\widetilde{O}\left(n^2 \right)$-Time Sampler for Zero-Field Ferromagnetic Ising Models#1064010
Record · ID 1248877
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive