arXiv (All)
open access
Subordination of discrete snakes
Motivated by applications in random geometry, we investigate the notion of subordination of snakes in the discrete setup. More precisely, given a random walk $W$ indexed by a tree $T$ and with steps in $\{...,-1,0,1\}$, we consider its subordinate tree obtained by contracting every edge of $T$ that
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
- An experimental study of forbidden patterns in geometric permutations by combinatorial lifting#311963
- Faster Minimum k-Cut II: Near-Optimal and Deterministic for Weighted Graphs#1064341
- Are trees really just butterflies in disguise?#987934
- Randomly perturbed digraphs also have bounded-degree spanning trees#206107
- Bootstrap percolation on a generalized Hamming cube \MakeUppercase{\romannumeral 2}#799850
Record · ID 1157463
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