arXiv (OAI Expanded)
open access
Concentration Inequalities for Branching Random Walks
Motivated by phase transition problems in CSPs, we prove a more general concentration inequality that retains classical sub-Gaussian tails under a mild global linear-growth condition $|S_n| < Cn$, relaxing the bounded-increment assumption to finite exponential moments and requiring neither independe
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
- Concentration Inequalities for Branching Random Walks#925061
- Concentration Inequalities for Branching Random Walks with Applications to Phase Transitions in CSPs#793343
- Concentration Inequalities for Branching Random Walks with Applications to Phase Transitions in CSPs#789339
- Stationary activated random walk: regularity, heavy tails, and remixing#1115799
- Mixing time under monotone censoring#1160740
Record · ID 920827
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