Localization on 5 sites for vertex reinforced random walks: Towards a characterization
Bruno Schapira (I2M)

TL;DR
This paper investigates the localization behavior of vertex reinforced random walks on integers, aiming to characterize conditions under which the walk localizes on five sites with positive probability.
Contribution
It offers partial results towards a complete characterization of weights leading to localization on five sites and proposes conjectures on the almost sure behavior.
Findings
Partial characterization of weights for localization on 5 sites
Conjecture on almost sure localization behavior
Progress towards a full theoretical understanding
Abstract
We continue the investigation of the localization phenomenon for a Vertex Reinforced Random Walk on the integer lattice. We provide some partial results towards a full characterization of the weights for which localization on 5 sites occurs with positive probability, and make some conjecture concerning the almost sure behavior.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Random Matrices and Applications · Markov Chains and Monte Carlo Methods
Localization on sites for Vertex reinforced random walks: towards a characterization
Bruno Schapira
Abstract.
We continue the investigation of the localization phenomenon for a Vertex Reinforced Random Walk on the integer lattice. We provide some partial results towards a full characterization of the weights for which localization on sites occurs with positive probability, and make some conjecture concerning the almost sure behavior.
Keywords and phrases. Self-interacting random walks; Vertex Reinforced Random Walk.
MSC 2010 subject classifications. 60K35.
Aix-Marseille Université, CNRS, Centrale Marseille, I2M, UMR 7373, 13453 Marseille, France; [email protected]
1. Introduction
Given a sequence of positive real numbers, called the weight, one can define a process on , called Vertex Reinforced Random Walk (VRRW) as follows: first , and then for any and ,
[TABLE]
where and is the number of visits to site by the process before time (see below). This process was introduced by Pemantle [P] on the complete graph and for a linear weight, and then by Pemantle and Volkov on , still for the linear weight, who showed that the process localizes on five sites with positive probability, that is with positive probability exactly five sites are visited infinitely often. This result was later improved by Tarrès who showed [T1, T2] that this behavior occurs in fact almost surely.
A few years later, Volkov [V] introduced the model with a general weight sequence, in the same fashion as Davis [Dav] did for Edge Reinforced Random Walks. He proved in particular that for weights of the form , with , localization on a finite subgraph is not possible. This was later improved in [CK, Sch, S] in the case , where it was proved that the process visits almost surely all sites infinitely often.
In a previous work in collaboration with Basdevant and Singh [BSS], we managed to completely characterize the nondecreasing weights for which localization on sites occurs with positive probability, or almost surely, in terms of some parameter (see below). Our aim here is to analyze the analogous question for the localization on sites. For this we introduce some new parameter , which should play a similar role as . To define it, we first extend as a function on the positive reals by , and then set
[TABLE]
We will assume throughout the paper that
[TABLE]
which is equivalent to saying that is a bijection from to itself. Note however, that this is not a restrictive hypothesis, since when is reciprocally summable, it is known [BSS, V] that the process localizes almost surely on two sites. Then we denote by its inverse, and define for ,
[TABLE]
When is nondecreasing, the map is nonincreasing and one defines
[TABLE]
with the convention that . In [BSS] it was proved in particular that localization on sites holds with nonzero probability if, and only if, is finite. We now define for ,
[TABLE]
with the convention that , for , and set
[TABLE]
We make the following conjecture (with standing for the set of sites which are visited infinitely often):
Conjecture 1.1**.**
Assume that is nondecreasing and satisfies (2). Assume further that . Then
[TABLE]
Remark 1.1**.**
As we will later explain further, we also conjecture that in fact always belongs to .***
The hardest part here is the characterization of the almost sure localization, which is a notoriously difficult problem that we will not discuss in this paper; we simply recall that in the case of a linear weight, Tarrès proved that almost surely [T1, T2]. Proving that the same holds for some other weight function is possibly one of the most challenging problem on this model. Instead we will only be interested here on the easiest part of the conjecture, which is a characterization of the localization with positive probability. Our first result provides one direction of the conjecture:
Theorem 1.1**.**
Assume that is nondecreasing. Then
[TABLE]
We note that this result was proved in [BSS2] (see the proof of Proposition 1.4 there) under some additional hypotheses on , including the fact that was a slowly varying function.
Our second result concerns the other direction. However, instead of being finite, one needs to assume some slightly stronger condition (which we nevertheless conjecture to be equivalent). Namely, we first define , and note that is increasing and continuous; thus it has an inverse which we denote by . Then set for ,
[TABLE]
and
[TABLE]
Note that and , for all . Thus for any , . In particular for any ,
[TABLE]
Our second result is the following:
Theorem 1.2**.**
Assume that is nondecreasing and satisfies (2). Assume further that . Then
[TABLE]
As mentioned above we conjecture that in fact , for all weights . We provide some evidence for this fact at the end of the paper, and show that it is true for a large class of weight functions (see Lemmas 5.1 and 5.2).
In particular Lemma 5.1 shows that for any surlinear weight function, such that , one has . This is of course not surprising, regarding the known result for a linear weight, but we stress that prior to this, not much was known for weights with intermediate growth between linear and . Indeed, in [BSS] it was only proved that for weights satisfying , , and localization on or less sites was impossible.
It might look a bit disappointing that we cannot exclude the possibility of a localization on sites in the conclusion of Theorem 1.2, especially since for a linear weight as well as for weights satisfying , with , it was proved respectively in [PV, T2] and [BSS2], that localization on sites occurs with positive probability. Let us however observe that in both cases the proofs rely heavily on the explicit form of the weight function and cannot be transposed (at least not directly) to the general setting we are considering here.
Finally we also believe that localization on any even number of sites, larger than or equal to , is not possible for any weight function. In contrast it was proved in [BSS2] that localization on any odd number of sites – other than one and three – is possible.
The paper is organized as follows. In the next section, we recall some important and elementary facts about the VRRW, and some related martingales attached to each site. Then in Sections and we give the proofs of Theorems 1.1 and 1.2 respectively. The final section is concerned with the computation of the parameters and , and gives some cases where one can show equality between them.
2. Notation and background
2.1. VRRW
Given some initial distribution of local times , we define the -VRRW as the process , whose transition probabilities are given by (1), with for any , , and for any ,
[TABLE]
We denote by the law of the -VRRW. We call the configuration with , for all and . We then simply say that is a VRRW when its initial local time distribution is given by , and denote its law by . We also recall that a -VRRW can be defined as well on any subgraph of , and we refer to [BSS] for details.
2.2. The martingales
For , define . Recall that stands for the set of sites visited infinitely often by the walk:
[TABLE]
We define for any , and ,
[TABLE]
and
[TABLE]
We let also , and , and consider the limits:
[TABLE]
An important observation from Tarrès [T1, T2] is that is a martingale for each . Moreover, if
[TABLE]
then these martingales are bounded in , and thus converge almost surely and in . Moreover, for any -VRRW, one has
[TABLE]
We will also use the following result due to Tarrès (see also [BSS, Lemma 3.3]):
Lemma 2.1** (Tarrès [T2]).**
Assume that is nondecreasing and that (6) holds. Then, for any , almost surely,
[TABLE]
We further use the same notation as in [T2], and write , when the sequence converges to some finite real. In particular, it follows from the above discussion that
[TABLE]
3. Proof of Theorem 1.1
We start the proof with the following lemma:
Lemma 3.1**.**
Assume that is nondecreasing. Then
[TABLE]
Remark 3.1**.**
This result has the same flavor than some others from [Sch, S, V], which all give different conditions on the weight , ensuring that localization on any finite subgraph is not possible. In particular the proof in [S] shows that for any weight satisfying , the walk cannot localize on any finite subgraph, which is close to imply our result (but not quite).**
Proof of Lemma 3.1.
We first note that if localization on five sites occurs with positive probability, then there exists some initial configuration , such that with positive probability the -VRRW spends all its time in the set , and visits all sites from this set infinitely often. Call this event. By the conditional Borel-Cantelli Lemma (see Theorem 4.3.2 in [Dur]), one can see that almost surely on the event , one has , since for some constant (only depending on ), one has
[TABLE]
where we denote here by the sigma field generated by the process up to its -th visit to site . Then we use that the following process is a martingale (for a very similar reason as for ):
[TABLE]
where denotes the probability to jump to site at -th visit to site . Since this martingale has bounded increments, we know that almost surely, either it converges, or its as well as its are both infinite (see Theorem 4.3.1 in [Dur]). However, we have just observed that on the event , its is finite, which means that it must converge, and as a consequence on the event , it holds almost surely
[TABLE]
Now by definition of , one has for some constant (depending only on ), and on ,
[TABLE]
where denotes the time of -th visit to site . By symmetry one has as well
[TABLE]
with the time of -th visit to site . Finally observe that for any , , with a constant depending only on . This implies that for any , either or . Using that is nondecreasing, it follows that for some (possibly larger) constant ,
[TABLE]
The lemma follows, using again that is nondecreasing. ∎
We next prove the following result.
Lemma 3.2**.**
Let be a -VRRW, for some initial local time configuration . Assume that is nondecreasing, and satisfies (2) and (6). Then on the event , it holds almost surely
[TABLE]
Proof.
Let for ,
[TABLE]
denotes the number of jumps from to before time , for any . Then
[TABLE]
Now observe that is nondecreasing and that for all ,
[TABLE]
Since by definition is finite on the event , we deduce that
[TABLE]
By symmetry, one has as well
[TABLE]
and since by (8), one also has , we get in fact
[TABLE]
Moreover, Lemma 2.1 implies that under the hypotheses of the lemma and on the event , is finite, and thus also. Together with (7), it follows that
[TABLE]
We claim now that
[TABLE]
Indeed, on one hand is nondecreasing, and on the other hand its limit satisfies . Since , Lemma 2.1 shows that , and we get (12). By using next that , together with (10), (11) and (12), we obtain
[TABLE]
which implies that . Using now (9), it follows that , almost surely. By symmetry we get as well , and the lemma follows. ∎
Let us resume now the proof of Theorem 1.1. Lemma 3.7 in [BSS] shows that there exists some local time configuration , such that for the -VRRW, the event
[TABLE]
has some positive probability. Moreover, we know by (7) that on ,
[TABLE]
and using (8), we deduce that converges as , towards some . Furthermore, Lemma 4.8 in [BSS] shows that almost surely , and by symmetry we can assume without loss of generality that . In particular, this gives , for large enough. Set now
[TABLE]
where is the probability to jump to site at -th visit to site . As noticed already in the proof of Lemma 3.1, one has . But since after some time the process has at least probability to jump to when it is in , we see that for large enough is nondecreasing. In particular there exists some (random) constant , such that , for all . This implies that for some other constant ,
[TABLE]
By using also that
[TABLE]
we deduce that for some (random) ,
[TABLE]
Together with Lemma 3.2, this yields for some constant ,
[TABLE]
which concludes the proof of the theorem, since is finite on .
4. Proof of Theorem 1.2
We start the proof with some elementary lemma.
Lemma 4.1**.**
Assume that is nondecreasing. Then
[TABLE]
Proof.
Assume that , for some . Since is nondecreasing, this implies on one hand , and also , for all . The latter implies the existence of a constant , such that , for all (namely one can take ). Assume that is large enough so that . Then , for all . Therefore , for all such , and it follows that
[TABLE]
In particular, by definition of , this can only happen for finitely many , which proves that .
We use now this information to bootstrap the previous argument. Assume that for some , later taken large enough. Note first that this implies . Moreover, since , we can find some small enough constant, such that , assuming is large enough. Taking larger if necessary, one can assume that , for all . This implies first , and then , for all such . Thus
[TABLE]
from which we deduce that , and the lemma follows. ∎
The next step is the following lemma.
Lemma 4.2**.**
Assume that is nondecreasing and that . For integer, , and we define , as the set
[TABLE]
Given some local time configuration, we denote by the law of the -VRRW restricted to the set . For any , and , one has
[TABLE]
Proof.
Let , , and be given. Consider , and define the following stopping times:
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
The main steps of the proof are the following. First we will see that on the event when is infinite, is finite, and thus the main part of the proof is to deal with the event when is finite. Now after time we know that the local time in is large, specifically , since by hypothesis. This ensures that the fluctuations of the martingale after time are small, by Doob’s inequality combined with the fact that the square of is reciprocally summable by hypothesis on and Lemma 4.1 (recall that ). More precisely, we fix now some , and we get that for large enough,
[TABLE]
The next step is to see that necessarily at time the local time in is also large, and thus that the fluctuations of the martingale after are also small for large enough; see (19) below. This is where the role of comes into play, since we show that the increment of the local time in between and goes to infinity as . We note that to prove this, we use (15). The last step of the proof is to see that with probability close to one is infinite, and furthermore that the increment of between times and is dominated by a series which appears in the definition of , which is why we need this quantity to be finite. This is also where the role of appears. We show that the process
[TABLE]
remains bounded between times and , with probability close to one (and is also bounded up to time by definition).
Let us now proceed with the details of the argument. First observe that , and thus
[TABLE]
Therefore, one can assume now that is finite.
The next step is to show that the local time in at time is large, and for this we show that its increment between and is large. Indeed, note first that since the process we consider is reflected in [math], one has for any ,
[TABLE]
In addition, (7) gives
[TABLE]
Assume that is large enough so that . By definition of and , this implies
[TABLE]
Then it follows from the last displays and (15) that for large enough,
[TABLE]
Define next
[TABLE]
Since is nondecreasing, and since we recall that by definition of , one has , it follows from (7) that
[TABLE]
However, , and thus as well, when . It follows using again Doob’s -inequality, that for large enough,
[TABLE]
The last step of the proof is to show that with probability close to one, is infinite and is finite. Let
[TABLE]
where is the probability to jump to [math] at -th visit to . Recall that
[TABLE]
and on the other hand (7) and Lemma 2.1 yield
[TABLE]
As a consequence,
[TABLE]
Since , for all , is nondecreasing up to time . Note that , if is taken large enough. Also by definition, . Therefore by using (19), and again Doob’s -inequality, we get at least for large enough,
[TABLE]
Remember then that is defined by , and thus by using the hypothesis on , we get that for all ,
[TABLE]
It follows that on the event , one has
[TABLE]
Using now that , we can find such that
[TABLE]
Then by using (17), (18), (20) and (21), we get that if is large enough,
[TABLE]
But by definition of and , on the event , we have for large enough,
[TABLE]
[TABLE]
Since can be chosen arbitrarily small, and since we recall that on the event , one has , this concludes the proof of the lemma. ∎
We can now finish the proof of Theorem 1.2. Fix some and , and consider some initial local time configuration , such that , , and , for , with . Note that by definition , and thus by Lemma 4.2 one has , for large enough. Using the continuous time-line construction of the VRRW (also called Rubin’s construction, see [T2, BSS]), we can couple the process reflected in and [math], say , with the process reflected in and , say , and Lemma 3.6 in [BSS] (see also [T2] for a similar result) tells us that . Applying this argument twice, we see that for large enough, with probability at least , one has both and finite. Then using Lemma 3.7 in [BSS], we deduce that for large enough (say larger than some ) the unreflected -VRRW on never visits sites and , with some positive probability.
Then we can see that the same holds for the -VRRW, since for any , with positive probability at time , we have , , and , and one can then apply the previous result at time . This proves in particular that , with positive probability.
Now it just remains to show that almost surely the walk visits only a finite number of sites. However, each time the VRRW on visits a new site , two cases may appear. If at this time the local time in is not larger than , then the process has some positive probability (depending only on ) to jump immediately to , and then to localize on the set and never come back to , by the above argument. If instead at this hitting time of , the local time in is larger than , then necessarily the local time in has to be also not smaller than , and we deduce by using again the above argument, that the process has some (constant) positive probability to never visit . Then the conditional Borel-Cantelli lemma (see Theorem 4.3.2 in [Dur]) shows that almost surely . By symmetry we also get that almost surely , and this concludes the proof of Theorem 1.2.
5. On the values of the parameters and .
Let us first observe that for any nondecreasing , and any , one has , and (which follows from the facts that , and ).
Now our aim here is to convince the reader that in most cases (and we believe this is true in fact for any nondecreasing weight function), one has:
[TABLE]
On one hand we prove in Lemma 5.1 that this is true for any weight function growing at least linearly and not faster than . On the other hand, we show in Lemma 5.2 that it holds as well for a large class of sublinear weights.
Now recall that one can restrict our attention to weights satisfying (2) and such that , since otherwise we already know the behavior of the process by the results of [BSS]. But it is also proved there that if , then is finite; thus the upper bound on , which is imposed in the hypotheses of Lemma 5.1 below is not a strong restriction.
Lemma 5.1**.**
Let be some nondecreasing weight function, such that
[TABLE]
If , then .
If , then .
Proof.
Assume first that . Let , be such that , and , for all large enough. Then at least for large enough,
[TABLE]
Now by definition, for any , and large enough,
[TABLE]
Thus using that , we get that for large enough,
[TABLE]
Combining this with (24), we get,
[TABLE]
for all large enough. Then by choosing , and using again that , the first assertion of the lemma follows.
Assume now that , so that for large enough . Then for large enough,
[TABLE]
Thus for large enough (and small enough),
[TABLE]
On the other hand, a similar argument as above shows that for any , for large enough,
[TABLE]
In particular, by taking small enough, we get that for large enough,
[TABLE]
and the second assertion of the lemma follows, using again that is positive. ∎
Our second result is concerned with sublinear weights.
Lemma 5.2**.**
Let be some nondecreasing weight function satisfying (2). If the two following conditions hold:
[TABLE]
and
[TABLE]
then . Moreover, if , then (25) holds.
Proof.
By using a change of variables, we can write for any , for some constant ,
[TABLE]
using the two hypotheses of the lemma. This implies that . Moreover, by (25), one has , for some constant , and all . It follows using (26) that , for some possibly larger , and all , and we deduce that as well.
Now if there exists , such that , for all , then for any ,
[TABLE]
which proves the second assertion of the lemma. ∎
Let us conclude this section by mentioning that by combining the results of [BSS2] with our Theorem 1.1, and the previous lemma, we obtain that any nondecreasing weight function , such that , for some satisfies . Indeed, we know from [BSS2], that for such weight localization on sites occurs with positive probability. Then Theorem 1.1 shows that is finite, and finally Lemma 5.2 gives that in fact . On the other hand, when , with , the results of [BSS2] show that , which imply . Observing that , and applying Lemma 5.2 gives .
Acknowledgments: I warmly thank an associate editor for his many comments, which helped correct some mistake and improve greatly the readability of the manuscript.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BSS] Basdevant A.L., Schapira Br., Singh A. Localization on 4 4 4 sites for Vertex Reinforced Random Walk on ℤ ℤ \mathbb{Z} , Ann. Probab. 42, (2014), 527–558.
- 2[BSS 2] Basdevant A.-L., Schapira Br., Singh A. Localization of a vertex reinforced random walk on ℤ ℤ \mathbb{Z} with sub-linear weight, Probab. Theory Related Fields 159, (2014), 75–115.
- 3[CK] Chen J., Kozma G. Vertex-reinforced random walk on ℤ ℤ \mathbb{Z} with sub-square-root weights is recurrent. C. R. Math. Acad. Sci. Paris 352, (2014), 521–524.
- 4[Dav] Davis B. Reinforced random walk, Probab. Theory Related Fields 84, (1990), 203–229.
- 5[Dur] Durrett R. Probability: theory and examples, Cambridge University Press, Cambridge, Fourth edition, (2010).
- 6[P] Pemantle R. Vertex-reinforced random walk, Probab. Theory Related Fields 92 (1992), 117–136.
- 7[PV] Pemantle R., Volkov S. Vertex-reinforced random walk on ℤ ℤ \mathbb{Z} has finite range, Ann. Probab. 27, (1999), 1368–1388.
- 8[Sch] Schapira Br. A 0 0 - 1 1 1 law for Vertex Reinforced Random Walk on ℤ ℤ \mathbb{Z} with weight of order k α superscript 𝑘 𝛼 k^{\alpha} , α < 1 / 2 𝛼 1 2 \alpha<1/2 , Electron. Commun. Probab. 17, (2012), no. 22, 8 pp.
