Surprise probabilities in Markov chains

SODA '15: ACM SIAM Symposium on Discrete Algorithms San Diego California January, 2015, pp. 1759-1773, 2015.

Cited by: 8|Views7
EI

Abstract:

In a Markov chain started at a state x, the hitting time τ(y) is the first time that the chain reaches another state y. We study the probability Px(τ(y) = t) that the first visit to y occurs precisely at a given time t. Informally speaking, the event that a new state is visited at a large time t may be considered a "surprise". We prove th...More

Code:

Data:

Full Text
Bibtex
Your rating :
0

 

Tags
Comments