arXiv (All)
open access
An Erd\H os Rényi Law for the Longest Consecutive Monotone Block in a Random Permutation
The Erd\H os-Rényi law states that given a sequence $\{X_j\}_{j=1}^\infty$ of i.i.d.~($p$) coin-tosses, the longest run $L_n$ of heads in the first $n$ coin tosses approaches $\log_{1/p}n$ almost surely. In this paper we explore a formulation of this result in the case of random permutations and p
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
- Limit Laws of the Iterated Logarithm Under Sub-linear Expectations#926224
- A Finite-Entropy Criterion for the Entropic Conditional Central Limit Theorem#799769
- Lower Bounds for Moments of $L$-functions#927459
- Multiplicative comparisons of Rényi entropies for weighted Bernoulli sums#821562
- Finding all sorting tandem duplication random loss operations#622711
Record · ID 1035405
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