arXiv (All)
open access
Scaling Limit of Critical Loop Soup Clusters in Three, Four, and Five Dimensions
We prove that on the metric graph of $\mathbb{Z}^d$ for $d\in \{3,4,5\}$, clusters of the critical loop soup (or equivalently, clusters of the critical Gaussian free field level-set) admit a scaling limit. To the best of our knowledge, this presents the first scaling limit result for a percolation m
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
- A geometric proof of Peck's theorem#1077398
- Non-equilibrium fluctuations of gradient exclusion processes in dimension $d\le 3$#1142203
- Lipschitz continuity of the time constant for continuum percolation#821887
- A twelve-term exclusion for the small Davenport constant of $E_2\times C_3^r$#1048367
- Fractal transference principles for subsets of $\mathbb{N}^d$ of positive density#793553
Record · ID 986032
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