English
Related papers

Related papers: Random iteration with place dependent probabilitie…

200 papers

We investigate ergodic-theoretical quantities and large deviation properties of one-dimensional intermittent maps, that have not only an indifferent fixed point but also a singular structure such that the uniform measure is invariant under…

Chaotic Dynamics · Physics 2015-06-18 Soya Shinkai , Yoji Aizawa

In the design and analysis of political redistricting maps, it is often useful to be able to sample from the space of all partitions of the graph of census blocks into connected subgraphs of equal population. There are influential Markov…

Discrete Mathematics · Computer Science 2021-10-28 Ariel D. Procaccia , Jamie Tucker-Foltz

We consider a sequence of i.i.d. random variables $\{\xi_k\}$under a sublinear expectation $\mathbb{E}=\sup_{P\in\Theta}E_P$. We first give a new proof to the fact that, under each $P\in\Theta$, any cluster point of the empirical averages…

Probability · Mathematics 2022-07-12 Yongsheng Song

We consider a model of a discrete time "interacting particle system" on the integer line where infinitely many changes are allowed at each instance of time. We describe the model using chameleons of two different colours, {\it viz}., red…

Probability · Mathematics 2009-07-23 Antar Bandyopadhyay , Rahul Roy , Anish Sarkar

We revisit the classical problem of approximating a stochastic differential equation by a discrete-time and discrete-space Markov chain. Our construction iterates Caratheodory's theorem over time to match the moments of the increments…

Probability · Mathematics 2021-11-08 Francesco Cosentino , Harald Oberhauser , Alessandro Abate

We derive explicit upper bounds for the $\bar{d}$-distance between a chain of infinite order and its canonical $k$-steps Markov approximation. Our proof is entirely constructive and involves a "coupling from the past" argument. The new…

Probability · Mathematics 2012-01-16 Sandro Gallo , Matthieu Lerasle , Daniel Yasumasa Takahashi

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with probability $n^{-a}$, $0 < a < 1/2$, and let $p(n) = n^{1+\epsilon}$, $0 < \epsilon < 1$. We prove that, almost surely, for every…

Dynamical Systems · Mathematics 2019-06-27 Ben Krause , Pavel Zorin-Kranich

We introduce a model of the set of all Polish (=separable complete metric) spaces: the cone $\cal R$ of distance matrices, and consider geometric and probabilistic problems connected with this object. The notion of the universal distance…

Probability · Mathematics 2007-05-23 A. Vershik

Consider a proper metric space X and a sequence of i.i.d. random continuous mappings F_n from X to X. It induces the stochastic dynamical system (SDS) X_n^x = F_n(X_{n-1}^x) starting at x in X. In this paper, we study existence and…

Probability · Mathematics 2012-12-05 Marc Peigné , Wolfgang Woess

Extensions of Kemeny's constant, as derived for irreducible finite Markov chains in discrete time, to Markov renewal processes and Markov chains in continuous time are discussed. Three alternative Kemeny's functions and their variants are…

Probability · Mathematics 2018-09-17 Jeffrey J Hunter

A $d$-dimensional binary Markov random field on a lattice torus is considered. As the size $n$ of the lattice tends to infinity, potentials $a=a(n)$ and $b=b(n)$ depend on $n$. Precise bounds for the probability for local configurations to…

Probability · Mathematics 2010-10-13 David Coupier

In this note, we give an original convergence result for products of independent random elements of motion group. Then we consider dynamic random walks which are inhomogeneous Markov chains whose transition probability of each step is, in…

Probability · Mathematics 2010-03-04 C. R. E. Raja , R. Schott

Given a permutation sigma of the integers {-n,-n+1,...,n} we consider the Markov chain X_{sigma}, which jumps from k to sigma (k\pm 1) equally likely if k\neq -n,n. We prove that the expected hitting time of {-n,n} starting from any point…

Probability · Mathematics 2014-05-15 Shirshendu Ganguly , Yuval Peres

We derive some key extremal features for $k$th order Markov chains that can be used to understand how the process moves between an extreme state and the body of the process. The chains are studied given that there is an exceedance of a…

Statistics Theory · Mathematics 2023-01-27 Ioannis Papastathopoulos , Adrian Casey , Jonathan A. Tawn

We study existence and uniqueness of invariant probability measures for continuous-time Markov processes on general state spaces. Existence is obtained from tightness of time averages under a weak regularity assumption inspired by…

Probability · Mathematics 2026-01-21 Jean-Gabriel Attali

Let $X_N$ be an $N\ts N$ random symmetric matrix with independent equidistributed entries. If the law $P$ of the entries has a finite second moment, it was shown by Wigner \cite{wigner} that the empirical distribution of the eigenvalues of…

Probability · Mathematics 2007-07-17 Gerard Ben Arous , Alice Guionnet

Drawing on some recent results that provide the formalism necessary to definite stationarity for infinite random graphs, this paper initiates the study of statistical and learning questions pertaining to these objects. Specifically, a…

Machine Learning · Computer Science 2017-08-11 Daniil Ryabko

We obtain the posterior distribution of a random process conditioned on observing the empirical frequencies of a finite sample path. We find under a rather broad assumption on the "dependence structure" of the process, {\em c.f.}…

Probability · Mathematics 2022-03-02 Wenqing Hu , Hong Qian

Let $P$ be the transition matrix of a finite, irreducible and reversible Markov chain. We say the continuous time Markov chain $X$ has transition matrix $P$ and speed $\lambda$ if it jumps at rate $\lambda$ according to the matrix $P$. Fix…

Probability · Mathematics 2015-06-26 Louigi Addario-Berry , Roberto I. Oliveira , Yuval Peres , Perla Sousi

We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given the tree, positive weights are assigned to the edges in such…

Probability · Mathematics 2016-05-02 A. D. Barbour , A. Collevecchio
‹ Prev 1 8 9 10 Next ›