Skorokhod embeddings for two-sided Markov chains
From MaRDI portal
Publication:292133
DOI10.1007/s00440-015-0637-5zbMath1339.60103arXiv1407.4734OpenAlexW1793242268MaRDI QIDQ292133
Publication date: 10 June 2016
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.4734
Markov chainsrandom walkstopping timesstable matchingoptimal transportrandom allocationextra head schemeSkorokhod embeddingsunbiased shift
Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Stopping times; optimal stopping problems; gambling theory (60G40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Moments of recurrence times for Markov chains
- Poisson matching
- Invariant transports of stationary random measures and mass-stationarity
- How often does a Harris recurrent Markov chain recur?
- How to find an extra head: Optimal random shifts of Bernoulli and Poisson random fields
- Optimal transport and Skorokhod embedding
- Unbiased shifts of Brownian motion
- Extra heads and invariant allocations
- (Semi-) martingale inequalities and local times
- The Strong Law of Large Numbers When the Mean is Undefined
- Real Analysis and Probability
- Optimal embeddings by unbiased shifts of Brownian motion
- A Tauberian Theorem and Its Probability Interpretation
- College Admissions and the Stability of Marriage