Hitting times and Interlacing Eigenvalues: a Stochastic Approach Using Intertwinings
نویسندگان
چکیده
We develop a systematic matrix-analytic approach, based on intertwinings of Markov semigroups, for proving theorems about hitting-time distributions for finite-state Markov chains—an approach that (sometimes) deepens understanding of the theorems by providing corresponding sample-path-by-sample-path stochastic constructions. We employ our approach to give new proofs and constructions for two theorems due to Mark Brown, theorems giving two quite different representations of hitting-time distributions for finite-state Markov chains started in stationarity. The proof, and corresponding construction, for one of the two theorems elucidates an intriguing connection between hitting-time distributions and the interlacing eigenvalues theorem for bordered symmetric matrices.
منابع مشابه
An Eigenvalue Representation for Random Walk Hitting times and Its Application to the Rook Graph
Given an aperiodic random walk on a finite graph, an expression will be derived for the hitting times in terms of the eigenvalues of the transition matrix. The process of diagonalizing the transition matrix and its associated fundamental matrix will be discussed. These results will then be applied to a random walk on a rook graph. Lastly, a cover time bound depending on the hitting times will b...
متن کاملComputing hitting times via fluid approximation: application to the coupon collector problem
In this paper, we show how to use stochastic approximation to compute hitting time of a stochastic process, based on the study of the time for a fluid approximation of this process to be at distance 1/N of its fixed point. This approach is developed to study a generalized version of the coupon collector problem. The system is composed by N independent identical Markov chains. At each time step,...
متن کاملInterlacing for weighted graphs using the normalized Laplacian
The problem of relating the eigenvalues of the normalized Laplacian for a weighted graph G and G − H, for H a subgraph of G is considered. It is shown that these eigenvalues interlace and that the tightness of the interlacing is dependent on the number of nonisolated vertices of H. Weak coverings of a weighted graph are also defined and interlacing results for the normalized Laplacian for such ...
متن کاملAn interlacing theorem for reversible Markov chains
Reversible Markov chains are an indispensable tool in the modeling of a vast class of physical, chemical, biological and statistical problems. Examples include the master equation descriptions of relaxing physical systems, stochastic optimization algorithms such as simulated annealing, chemical dynamics of protein folding and Markov chain Monte Carlo statistical estimation. Very often the large...
متن کاملDeepHit: A Deep Learning Approach to Survival Analysis with Competing Risks
Survival analysis (time-to-event analysis) is widely used in economics and finance, engineering, medicine and many other areas. A fundamental problem is to understand the relationship between the covariates and the (distribution of) survival times (times-to-event). Much of the previous work has approached the problem by viewing the survival time as the first hitting time of a stochastic process...
متن کامل