Joint distribution of the first hitting time and first hitting place for a random walk
نویسندگان
چکیده
منابع مشابه
Threshold Regression and First Hitting Time Models
First hitting time models are a technique of modeling a stochastic process as it approaches or avoids a boundary, also known as a threshold. The process itself may be unobservable, making this a difficult problem. Regression techniques, however, can be employed to model the data as it compares to the threshold, creating a class of first hitting time models called threshold regression models. Su...
متن کاملRandomization in the First Hitting Time Problem∗
In this paper we consider the following inverse problem for the first hitting time distribution: given a Wiener process with a random initial state, probability distribution, F (t), and a linear boundary, b(t) = μt, find a distribution of the initial state such that the distribution of the first hitting time is F (t). This problem has important applications in credit risk modeling where the pro...
متن کاملA Bound for the Distribution of the Hitting Time of Arbitrary Sets by Random Walk
We consider a random walk S n = n i=1 X i with i.i.d. X i. We assume that the X i take values in Z d , have bounded support and zero mean. For A ⊂ Z d , A = ∅, we define τ A = inf{n ≥ 0 : S n ∈ A}. We prove that there exists a constant C, depending on the common distribution of the X i and d only, such that sup ∅∅ =A⊂Z d P {τ A = n} ≤ C/n, n ≥ 1.
متن کاملClustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike traditional graph based clustering methods, we do not explicitly calculate the pairwise similarities between points. Instead, we form a transition matrix of Markov random walk on a directed graph directly from the data. Our...
متن کاملFirst Hitting Time Analysis of the Independence Metropolis Sampler
In this paper, we study a special case of the Metropolis algorithm, the Independence Metropolis Sampler (IMS), in the finite state space case. The IMS is often used in designing components of more complex Markov Chain Monte Carlo algorithms. We present new results related to the first hitting time of individual states for the IMS. These results are expressed mostly in terms of the eigenvalues o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kodai Mathematical Journal
سال: 1998
ISSN: 0386-5991
DOI: 10.2996/kmj/1138043873