Tight Markov chains and random compositions

DOI10.1214/11-AOP656zbMath1257.05009arXiv1005.1957OpenAlexW2963390441MaRDI QIDQ439877

Boris G. 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

zbMATH Keywords

Markov chainsrandom compositions

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Extreme value theory; extremal stochastic processes (60G70) Discrete-time Markov processes on general state spaces (60J05) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorial probability (60C05) Additive number theory; partitions (11P99)

Related Items (1)

Precise asymptotics of some meeting times arising from the voter model on large random regular graphs

Cites Work

• Markov chains with almost exponential hitting times
• Inequalities for rare events in time-reversible Markov chains. II
• Markov chain models - rarity and exponentiality
• On Carlitz compositions
• Central and local limit theorems applied to asymptotic enumeration
• Locally restricted compositions. I. Restricted adjacent differences
• Distinctness of compositions of an integer: A probabilistic analysis
• Probabilistic analysis of column-convex and directed diagonally-convex animals
• On the Multiplicity of Parts in a Random Composition of a Large Integer
• Stable husbands
• On the notion of recurrence in discrete stochastic processes
• A Solution to a Set of Fundamental Equations in Markov Chains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tight Markov chains and random compositions