Reconstructing the Transition Rate Function of a Broadwell Random Walk from Exit Times
نویسندگان
چکیده
In this paper, we utilize the layer stripping method, a method used in seismology by geophysicists, to study a stochastic inverse problem arising from a one-dimensional Broadwell process. The Broadwell process can be described as a random walk of a particle that transitions, with a spatially dependent flip rate, between two states associated with the same speed but with different signs of velocities. Our goal is to reconstruct the spatially dependent flip rate function of a one-dimensional Broadwell process from exit time distributions out of a finite interval. In principle, we are able to reconstruct flip rate functions with error within O(10−2) from O(105) exit times when the particle speed is unity. For smaller particle speeds, the noise increases for a fixed number of exit times. This method is less time consuming compared with traditional projection methods which involve optimization.
منابع مشابه
Reconstruction of a persistent random walk from exit time distributions
In this paper, we study the inverse problem of reconstructing the spatially dependent transition rate F (x) of a one-dimensional Broadwell process from exit time distributions. In such a process, an advecting particle is assumed to undergo transitions between states with constant positive (+v) and negative (−v) velocities. The goal is to reconstruct the transition rate function F (x) from the e...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملSpectral dimension and random walks on the two dimensional uniform spanning tree
We study simple random walk on the uniform spanning tree on Z2. We obtain estimates for the transition probabilities of the random walk, the distance of the walk from its starting point after n steps, and exit times of both Euclidean balls and balls in the intrinsic graph metric. In particular, we prove that the spectral dimension of the uniform spanning tree on Z2 is 16/13 almost surely.
متن کاملExit Frequency Matrices for Finite Markov Chains
Consider a finite irreducible Markov chain on state space S with transition matrix M and stationary distribution π. Let R be the diagonal matrix of return times, Rii = 1/πi. Given distributions σ, τ and k ∈ S, the exit frequency xk(σ, τ) denotes the expected number of times a random walk exits state k before an optimal stopping rule from σ to τ halts the walk. For a target distribution τ , we d...
متن کاملConstant-time Discrete Gaussian Sampling
Sampling from a discrete Gaussian distribution is an indispensable part of lattice-based cryptography. Several recent works have shown that the timing leakage from a non-constant-time implementation of the discrete Gaussian sampling algorithm could be exploited to recover the secret. In this paper, we propose a constant-time implementation of the Knuth-Yao random walk algorithm for performing c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Journal of Applied Mathematics
دوره 74 شماره
صفحات -
تاریخ انتشار 2014