14 pages, 3 figures.International audienceWe prove that the only nearest neighbor jump process with local dependence on the occupation times satisfying the partially exchangeable property is the vertex reinforced jump process, under some technical conditions (Theorem 4). This result gives a counterpart to the characterization of edge reinforced random walk given by Rolles [9]
We show transience of the edge-reinforced random walk for small reinforcement in dimension $d\ge3$. ...
Consider a vertex-reinforced jump process defined on a regular tree, where each vertex has exactly b...
Reinforced random walk (RRW) is a broad class of processes which jump between nearest neighbor verti...
14 pages, 3 figures.International audienceWe prove that the only nearest neighbor jump process with ...
We introduce a non-reversible generalization of the Vertex-Reinforced Jump Process (VRJP), which we ...
We introduce a non-reversible generalization of the Vertex-Reinforced Jump Process (VRJP), which we ...
We introduce a non-reversible generalization of the Vertex-Reinforced Jump Process (VRJP), which we ...
18 pagesInternational audienceEdge-reinforced random walk (ERRW), introduced by Coppersmith and Diac...
18 pagesInternational audienceEdge-reinforced random walk (ERRW), introduced by Coppersmith and Diac...
Reinforced random walks are processes whose future behavior is influenced by their history. A reinfo...
17 pagesWe define a generalisation of the Edge-Reinforced Random Walk (ERRW) introduced by Coppersmi...
17 pagesWe define a generalisation of the Edge-Reinforced Random Walk (ERRW) introduced by Coppersmi...
17 pagesWe define a generalisation of the Edge-Reinforced Random Walk (ERRW) introduced by Coppersmi...
Abstract. Edge-reinforced random walk (ERRW), introduced by Coppersmith and Diaconis in 1986 [5], is...
We show transience of the edge-reinforced random walk for small reinforcement in dimension $d\ge3$. ...
We show transience of the edge-reinforced random walk for small reinforcement in dimension $d\ge3$. ...
Consider a vertex-reinforced jump process defined on a regular tree, where each vertex has exactly b...
Reinforced random walk (RRW) is a broad class of processes which jump between nearest neighbor verti...
14 pages, 3 figures.International audienceWe prove that the only nearest neighbor jump process with ...
We introduce a non-reversible generalization of the Vertex-Reinforced Jump Process (VRJP), which we ...
We introduce a non-reversible generalization of the Vertex-Reinforced Jump Process (VRJP), which we ...
We introduce a non-reversible generalization of the Vertex-Reinforced Jump Process (VRJP), which we ...
18 pagesInternational audienceEdge-reinforced random walk (ERRW), introduced by Coppersmith and Diac...
18 pagesInternational audienceEdge-reinforced random walk (ERRW), introduced by Coppersmith and Diac...
Reinforced random walks are processes whose future behavior is influenced by their history. A reinfo...
17 pagesWe define a generalisation of the Edge-Reinforced Random Walk (ERRW) introduced by Coppersmi...
17 pagesWe define a generalisation of the Edge-Reinforced Random Walk (ERRW) introduced by Coppersmi...
17 pagesWe define a generalisation of the Edge-Reinforced Random Walk (ERRW) introduced by Coppersmi...
Abstract. Edge-reinforced random walk (ERRW), introduced by Coppersmith and Diaconis in 1986 [5], is...
We show transience of the edge-reinforced random walk for small reinforcement in dimension $d\ge3$. ...
We show transience of the edge-reinforced random walk for small reinforcement in dimension $d\ge3$. ...
Consider a vertex-reinforced jump process defined on a regular tree, where each vertex has exactly b...
Reinforced random walk (RRW) is a broad class of processes which jump between nearest neighbor verti...