arXiv (All)
open access
Directed distances in spanning-tree-decorated planar maps: exact exponent, scaling limit and universality
We define a natural orientation on a spanning-tree-decorated planar map whereby, roughly speaking, each directed edge in the map is oriented to match the direction of the contour exploration of the spanning tree. We study directed distances (lengths of shortest directed paths) with respect to this o
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
- Spirals and the size of the disk in EX Dra#639521
- Minimum Spanning Trees for Square Crop Plots#1155742
- Sierpiński--Knopp Wasserstein Distance for Persistence Diagrams and Applications to 2-Wasserstein Approximation#821561
- Memory Forensics Techniques for Automated Detection and Analysis of Go Malware#187268
- Parallel SMT Solving via Dynamic Partitioning, Core-Guided Pruning, and Online Backbone Detection#267621
Record · ID 1037197
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