Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userRecurrence of the twisted planar random walk
180
0
0.0
(
0
)
Authors
U. Haboeck
Ask ChatGPT about the research
No Arabic abstract
We show that the twisted planar random walk - which results by summing up stationary increments rotated by multiples of a fixed angle - is recurrent under diverse assumptions on the increment process. For example, if the increment process is alpha-mixing and of finite second moment, then the twisted random walk is recurrent for every angle fixed choice of the angle out of a set of full Lebesgue measure, no matter how slow the mixing coefficients decay.
rate research
Read More
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for Galton-Watson trees whose offspring distribution has exponential tail. We prove bounds on the occupation probability of a site, as well as a general 0-1 law. Similar conclusions hold for a coalescing process on trees where particles do not backtrack.
In the first part of this paper, we generalize the results of the author cite{Liu,Liu2} from the random flow case to the random semiflow case, i.e. we obtain Conley decomposition theorem for infinite dimensional random dynamical systems. In the second part, by introducing the backward orbit for random semiflow, we are able to decompose invariant random compact set (e.g. global random attractor) into random Morse sets and connecting orbits between them, which generalizes the Morse decomposition of invariant sets originated from Conley cite{Con} to the random semiflow setting and gives the positive answer to an open problem put forward by Caraballo and Langa cite{CL}.
In this note, we design a discrete random walk on the real line which takes steps $0, pm 1$ (and one with steps in ${pm 1, 2}$) where at least $96%$ of the signs are $pm 1$ in expectation, and which has $mathcal{N}(0,1)$ as a stationary distribution. As an immediate corollary, we obtain an online version of Banaszczyks discrepancy result for partial colorings and $pm 1, 2$ signings. Additionally, we recover linear time algorithms for logarithmic bounds for the Koml{o}s conjecture in an oblivious online setting.
We discuss conditions for unique ergodicity of a collective random walk on a continuous circle. Individual particles in this collective motion perform independent (and different in general) random walks conditioned by the assumption that the particles cannot overrun each other. Additionally to sufficient conditions for the unique ergodicity we discover a new and unexpected way for its violation due to excessively large local jumps. Necessary and sufficient conditions for the unique ergodicity of the deterministic version of this system are obtained as well. Technically our approach is based on the interlacing property of the spin function which describes states of pairs of particles in coupled processes under study.
In this paper we study the asymptotic behavior of the Random-Walk Metropolis algorithm on probability densities with two different `scales, where most of the probability mass is distributed along certain key directions with the `orthogonal directions containing relatively less mass. Such class of probability measures arise in various applied contexts including Bayesian inverse problems where the posterior measure concentrates on a sub-manifold when the noise variance goes to zero. When the target measure concentrates on a linear sub-manifold, we derive analytically a diffusion limit for the Random-Walk Metropolis Markov chain as the scale parameter goes to zero. In contrast to the existing works on scaling limits, our limiting Stochastic Differential Equation does not in general have a constant diffusion coefficient. Our results show that in some cases, the usual practice of adapting the step-size to control the acceptance probability might be sub-optimal as the optimal acceptance probability is zero (in the limit).
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
