English
Related papers

Related papers: Computing stationary probability distributions and…

200 papers

We present a comparative study of several algorithms for an in-plane random walk with a variable step. The goal is to check the efficiency of the algorithm in the case where the random walk terminates at some boundary. We recently found…

Statistical Mechanics · Physics 2019-04-17 Olga Klimenkova , Anton Yu. Menshutin , Lev N. Shchur

We obtain non-Gaussian limit laws for one-dimensional random walk in a random environment assuming that the environment is a function of a stationary Markov process. This is an extension of the work of Kesten, M. Kozlov and Spitzer for…

Probability · Mathematics 2007-05-23 Eddy Mayer-Wolf , Alexander Roitershtein , Ofer Zeitouni

We study the elephant random walk in arbitrary dimension $d\geq 1$. Our main focus is the limiting random variable appearing in the superdiffusive regime. Building on a link between the elephant random walk and P\'olya-type urn models, we…

Probability · Mathematics 2024-04-18 Hélène Guérin , Lucile Laulin , Kilian Raschel

We study the convergence of random function iterations for finding an invariant measure of the corresponding Markov operator. We call the problem of finding such an invariant measure the stochastic fixed point problem. This generalizes…

Optimization and Control · Mathematics 2024-04-16 Neal Hermer , D. Russell Luke , Anja Sturm

We use the concept of excursions for the prediction of random variables without any moment existence assumptions. To do so, an excursion metric on the space of random variables is defined which appears to be a kind of a weighted…

Statistics Theory · Mathematics 2022-09-07 Vitalii Makogin , Evgeny Spodarev

We study the large deviations of one-dimensional excited random walks. We prove a large deviation principle for both the hitting times and the position of the random walk and give a qualitative description of the respective rate functions.…

Probability · Mathematics 2016-06-14 Jonathon Peterson

We consider a state-dependent, time-dependent, discrete random walks $X_t^{\{a_n\}}$ defined on natural numbers $\mathbb{N}$ (bent to a "stair" in $\mathbb{N}^2$) where the random walk depends on input of a positive deterministic sequence…

Statistics Theory · Mathematics 2019-10-01 Yufan Li , Jeffery Rosenthal

We study the quenched invariance principle for random conductance models with long range jumps on $\Z^d$, where the transition probability from $x$ to $y$ is, on average, comparable to $|x-y|^{-(d+\alpha)}$ with $\alpha\in (0,2)$ but is…

Probability · Mathematics 2020-05-01 Xin Chen , Takashi Kumagai , Jian Wang

Random walks serve as important tools for studying complex network structures, yet their dynamics in cases where transition probabilities are not static remain under explored and poorly understood. Here we study nonlinear random walks that…

Chaotic Dynamics · Physics 2022-06-14 Digesh Chitrakar , Per Sebastian Skardal

Continuous determinantal point processes (DPPs) are a class of repulsive point processes on $\mathbb{R}^d$ with many statistical applications. Although an explicit expression of their density is known, it is too complicated to be used…

Statistics Theory · Mathematics 2022-01-24 Arnaud Poinas , Frédéric Lavancier

We study a stochastic program where the probability distribution of the uncertain problem parameters is unknown and only indirectly observed via finitely many correlated samples generated by an unknown Markov chain with $d$ states. We…

Optimization and Control · Mathematics 2021-06-15 Mengmeng Li , Tobias Sutter , Daniel Kuhn

We construct examples of a random walk with pairwise-independent steps which is almost-surely bounded, and for any $m$ and $k$ a random walk with $k$-wise independent steps which has no stationary distribution modulo $m$.

Probability · Mathematics 2007-05-23 Itai Benjamini , Gady Kozma , Dan Romik

We consider the problem of detecting a random walk on a graph, based on observations of the graph nodes. When visited by the walk, each node of the graph observes a signal of elevated mean, which we assume can be different across different…

Information Theory · Computer Science 2018-10-03 Dragana Bajovic , José M. F. Moura , Dejan Vukobratovic

In this article, we first give a comprehensive description of random walk (RW) problem focusing on self-similarity, dynamic scaling and its connection to diffusion phenomena. One of the main goals of our work is to check how robust the RW…

Statistical Mechanics · Physics 2021-03-17 Tushar Mitra , Tomal Hossain , Santo Banerjee , Md. Kamrul Hassan

The random walk to be considered takes place in the d- spherical dual of the group U(n + 1), for a fixed finite dimensional irreducible representation d of U(n). The transition matrix comes from the three term recursion relation satisfied…

Representation Theory · Mathematics 2010-10-06 F. A. Grünbaum I. Pacharoni , J. Tirao

In this paper we study random walks on dynamical random environments in $1 + 1$ dimensions. Assuming that the environment is invariant under space-time shifts and fulfills a mild mixing hypothesis, we establish a law of large numbers and a…

Probability · Mathematics 2018-05-25 Oriane Blondel , Marcelo R. Hilario , Augusto Teixeira

In this work, we study the large deviation properties of random walk in a random environment on $\mathbb{Z}^d$ with $d\geq1$. We start with the quenched case, take the point of view of the particle, and prove the large deviation principle…

Probability · Mathematics 2008-09-09 Atilla Yilmaz

The random walk process in a nonhomogeneous medium, characterised by a L\'evy stable distribution of jump length, is discussed. The width depends on a position: either before the jump or after that. In the latter case, the density slope is…

Statistical Mechanics · Physics 2017-03-29 Tomasz Srokowski

Within the study of uncertain dynamical systems, iterated random functions are a key tool. There, one samples a family of functions according to a stationary distribution. Here, we introduce an extension, where one sample functions…

Probability · Mathematics 2019-09-24 Ramen Ghosh , Jakub Marecek , Robert Shorten

We prove results on the decidability and complexity of computing the total variation distance (equivalently, the $L_1$-distance) of hidden Markov models (equivalently, labelled Markov chains). This distance measures the difference between…

Formal Languages and Automata Theory · Computer Science 2018-04-18 Stefan Kiefer
‹ Prev 1 3 4 5 6 7 10 Next ›