arXiv (All)
open access
Stochastic dominance of first return times for nearest-neighbor random walks on $\mathbb{Z}^d$
For a $d$-dimensional probability vector $\mathbf{h}=(h_1,\dots, h_d)$, let $(S^{\mathbf{h}}_n)_{n\geq 0}$ be a nearest-neighbor random walk on $\mathbb{Z}^d$ such that at each step, it moves to one of the two nearest neighbors in the $i$-th dimension with probability $\frac{1}{2} h_i$ ($i=1,\dots,
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
- Stochastic Domination of Gaussian Maxima: A Resolution of the Weak Simplex Conjecture#662454
- Stochastic Domination of Gaussian Maxima: A Resolution of the Weak Simplex Conjecture#661404
- Gumbel convergence for maximal packing distances from uniform random samples#997609
- A law of thin processes with neighbour-count thinning#1061367
- Breuer-Major Theorems for Hilbert Space-Valued Random Variables#1051962
Record · ID 1131929
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