arXiv (All)
open access
Permutations from Random Walk
Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such
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
- The skew Brownian permuton: a new universality class for random constrained permutations#1131345
- An explicit lower bound for the growth exponent of three-dimensional loop-erased random walk#1012816
- Solving Hypergraph Laplacian Systems in Almost-Linear Time#1156341
- Trimers, pairs and localisation on disordered random graphs#1117099
- Nonuniform expansion and diffusive noise imply random horseshoes and random Young towers#986772
Record · ID 1050721
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