English
Related papers

Related papers: How linear reinforcement affects Donsker's Theorem…

200 papers

Let (S_n)_{n\in\N} be a Z-valued random walk with increments from the domain of attraction of some \alpha-stable law and let (\xi(i))_{i\in\Z} be a sequence of iid random variables. We want to investigate U-statistics indexed by the random…

Probability · Mathematics 2015-03-04 Brice Franke , Francoise Pene , Martin Wendler

A random walk with counterbalanced steps is a process of partial sums $\check S(n)=\check X_1+ \cdots + \check X_n$ whose steps $\check X_n$ are given recursively as follows. For each $n\geq 2$, with a fixed probability $p$, $\check X_n$ is…

Probability · Mathematics 2022-07-05 Jean Bertoin

We study a generalization of the Brownian bridge as a stochastic process that models the position and velocity of inertial particles between the two end-points of a time interval. The particles experience random acceleration and are assumed…

Systems and Control · Computer Science 2014-07-15 Yongxin Chen , Tryphon Georgiou

This work deals with systems of interacting reinforced stochastic processes, where each process $X^j=(X_{n,j})_n$ is located at a vertex $j$ of a finite weighted direct graph, and it can be interpreted as the sequence of "actions" adopted…

Probability · Mathematics 2019-09-26 Giacomo Aletti , Irene Crimaldi , Andrea Ghiglietti

A seminal result by Koml\'os, Sark\"ozy, and Szemer\'edi states that if a graph $G$ with $n$ vertices has minimum degree at least $kn/(k + 1)$, for some $k \in \mathbb{N}$ and $n$ sufficiently large, then it contains the $k$-th power of a…

Combinatorics · Mathematics 2021-08-12 Rajko Nenadov , Miloš Trujić

The two-dimensional Loewner exploration process is generalized to the case where the random force is self-similar with positively correlated increments. We model this random force by a fractional Brownian motion with Hurst exponent $H\geq…

Statistical Mechanics · Physics 2022-02-16 S. Tizdast , Z. Ebadi , J. Cheraghalizadeh , M. N. Najafi , José S. Andrade , Hans J. Herrmann

Let $\{\eta_i\}_{i\ge 1}$ be a sequence of dependent Bernoulli random variables. While the Poisson approximation for the distribution of $\sum_{i=1}^n\eta_i$ has been extensively studied in the literature, this paper establishes new…

Probability · Mathematics 2025-10-03 Hua-Ming Wang , Shuxiong Zhang

Partial observability is a common challenge in many reinforcement learning applications, which requires an agent to maintain memory, infer latent states, and integrate this past information into exploration. This challenge leads to a number…

Machine Learning · Computer Science 2020-10-27 Chi Jin , Sham M. Kakade , Akshay Krishnamurthy , Qinghua Liu

When variable selection methods are applied to bootstrapped and multiply imputed datasets, the set of selected variables typically varies across iterations. Aggregating results via the union rule can lead to overly dense models. We propose…

Methodology · Statistics 2026-04-23 Johannes Bleher , Claudia Tarantola

We study the persistence exponent for the first passage time of a random walk below the trajectory of another random walk. More precisely, let $\{B_n\}$ and $\{W_n\}$ be two centered, weakly dependent random walks. We establish that…

Probability · Mathematics 2019-05-21 Bastien Mallein , Piotr Miłoś

Local perturbations in conservative particle systems can have a non-local influence on the stationary measure. To capture this phenomenon, we analyze in this paper two toy models. We study the symmetric exclusion process on a countable set…

Probability · Mathematics 2024-10-25 Frank Redig , Ellen Saada

In this work we present a Gaussian process that arise from the iteration of p fractional Ornstein-Uhlenbeck processes generated by the same fractional Brownian motion. This iteration results, when the values of lambdas are pairwise…

Statistics Theory · Mathematics 2017-09-22 Juan Kalemkerian

We introduce a theorem proving algorithm that uses practically no domain heuristics for guiding its connection-style proof search. Instead, it runs many Monte-Carlo simulations guided by reinforcement learning from previous proof attempts.…

Artificial Intelligence · Computer Science 2018-05-22 Cezary Kaliszyk , Josef Urban , Henryk Michalewski , Mirek Olšák

We consider a linearly edge-reinforced random walk on a class of two-dimensional graphs with constant initial weights. The graphs are obtained from $\mathbb{Z}^2$ by replacing every edge by a sufficiently large, but fixed number of edges in…

Probability · Mathematics 2009-10-13 Franz Merkl , Silke W. W. Rolles

We show that almost any one-dimensional projection of a suitably scaled random walk on a hypercube, inscribed in a hypersphere, converges weakly to an Ornstein-Uhlenbeck process as the dimension of the sphere tends to infinity. We also…

Probability · Mathematics 2009-08-26 Max Skipper

Several classical results on boundary crossing probabilities of Brownian motion and random walks are extended to asymptotically Gaussian random fields, which include sums of i.i.d. random variables with multidimensional indices,…

Probability · Mathematics 2007-05-23 Hock Peng Chan , Tze Leung Lai

We develop large sample theory for merged data from multiple sources. Main statistical issues treated in this paper are (1) the same unit potentially appears in multiple datasets from overlapping data sources, (2) duplicated items are not…

Statistics Theory · Mathematics 2018-05-22 Takumi Saegusa

Consider a negatively drifted one dimensional Brownian motion starting at positive initial position, its first hitting time to 0 has the inverse Gaussian law. Moreover, conditionally on this hitting time, the Brownian motion up to that time…

Probability · Mathematics 2018-05-10 Christophe Sabot , Xiaolin Zeng

In probability theory, reinforced walks are random walks on a lattice (or more generally a graph) that preferentially revisit neighboring `locations' (sites or bonds) that have been visited before. In this paper, we consider walks with…

Statistical Mechanics · Physics 2009-11-13 Jacob G. Foster , Peter Grassberger , Maya Paczuski

Consider a sequence {X(i,0) : i = 1, ..., n} of i.i.d. random variables. Associate to each X(i,0) an independent mean-one Poisson clock. Every time a clock rings replace that X-variable by an independent copy. In this way, we obtain i.i.d.…

Probability · Mathematics 2007-05-23 Davar Khoshnevisan , David A. Levin , Pedro J. Mendez-Hernandez