arXiv math/04070062004-07math.PR

Multi-particle processes with reinforcements

Yevgeniy Kovchegov

备注：: 12 pages

英文摘要：

We consider a multi-particle generalization of linear edge-reinforced random walk (ERRW). We observe that in absence of exchangeability, new techniques are needed in order to study the multi-particle model. We describe an unusual coupling construction associated with the two-point edge-reinforced process on Z and prove a form of recurrence: the two particles meet infinitely often a.s.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Stochastic processes with competing reinforcements

We introduce a simple but powerful technique to study processes driven by two or more reinforcement mechanisms in competition. We apply our method to two types of models: to non conservative zero range processes on finite graphs, and to multi-particle random walks with positive and negative reinforcement on the edges. The results hold for a broad class of reinforcement functions, including those with superlinear growth. Our technique consists in a comparison of the original processes with suitable reference models. To implement the comparison we estimate a Radon-Nikodym derivative on a careful…

2022-06-29math.PR

A survey of random processes with reinforcement

The models surveyed include generalized Pólya urns, reinforced random walks, interacting urn models, and continuous reinforced processes. Emphasis is on methods and results, with sketches provided of some proofs. Applications are discussed in statistics, biology, economics and a number of other areas.

2007-02-23math.PR

Noise reinforcement for L{é}vy processes

In a step reinforced random walk, at each integer time and with a fixed probability p $\in$ (0, 1), the walker repeats one of his previous steps chosen uniformly at random, and with complementary probability 1 -- p, the walker makes an independent new step with a given distribution. Examples in the literature include the so-called elephant random walk and the shark random swim. We consider here a continuous time analog, when the random walk is replaced by a L{é}vy process. For sub-critical (or admissible) memory parameters p < p c , where p c is related to the Blumenthal-Getoor index of the L{…

2018-10-19math.PR

WARM percolation on a regular tree in the strong reinforcement regime

We consider a class of reinforcement processes, called WARMs, on tree graphs. These processes involve a parameter $α$ which governs the strength of the reinforcement, and a collection of Poisson processes indexed by the vertices of the graph. It has recently been proved that for any fixed bounded degree graph with Poisson firing rates that are uniformly bounded above, in the very strong reinforcement regime ($α\gg 1$ sufficiently large depending on the maximal degree), the set of edges that "survive" (i.e. that are reinforced infinitely often by the process) has only finite connected component…

2020-09-16math.PR

How linear reinforcement affects Donsker's Theorem for empirical processes

A reinforcement algorithm introduced by H.A. Simon \cite{Simon} produces a sequence of uniform random variables with memory as follows. At each step, with a fixed probability $p\in(0,1)$, $\hat U_{n+1}$ is sampled uniformly from $\hat U_1, \ldots, \hat U_n$, and with complementary probability $1-p$, $\hat U_{n+1}$ is a new independent uniform variable. The Glivenko-Cantelli theorem remains valid for the reinforced empirical measure, but not the Donsker theorem. Specifically, we show that the sequence of empirical processes converges in law to a Brownian bridge only up to a constant factor when…

2020-05-25math.PRmath.STstat.TH

Edge- and vertex-reinforced random walks with super-linear reinforcement on infinite graphs

In this paper we introduce a new simple but powerful general technique for the study of edge- and vertex-reinforced processes with super-linear reinforcement, based on the use of order statistics for the number of edge, respectively of vertex, traversals. The technique relies on upper bound estimates for the number of edge traversals, proved in a different context by Cotar and Limic [Ann. Appl. Probab. (2009)] for finite graphs with edge reinforcement. We apply our new method both to edge- and to vertex-reinforced random walks with super-linear reinforcement on arbitrary infinite connected gra…

2016-06-02math.PR

更多相关论文收起更多论文

Synchronization of Reinforced Stochastic Processes with a Network-based Interaction

Randomly evolving systems composed by elements which interact among each other have always been of great interest in several scientific fields. This work deals with the synchronization phenomenon, that could be roughly defined as the tendency of different components to adopt a common behavior. We continue the study of a model of interacting stochastic processes with reinforcement, that recently has been introduced in Crimaldi et al. (2016, arXiv:1602.06217). Generally speaking, by reinforcement we mean any mechanism for which the probability that a given event occurs has an increasing dependen…

2016-07-28math.PR

Asymptotic Results of a Multiple-entry Reinforcement Process

We introduce a class of stochastic processes with reinforcement consisting of a sequence of random partitions $\{\mathcal{P}_t\}_{t \ge 1}$, where $\mathcal{P}_t$ is a partition of $\{1,2,\dots, Rt\}$. At each time~$t$,~$R$ numbers are added to the set being partitioned; of these, a random subset (chosen according to a time-dependent probability distribution) joins existing blocks, and the others each start new blocks on their own. Those joining existing blocks each choose a block with probability proportional to that block's cardinality, independently. We prove results concerning the asymptot…

2021-02-26math.PR

A sojourn-based approach to semi-Markov Reinforcement Learning

In this paper we introduce a new approach to discrete-time semi-Markov decision processes based on the sojourn time process. Different characterizations of discrete-time semi-Markov processes are exploited and decision processes are constructed by their means. With this new approach, the agent is allowed to consider different actions depending also on the sojourn time of the process in the current state. A numerical method based on $Q$-learning algorithms for finite horizon reinforcement learning and stochastic recursive relations is investigated. Finally, we consider two toy examples: one in …

2022-04-20cs.NAmath.NAmath.PR

Tagged particle processes and their non-explosion criteria

We give a derivation of tagged particle processes from unlabeled interacting Brownian motions. We give a criteria of the non-explosion property of tagged particle processes. We prove the quasi-regularity of Dirichlet forms describing the environment seen from the tagged particle, which were used in previous papers to prove the invariance principle of tagged particles of interacting Brownian motions.

2010-03-25math-phmath.MPmath.PR