English
Related papers

Related papers: Sharp asymptotics for $N$-point correlation functi…

200 papers

A two-dimensional array of independent random signs produces coalescing random walks. The position of the walk, starting at the origin, after N steps is a highly nonlinear, noise sensitive function of the signs. A typical term of its…

Probability · Mathematics 2007-05-23 Boris Tsirelson

We investigate the long-term behavior of a random walker evolving on top of the simple symmetric exclusion process (SSEP) at equilibrium, in dimension one. At each jump, the random walker is subject to a drift that depends on whether it is…

Probability · Mathematics 2020-10-28 Marcelo R. Hilário , Daniel Kious , Augusto Teixeira

The non-asymptotic tail bounds of random variables play crucial roles in probability, statistics, and machine learning. Despite much success in developing upper bounds on tail probability in literature, the lower bounds on tail…

Probability · Mathematics 2020-09-08 Anru R. Zhang , Yuchen Zhou

The distribution of the first positive position reached by a random walker starting from the origin is fundamental for understanding the statistics of extremes and records in one-dimensional random walks. We present a comprehensive study of…

Statistical Mechanics · Physics 2025-09-03 Claude Godrèche , Jean-Marc Luck

The usual development of the continuous time random walk (CTRW) assumes that jumps and time intervals are a two-dimensional set of independent and identically distributed random variables. In this paper we address the theoretical setting of…

Data Analysis, Statistics and Probability · Physics 2008-09-29 Miquel Montero , Jaume Masoliver

Let $(X_n:n\geq 0)$ be a sequence of i.i.d. r.v.'s with negative mean. Set $S_0=0$ and define $S_n=X_1+... +X_n$. We propose an importance sampling algorithm to estimate the tail of $M=\max \{S_n:n\geq 0\}$ that is strongly efficient for…

Probability · Mathematics 2008-08-21 Jose Blanchet , Peter Glynn

Given a random walk on a free group, we study the random walks it induces on the group's quotients. We show that the spectrum of asymptotic entropies of the induced random walks has no isolated points, except perhaps its maximum.

Group Theory · Mathematics 2023-10-05 Omer Tamuz , Tianyi Zheng

We study randomly stopped sums via their asymptotic scales. First, finiteness of moments is considered. To generalise this study, asymptotic scales applicable to the class of all heavy-tailed random variables are used. The stopping is…

Probability · Mathematics 2014-05-12 Jaakko Lehtomaa

This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…

Probability · Mathematics 2025-08-25 Fernando P. A. Prado , Rafael A. Rosales

We study correlations in the multispecies TASEP on a ring. Results on correlation of two adjacent points prove two conjectures by Thomas Lam on (a) the limiting direction of a reduced random walk in $\tilde A_{n-1}$ and (b) the asymptotic…

Probability · Mathematics 2018-10-31 Arvind Ayyer , Svante Linusson

We consider a two-node fluid network with batch arrivals of random size having a heavy-tailed distribution. We are interested in the tail asymptotics for the stationary distribution of a two-dimensional queue-length process. The tail…

Probability · Mathematics 2016-11-25 Sergey Foss , Masakiyo Miyazawa

Consider a discrete-time quantum walk on the $N$-cycle subject to decoherence both on the coin and the position degrees of freedom. By examining the evolution of the density matrix of the system, we derive some new conclusions about the…

Quantum Physics · Physics 2011-07-20 Chaobin Liu , Nelson Petulante

We consider a two dimensional skip-free reflecting random walk on a nonnegative integer quadrant. We are interested in the tail asymptotics of its stationary distribution, provided its existence is assumed. We derive exact tail asymptotics…

Probability · Mathematics 2012-01-17 Masahiro Kobayashi , Masakiyo Miyazawa

In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…

We develop importance sampling based efficient simulation techniques for three commonly encountered rare event probabilities associated with random walks having i.i.d. regularly varying increments; namely, 1) the large deviation…

Probability · Mathematics 2014-09-30 Karthyek R. A. Murthy , Sandeep Juneja , Jose Blanchet

We consider a generalized model of elephant random walks wherein the walker, during the $(n+1)$-st time-stamp, draws from the past (i.e. the set $\{1,2,\ldots,n\}$) a sample of $k$ time-stamps, either with replacement or without, where $k$…

Probability · Mathematics 2026-01-09 Moumanti Podder , Archi Roy

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We suppose that the distributions of…

Probability · Mathematics 2011-12-06 Nadine Guillotin-Plantard , Françoise Pène

We consider an exactly solvable model of branching random walk with random selection, which describes the evolution of a population with $N$ individuals on the real line. At each time step, every individual reproduces independently, and its…

Probability · Mathematics 2018-10-09 Aser Cortines , Bastien Mallein

We consider the partially asymmetric simple exclusion process (PASEP) when its steady-state probability distribution function can be written in terms of a linear superposition of product measures with a finite number of shocks. In this case…

Statistical Mechanics · Physics 2010-06-10 Farhad H. Jafarpour , Somayeh Zeraati

In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…

Data Structures and Algorithms · Computer Science 2016-12-28 Colin Cooper , Robert Elsasser , Hirotaka Ono , Tomasz Radzik
‹ Prev 1 3 4 5 6 7 10 Next ›