Tight Markov chains and random compositions
DOI10.1214/11-AOP656zbMATH Open1257.05009arXiv1005.1957OpenAlexW2963390441MaRDI QIDQ439877FDOQ439877
Authors: Boris Pittel
Publication date: 17 August 2012
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1005.1957
Recommendations
Extreme value theory; extremal stochastic processes (60G70) Central limit and other weak theorems (60F05) Exact enumeration problems, generating functions (05A15) Discrete-time Markov processes on general state spaces (60J05) Combinatorial probability (60C05) Combinatorial aspects of partitions of integers (05A17) Additive number theory; partitions (11P99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the notion of recurrence in discrete stochastic processes
- Markov chain models - rarity and exponentiality
- Central and local limit theorems applied to asymptotic enumeration
- Title not available (Why is that?)
- Inequalities for rare events in time-reversible Markov chains. II
- On Carlitz compositions
- Markov chains with almost exponential hitting times
- A Solution to a Set of Fundamental Equations in Markov Chains
- Distinctness of compositions of an integer: A probabilistic analysis
- Title not available (Why is that?)
- Locally restricted compositions. I. Restricted adjacent differences
- Title not available (Why is that?)
- Probabilistic analysis of column-convex and directed diagonally-convex animals
- Title not available (Why is that?)
- On the Multiplicity of Parts in a Random Composition of a Large Integer
- Title not available (Why is that?)
- Stable husbands
Cited In (5)
This page was built for publication: Tight Markov chains and random compositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439877)