English
Related papers

Related papers: Hitting and returning into rare events for all alp…

200 papers

We prove a quenched limiting law for random measures on subshifts at periodic points. We consider a family of measures $\{\mu_\omega\}_{\omega\in\Omega}$, where the `driving space' $\Omega$ is equipped with a probability measure which is…

Dynamical Systems · Mathematics 2016-12-06 Nicolai Haydn , Mike Todd

This paper is a first step in the study of the recurrence behavior in random dynamical systems and randomly perturbed dynamical systems. In particular we define a concept of quenched and annealed return times for systems generated by the…

Dynamical Systems · Mathematics 2009-10-12 Philippe Marie , Jerome Rousseau

In this paper we consider an irreducible random walk on the integer lattice $\mathbb{Z}$ that is in the domain of normal attraction of a strictly stable process with index $\alpha\in (1, 2)$ and obtain the asymptotic form of the…

Probability · Mathematics 2018-08-07 Kohei Uchiyama

We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…

Information Theory · Computer Science 2022-03-30 Jiachun Pan , Yonglong Li , Vincent Y. F. Tan

We study the two-dimensional joint distribution of the first hitting time of a constant level by a continuous-state branching process with immigration and their primitive stopped at this time. We show an explicit expression of its Laplace…

Probability · Mathematics 2013-11-25 Xan Duhalde , Clément Foucart , Chunhua Ma

We extend our previous study of Markov chains on finite commutative rings (arXiv:1605.05089) to arbitrary finite rings with identity. At each step, we either add or multiply by a randomly chosen element of the ring, where the addition…

Representation Theory · Mathematics 2019-01-15 Arvind Ayyer , Pooja Singla

Let $T_n$ denote the binary tree of depth $n$ augmented by an extra edge connected to its root. Let $C_n$ denote the cover time of $T_n$ by simple random walk. We prove that $\sqrt{ \mathcal{C}_{n} 2^{-(n+1) } } - m_n$ converges in…

Probability · Mathematics 2019-06-19 Amir Dembo , Jay Rosen , Ofer Zeitouni

Let $\log^Cn\le d\le n/2$ for a sufficiently large constant $C>0$ and let $A_n$ denote the adjacency matrix of a uniform random $d$-regular directed graph on $n$ vertices. We prove that as $n$ tends to infinity, the empirical spectral…

Probability · Mathematics 2017-08-09 Nicholas A. Cook

We consider Funaki's model of a random string taking values in R^d. It is specified by the following stochastic PDE, du = u_{xx} + W, where W=W(x,t) is two-parameter white noise, also taking values in R^d. We study hitting properties,…

Probability · Mathematics 2011-02-18 Carl Mueller , Roger Tribe

Results of Wyner and Ziv and of Ornstein and Weiss show that if one observes the first k outputs of a finite-valued ergodic process, then the waiting time until this block appears again is almost surely asymptotic to $2^{hk}$, where $h$ is…

Dynamical Systems · Mathematics 2014-09-23 Michael Hochman

In this note we first consider local times of random walks killed at leaving positive half-axis. We prove that the distribution of the properly rescaled local time at point $N$ conditioned on being positive converges towards an exponential…

Probability · Mathematics 2014-12-22 Denis Denisov , Vitali Wachtel

The probability that a max-stable process {\eta} in C[0, 1] with identical marginal distribution function F hits x \in R with 0 < F (x) < 1 is the hitting probability of x. We show that the hitting probability is always positive, unless the…

Probability · Mathematics 2012-06-27 Martin Hofmann

We present a technique to study normalizing strategies when termination is asymptotic, that is, it appears as a limit, as opposite to reaching a normal form in a finite number of steps. Asymptotic termination occurs in several settings,…

Logic in Computer Science · Computer Science 2022-05-24 Claudia Faggian , Giulio Guerrieri

We obtain quenched hitting distributions to be compound Poissonian for a certain class of random dynamical systems. The theory is general and designed to accommodate non-uniformly expanding behavior and targets that do not overlap much with…

Dynamical Systems · Mathematics 2024-02-06 Lucas Amorim , Nicolai Haydn , Sandro Vaienti

A class of examples is constructed to show that for strictly stationary Markov chains that are reversible, the simultaneous mixing rates for the $\rho$-mixing and strong mixing ($\alpha$-mixing) conditions can be fairly arbitrary, within…

Probability · Mathematics 2022-10-04 Richard C. Bradley

Consider the random subgraph process on a base graph $G$ with $n$ vertices: we generate a sequence $\{G_t\}_{t=0}^{|E(G)|}$ by taking a uniformly random ordering of the edges of $G$ and then adding these edges one by one to the empty graph…

Combinatorics · Mathematics 2026-03-06 Yaobin Chen , Yu Chen , Seonghyuk Im , Yiting Wang

Let $A$ be an $n \times n$ random matrix with iid entries over a finite field of order $q$. Suppose that the entries do not take values in any additive coset of the field with probability greater than $1 - \alpha$ for some fixed $0 < \alpha…

Combinatorics · Mathematics 2013-07-24 Kenneth Maples

Suppose we observe a trajectory of length $n$ from an exponentially $\alpha$-mixing stochastic process over a finite but potentially large state space. We consider the problem of estimating the probability mass placed by the stationary…

Machine Learning · Statistics 2025-06-09 Milind Nakul , Vidya Muthukumar , Ashwin Pananjady

In this paper, we consider the N-urn Ehrenfest model. By utilizing an auxiliary continuous-time Markov chain, we obtain the explicit formula for the Laplace transform of the hitting time from a single state to a set A of states where A…

Probability · Mathematics 2020-06-16 Cheng Xin , Minzhi Zhao , Qiang Yao , Erjia Cui

Under very general conditions the hitting time of a set by a stochastic process is a stopping time. We give a new simple proof of this fact. The section theorems for optional and predictable sets are easy corollaries of the proof.

Probability · Mathematics 2023-06-28 Richard F. Bass
‹ Prev 1 3 4 5 6 7 10 Next ›