arXiv (All)
open access
The scaling limit of fair Peano paths
We study random Peano paths on planar square grids that arise from fair random spanning trees. These are trees that are sampled in such a way as to have the same (if possible) edge probabilities. In particular, we are interested in identifying the scaling limit as the mesh-size of the grid tends to
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
- Product approximations for uniform spanning trees and determinantal processes#1248834
- Universal Radial Laws for Random Polynomials: Erdős Problem #522 and Non-Universal Fluctuations#1248604
- Closure complexity of longest-edge bisection for triangular meshes#971901
- Random hyperbolic polyhedra in horoballs#996805
- Rapid mixing in unimodal landscapes and efficient simulatedannealing for multimodal distributions#1217218
Record · ID 1200695
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