This work introduces the notion of edge oriented reinforced random walk which
proposes in a general framework an alternative understanding of the annealed
law of random walks in random environment.Comment: 5 page

Enriquez, N.

Sabot, C.

English

arXiv

Enriquez, Nathanaël

Sabot, Christophe

Numérisation de Documents Anciens Mathématiques

C. R. Acad. Sci. Paris, Ser. I 335 (2002) 941–946Probabilités/Probability TheorieEdge oriented reinforced random walks and RWRENathanaël Enriquez, Christophe SabotLaboratoire de probabilités de Paris 6, 4, place Jussieu, 75252 Paris cedex 05, FranceReceived 16 August 2002; accepted after revision 4 October 2002Note presented by Marc Yor.Abstract The aim of this text is to present, in a general framework, a precise and explicitcorrespondance between a class of edge oriented reinforced random walks and randomwalks in random environment.To cite this article: N. Enriquez, C. Sabot, C. R. Acad. Sci.Paris, Ser. I 335 (2002) 941–946. 2002 Académie des sciences/Éditions scientifiques et médicales Elsevier SASMarches aléatoires renforcées sur les arêtes orientées et marchesaléatoires en milieu aléatoireRésumé Le but de cet article est de présenter, dans un cadre général, une correspondance préciseet explicite entre une classe de marches aléatoires renforcées sur les arêtes orientées et lesmarches aléatoires en milieu aléatoire.Pour citer cet article : N. Enriquez, C. Sabot, C. R.Acad. Sci. Paris, Ser. I 335 (2002) 941–946. 2002 Académie des sciences/Éditions scientifiques et médicales Elsevier SASVersion française abrégéeDÉFINITION 1. – On appelle loi de renforcement àd voisins, la fonctionV :V : Zd+ → Td :={(x1, . . . , xd) ∈]0,1]d, s.t.,d∑i=1xi = 1},p = (p1, . . . , pd)→(V1( p), . . . , Vd( p)).On définit alors, pour une loi de renforcement, la notion d’admissibilité, qui jouera un rôle importantdans la suite. Soit(ei)1id la base canonique deZd+.DÉFINITION 2. – Considérons le grapheZd+ dont les arêtes( p, p + ei) sont orientées dep à p + ei .SoitV la loi de renforcement surZd+ etw la 1-forme définie parw(( p, p+ ei))= lnVi( p). On dira queVest admissible siw est une forme fermée.On considère maintenant un graphe dénombrableG ayant en chaque point un nombre fini de voisins.Étant donné un sommetx deG, on noted(x) le cardinal des voisins dex et {e(x, i), i = 1, . . . , d(x)}E-mail addresses:enriquez@ccr.jussieu.fr (N. Enriquez); sabot@ccr.jussieu.fr (C. Sabot). 2002 Académie des sciences/Éditions scientifiques et médicales Elsevier SAS. Tous droits réservésS1631-073X(02)02580-3/FLA 941N. Enriquez, C. Sabot / C. R. Acad. Sci. Paris, Ser. I 335 (2002) 941–946les voisins dex. En chaque sommet, on se donne une loi de renforcementV (x) à d(x) voisins :V (x) : p→ (Vi(x, p))1id(x).DÉFINITION 3. – On appelle marche aléatoire renforcée de loi de renforcementV (x), la marchealéatoire définie par la famille de loi sur les trajectoires partant dex0, (P̂x0)x0∈G donnée parP̂x0(Xn+1 = e(x, i)|σ(Xn = x)∧ σ(Xk, k  n− 1)) = Vi(x, N(x)),où N(x)= (Ni(x))1id(x) etNi(x)= ∑n−1l=0 1{Xl=x, Xl+1=e(x,i)}.DÉFINITION 4. – Une marche aléatoire renforcée est dite admissible siV (x) est admissible pour toutsommetx deG.Introduisons maintenant les marches aléatoires en milieu aléatoire sur le grapheG.On définit un environnement comme un élementω= (ω(x))x∈G où en chaque sommetx,ω(x) appartientà Td(x). En chaque sommetx deG, on considère une mesure de probabilitéµx sur Td(x) et l’on poseµ := ⊗x∈Gµx . µ est une mesure de probabilité sur les environnements telle que(ω(x))x∈G sont desvariables aléatoires indépendantes de loiµx .On notePx0,ω la loi de la chaîne de Markov dans l’environnementω, partant dex0, definie par :∀x0 ∈G, ∀k ∈ N, Px0,ω(Xk+1 = e(x, i)|Xk = x) = ω(x, i).Enfin, on notePx la mesure moyennée i.e.Px = µ⊗Px,ω. On peut alors énoncer le résultat principal :THÉORÈME 1. –Pour tout graphe dénombrableG,(i) Pour toute loi d’environnementµ = ⊗x∈Gµx la loi de la marche aléatoire renforcée(P̂x0)x0∈Gassociée à la loi de renforcementV donnée par:Vi(x,p1, . . . , pd(x))=Eµx[ω(x, i)∏d(x)j=1ω(x, j)pj]Eµx[∏d(x)j=1 ω(x, j)pj] (1)(oùEµx désigne l’espérance sous la loiµx ) coincide avec la loi moyennée de la marche aléatoire enmilieu aléatoire(Px0)x0∈G. De plus, la loi(V (x)) est admissible.(ii) Reciproquement, siV est une loi de renforcement admissible surG, alors il existe une unique loid’environnementµ= ⊗x∈Gµx pour laquelle(1) est satisfaite, i.e. pour laquelle la loi de la marchealéatoire renforcée(P̂x0)x0∈G coincide avec la loi moyennée(Px0)x0∈G.COROLLAIRE 1. –La loi moyennée détermine la loi de l’environnement.Remarque. – On remarque, qu’une loiV admissible satisfait la propriété intuitive de renforcement,à savoir : pour tout(i1, . . . , id) ∈ Nd , Vk(i1, . . . , ik + 1, . . . , id) Vk(i1, . . . , ik, . . . , id). C’est simplementune conséquence de (1) et de la positivité de la variance conditionnelle.La preuve de (i) est directe. La preuve de (ii) s’appuye sur le fait que dans le cas d’une marcherenforcée admissible, la suite des déplacements successifs depuis un sommet constitue une suite de variableséchangeables. On est ensuite dans les conditions d’application du théorème de de Finetti.1. IntroductionThe aim of this text is to present in a general framework a precise and explicit correspondance betweena class of edge oriented reinforced random walks and random walks in random environment (RWRE). The942To cite this article: N. Enriquez, C. Sabot, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 941–946significance of this result is that the study of edge oriented reinforced random walks, which is strongly non-Markovian, is equivalent by introducing an external randomness, to a Markovian problem. This relationalready appeared, as a tool, in a work of Pemantle (cf. [3]), for the study of reinforced random walks onbinary trees, for laws of reinforcement corresponding to a Polya’s urn scheme.The essence of the result is that the laws of edge oriented reinforced random walks coincide with theannealed laws of RWRE when the laws of reinforcement satisfy the following condition: the sequence ofsuccessive moves at a given vertex is exchangeable. This condition, which we call admissiblity, is expressedas the closedness of a certain discrete form.2. Definitions and statement of the resultDEFINITION 1. – We call law of reinforcement withd neighbours a functionV :V : Zd+ → Td :={(x1, . . . , xd) ∈]0,1]d, s.t.,d∑i=1xi = 1},p = (p1, . . . , pd)→(V1( p), . . . , Vd( p)).We now define for a law of reinforcement the notion of admissibility, which will play a key role in thefollowing. Let (ei)1id denote the canonical basis ofZd+.DEFINITION 2. – Let us consider the graphZd+ whose edges( p, p+ ei) are oriented fromp to p+ ei .LetV be a law of reinforcement onZd+ andw be the 1-form defined byw(( p, p+ ei))= lnVi( p). We shallsay thatV is admissible whenw is a closed form.We consider now a countable graphG having at any point a finite number of neighbours. For anyvertexx of G we denote byd(x) the cardinal of the neighbours ofx and{e(x, i), i = 1, . . . , d(x)} theneighbours ofx. At any vertex we suppose given a law of reinforcementV (x) with d(x) neighbours:V (x) : p→ (Vi(x, p))1id(x).DEFINITION 3. – We call reinforced random walk with law of reinforcementV (x), the random walkdefined by the family of laws on the trajectories starting atx0, (P̂x0)x0∈G given byP̂x0(Xn+1 = e(x, i)|σ(Xn = x)∧ σ(Xk, k  n− 1)) = Vi(x, N(x)),whereN(x)= (Ni(x))1id(x) and Ni(x)= n−1∑l=01{Xl=x,Xl+1=e(x,i)}.DEFINITION 4. – A reinforced random walk is called admissible whenV (x) is admissible for allvertexx of G.Let us now introduce random walks in random environment on the graphG.We define an environment as an elementω = (ω(x))x∈G where at any vertex, ω(x) is in Td(x). At anyvertexx of G, we consider a probability measureµx on Td(x) and we setµ := ⊗x∈Gµx , so thatµ is aprobability measure on the environments such that(ω(x))x∈G are independent random variables of lawµx .We denote byPx0,ω the law of the Markov chain in the environmentω starting atx0 defined by:∀x0 ∈G, ∀k ∈ N, Px0,ω(Xk+1 = e(x, i)|Xk = x) = ω(x, i).Finally, we denote byPx the annealed measure, i.e.,Px = µ⊗ Px,ω. We are now able to state our mainresult:943N. Enriquez, C. Sabot / C. R. Acad. Sci. Paris, Ser. I 335 (2002) 941–946THEOREM 1. –For any countable graphG,(i) For all law of environmentµ= ⊗x∈Gµx the law of the reinforced random walk(P̂x0)x0∈G associatedwith the law of reinforcementV given by:Vi(x,p1, . . . , pd(x))=Eµx[ω(x, i)∏d(x)j=1ω(x, j)pj]Eµx[∏d(x)j=1 ω(x, j)pj] (2)(whereEµx denotes the expectation under the lawµx ) coincides with the annealed law of the RWRE(Px0)x0∈G. Moreover the law(V (x)) is admissible.(ii) Reciproquely, ifV is an admissible law of reinforcement onG, then there exists a unique lawof environmentµ = ⊗x∈Gµx for which equality(2) is satisfied, thus for which the law of thereinforcement random walk(P̂x0)x0∈G coincides with the annealed law(Px0)x0∈G.COROLLARY 1. –The annealed law determines the quenched law for RWRE, i.e., there can not existtwo different laws of environmentµ andµ′ with the same annealed law(Px0)x0∈G.Remark. – It is interesting to note that an admissibleV satisfies the following intuitive property ofreinforcement, i.e., for any(i1, . . . , id) ∈ Nd , Vk(i1, . . . , ik + 1, . . . , id)  Vk(i1, . . . , ik, . . . , id). It is justa consequence of (2) and the positivity of a conditional variance.Proof. –(i) For any verticesx0, x of G, ∀1  i  d(x), ∀n ∈ N,Px0(Xn+1 = e(x, i)|(Xn = x)∧ σ(Xk, k  n− 1)) = Eµ[ω(x, i)∏y∈G∏d(y)j=1ω(y, j)Nj (y)]Eµ[∏y∈G∏d(y)j=1 ω(y, j)Nj (y)] ,whereNj (y) is as defined in Definition 3. Now using the independance of the variablesω(y, i) for differentverticesy, the terms depending onω(y, j) for y = x cancel in the previous ratio and we get (i). Finally, itis straightforward from (2) that such a law of reinforcement is admissible.(ii) The only point is to prove that for any admissible law of reinforcementV with d neigbours thereexists a probability measureµ on Td , such that aTd -valued random variableX := (X1, . . . ,Xd) of law µsatisfiesV (p1, . . . , pd)=E[Xi∏dj=1Xpjj]/E[∏dj=1Xpjj].The existence for this moment problem is actually equivalent to de Finetti’s theorem. Indeed, onecould show that the admissibility condition we introduced implies the exchangeability of the sequenceof successive moves under the natural probability measure induced byV . But for the convenience of thereader and because Corollary 1 is related to the uniqueness of the moment problem, we give an elementaryproof using Haussdorff theorem.We can see that the condition is expressed in terms of the moments ofµ, therefore the aim is to provethat the assumption of admissibility onV implies the solvability of the moment problem forµ.For that purpose we introduce the quantities which are intended to be the moments ofµ.Consider s ∈ {1, . . . , d}N and the pathU(s, ·) on Zd+ defined by:U(s,n) :=∑n−1i=0 es(i) and letM(s,n) := ∏n−1i=0 Vs(i)(U(s, i)).The fact thatV is admissible implies thatM(s,n) depends only onU(s,n), indeedM(s,n) =exp(∫ U(s,n)0 w) (with the notations of Definition 2). So let us introduce the sequence withd indices:vk1,...,kd :=M(s,n) for U(s,n)= k1e1 + · · · + kded .What remains to prove is thatv is the sequence of moments of aTd(x)-valued variable. For that purposewe use the generalization of the Hausdorff criterium, concerning the existence of a (unique) solution to themoment problem for random variables on[0,1]d . For anyh= h1, . . . , hd we define the operator h on real944Pour citer cet article : N. Enriquez, C. Sabot, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 941–946sequences indexed byZd+, i.e., h : RZd+ → RZd+ and defined recursively by ei (u)= (uk+ei − uk)k∈Zd+, and  k+ei = ei ◦ k.(Remark that this definition is valid since the ei ’s commute.) We recall here the result of Hildebrandtand Schoenberg (cf. [2]): a sequence(uk) ∈ [0,1]Zd+ is the moment sequence of a probability measureon [0,1]d , i.e.,uk =∫tk11 · · · tkdd dµ(t1, . . . , td ) if and only if for all h andk in Zd+, (−1)∑hi h(u)(k) ispositive.Let us verify this for the sequencevk introduced previously. Since for allk,∑di=1Vi(k)= 1 we have:− ei (v)(k)=d∑j=1j =ivk1,...,kj+1,...,kd .Hence, by composition(−1)h1+···+hd h1,...,hd (vk1,...,kd ) will always be a positive spanning of the terms ofthe sequencev. So the condition of the criterium is satisfied. Hence,µ exists and is unique as a solution ofthe moment problem whose support is compact. The last thing to check is that it is supported byTd . Let Xbe a random variable with lawµ. The only thing to check is that∑di=1Xi = 1 µ-almost surely. Since thelaw of∑di=1Xi has compact support this is equivalent to show that all the moments of∑di=1Xi are equalto 1. Using the fact that∑di=1Vi(k)= 1 at all pointk we know that for all integern1=∑s∈{1,...,d}nM(s,n)=∑k1+···+kd=n#{s ∈ {1, . . . , d}n, U(s, n)= (k1, . . . , kd)}vk1,...,kd=∑k1+···+kd=n(k1 + · · · + kd)!k1! · · ·kd ! vk1,...,kd ,and this last expression is then-th moment of(X1 + · · · +Xd). ✷The proof of Corollary 1 is straightforward from the uniqueness of the moment problem in the case ofcompactly supported measure.Example1. – At any pointx, choose a vector(α(x,1), . . . , α(x, d(x)) in (R∗+)d(x). The law of re-inforcementVi(x,p1, . . . , pd(x)) = (α(x, i)+ pi)/(∑d(x)j=0 α(x, j)+ pj ) is an admissible law of rein-forcement associated with the environment(µx)x∈G where µx is a Dirichlet law with parameters(α(x,1), . . . , α(x, d(x))), i.e.,µx is the law onTd(x) with densityµx(t1, . . . , td(x))= $(α(x,1)+ · · · + α(x, d(x))∏d(x)i=1 $(α(x, i))d(x)∏i=1tα(x,i)−1i .This is the meaning of the classical Polya’s urn scheme (cf. [1]), if we put at all sites an independent urnwhich will define the move at that site.Example2. – We can generalize the previous example as follows: at all pointx i G, choose not onlya vector(α(x,1), . . . , α(x, d(x)) ∈ (R∗+)d(x), but also an integern(x) and a homogeneous polynomial945N. Enriquez, C. Sabot / C. R. Acad. Sci. Paris, Ser. I 335 (2002) 941–946P(x, t1, . . . , td(x)) of degreen(x) of the form:P(x, t1, . . . , td(x))=∑k1,...,kd(x),k1+···+kd(x)=n(x)ak1,...,kd(x)(x)tk11 · · · tkd(x)d(x) ,where theak1,...,kd(x) (x)’s are non-negative reals (not all null). Then we defineµx as the law onTd(x) withdensityµx(t1, . . . , td(x))=(∏d(x)i=1 tα(x,i)−1i)P(x, t1, . . . , td(x))∫Td(x)(∏d(x)i=1 tα(x,i)−1i)P(x, t1, . . . , td(x)).On the other side, consider the polynomialsQ(x,y1, . . . , yd(x))=∑k1,...,kd(x),k1+···+kd(x)=n(x)ak1,...,kd(x) (x)d(x)∏i=1(yi, ki),where we write(y, k) for the producty · · · (y + k − 1). Then the law(µx) is associated with the law ofreinforcementV (x), whereVi(x,p1, . . . , pd(x)) is given by (to simplify, we forget thex dependance in thenext formula, and simply writeαi for α(x, i) andn for n(x))αi + pi(∑dj=1αj + pj) + n Q(α1 + p1, . . . , αi +pi + 1, . . . , αd + pd)Q(α1 + p1, . . . , αd + pd) .References[1] W. Feller, An Introduction to Probability Theory and its Applications, Vol. II, Wiley, New York, NY, 1950.[2] T.H. Hildebrandt, I.J. Schoenberg, On linear functional operators and the moment problem for a finite interval inone or several dimensions, Ann. Math. (2) 34 (1933) 317–328.[3] R. Pemantle, Phase transition in reinforced random walk and RWRE on trees, Ann. Probab. 16 (3) (1988) 1229–1241.946

Edge oriented reinforced random walks and RWRE

Nathanaël Enriquez

Christophe Sabot

Comptes Rendus Mathématique

Comptes Rendus Mathematique

The aim of this text is to present, in a general framework, a precise and explicit correspondance between a class of edge oriented reinforced random walks and random walks in random environment

CiteSeerX

http://www.numdam.org/item/10.1016/S1631-073X(02)02580-3.pdf

A note on edge oriented reinforced random walks and RWRE

Abstract

Similar works

Full text

Available Versions

Numérisation de Documents Anciens Mathématiques

Comptes Rendus Mathématique

CiteSeerX