Bounds for mixing times for finite semi-Markov processes with heavy-tail jump distribution
Nicos Georgiou, Enrico Scalas

TL;DR
This paper investigates how the mixing times of finite Markov chains are affected when time is replaced by a renewal process with heavy-tailed inter-arrival times, especially focusing on Mittag-Leffler distributions with infinite mean.
Contribution
It provides bounds on mixing times for semi-Markov processes with heavy-tail inter-arrival times, particularly for Mittag-Leffler distributions with infinite expectation.
Findings
Derived bounds for mixing times under heavy-tailed renewal processes
Analyzed the impact of Mittag-Leffler distributed inter-arrival times on mixing behavior
Extended understanding of semi-Markov processes with infinite mean waiting times
Abstract
Consider a Markov chain with finite state space and suppose you wish to change time replacing the integer step index with a random counting process . What happens to the mixing time of the Markov chain? We present a partial reply in a particular case of interest in which is a counting renewal process with power-law distributed inter-arrival times of index . We then focus on , leading to infinite expectation for inter-arrival times and further study the situation in which inter-arrival times follow the Mittag-Leffler distribution of order .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Advanced Queuing Theory Analysis · Stochastic processes and statistical mechanics
