English
Related papers

Related papers: Hitting times for special patterns in the symmetri…

200 papers

Small-space and large-time estimates and asymptotic expansion of the distribution function and (the derivatives of) the density function of hitting times of points for symmetric L\'evy processes are studied. The L\'evy measure is assumed to…

Probability · Mathematics 2017-02-15 Tomasz Juszczyszyn , Mateusz Kwaśnicki

We study the problem of characterizing the expected hitting times for a robust generalization of continuous-time Markov chains. This generalization is based on the theory of imprecise probabilities, and the models with which we work…

Probability · Mathematics 2022-06-28 Thomas Krak

We investigate the asymptotic disconnection time of a large discrete cylinder $(\mathbb{Z}/N\mathbb{Z})^{d}\times \mathbb{Z}$, $d\geq 2$, by simple and biased random walks. For simple random walk, we derive a sharp asymptotic lower bound…

Probability · Mathematics 2024-09-27 Xinyi Li , Yu Liu , Yuanzheng Wang

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

Previous work has shown the effectiveness of random walk hitting times as a measure of dissimilarity in a variety of graph-based learning problems such as collaborative filtering, query suggestion or finding paraphrases. However,…

Data Structures and Algorithms · Computer Science 2013-04-17 Joel Lang , James Henderson

Given an ergodic dynamical system $(X,T,\mu)$, and $U\subset X$ measurable with $\mu (U)>0$, let $\mu (U)\tau_U(x)$ denote the normalized hitting time of $x\in X$ to $U$. We prove that given a sequence $(U_n)$ with $\mu (U_n)\to 0$, the…

Dynamical Systems · Mathematics 2007-05-23 N. Haydn , Y. Lacroix , S. Vaienti

We consider a finite range symmetric exclusion process on the integer lattice in any dimension. We interpret it as a non-elliptic time-dependent random conductance model by setting conductances equal to one over the edges with end points…

Probability · Mathematics 2012-06-11 L. Avena

In this paper, we study an exact solution of the asymmetric simple exclusion process on a periodic lattice of finite sites with two typical updates, i.e., random and parallel. Then, we find that the explicit formulas for the partition…

Statistical Mechanics · Physics 2009-05-19 Masahiro Kanai , Katsuhiro Nishinari , Tetsuji Tokihiro

The spectrum of Hamiltonian (Markov matrix) of a multi-species asymmetric simple exclusion process on a ring is studied. The dynamical exponent concerning the relaxation time is found to coincide with the one-species case. It implies that…

Mathematical Physics · Physics 2009-09-01 Chikashi Arita , Atsuo Kuniba , Kazumitsu Sakai , Tsuyoshi Sawabe

Hiary [3] has presented an algorithm which allows to evaluate the truncated theta function $\sum_{k=0}^n \exp(2\pi \i (zk+\tau k^2))$ to within $\pm \epsilon$ in $O(\ln(\tfrac{n}{\epsilon})^{\kappa})$ arithmetic operations for any real $z$…

Number Theory · Mathematics 2014-03-25 Alexey Kuznetsov

We consider the totally asymmetric exclusion process in discrete time with the parallel update. Constructing an appropriate transformation of the evolution operator, we reduce the problem to that solvable by the Bethe ansatz. The…

Statistical Mechanics · Physics 2007-05-23 A. M. Povolotsky , V. B. Priezzhev

In this paper we establish a moderate deviation principle of the hitting times for trajectories of sums of independent and identically distributed random variables. The main idea of proof is to convert the moderate deviations over a small…

Probability · Mathematics 2023-11-10 Yuheng He

We describe a resolvent-type method for estimating time integrals of time-dependent functionals of general right processes in equilibrium and apply this result in the case of weakly asymmetric one-dimensional simple exclusion showing a weak…

Probability · Mathematics 2012-09-14 Sigurd Assing

We consider the simple exclusion process in the integer segment $ [1, N]$ with $k\le N/2$ particles and spatially inhomogenous jumping rates. A particle at site $x\in [ 1, N]$ jumps to site $x-1$ (if $x\ge 2$) at rate $1-\omega_x$ and to…

Probability · Mathematics 2024-02-20 Hubert Lacoin , Shangjie Yang

In this work we consider a simple random walk embedded in a generic branched structure and we find a close-form formula to calculate the hitting time $H\left(i,f\right)$ between two arbitrary nodes $i$ and $j$. We then use this formula to…

Statistical Mechanics · Physics 2015-06-11 Elena Agliari , Fabio Sartori , Luca Cattivelli , Davide Cassi

We study time-uniform statistical inference for parameters in stochastic approximation (SA), which encompasses a bunch of applications in optimization and machine learning. To that end, we analyze the almost-sure convergence rates of the…

Machine Learning · Statistics 2024-10-22 Chuhan Xie , Kaicheng Jin , Jiadong Liang , Zhihua Zhang

The risk of catastrophes is related to the possibility of occurring extreme values. Several statistical methodologies have been developed in order to evaluate the propensity of a process for the occurrence of high values and the permanence…

Statistics Theory · Mathematics 2019-05-08 Helena Ferreira , Marta Ferreira

We consider the simple exclusion process with $k$ particles on a segment of length $N$ performing random walks with transition $p>1/2$ to the right and $q=1-p$ to the left. We focus on the case where the asymmetry in the jump rates…

Probability · Mathematics 2018-06-01 C. Labbé , H. Lacoin

We deal with a planar random flight $\{(X(t),Y(t)),0<t\leq T\}$ observed at $n+1$ equidistant times $t_i=i\Delta_n,i=0,1,...,n$. The aim of this paper is to estimate the unknown value of the parameter $\lambda$, the underlying rate of the…

Statistics Theory · Mathematics 2007-06-13 Alessandro De Gregorio

Starting from an n-by-n matrix of zeros, choose uniformly random zero entries and change them to ones, one-at-a-time, until the matrix becomes invertible. We show that with probability tending to one as n tends to infinity, this occurs at…

Probability · Mathematics 2018-08-09 Louigi Addario-Berry , Laura Eslava