Senile reinforced random walks

M.P. Holmes; A. Sakai

doi:10.1016/j.spa.2007.02.003

Senile reinforced random walks

M.P. Holmes, A. Sakai

Statistiek - Stieltjes

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

5 Citaten (Scopus)

Samenvatting

We consider random walks with transition probabilities depending on the number of consecutive traversals n of the edge most recently traversed. Such walks may get stuck on a single edge, or have every vertex recurrent or every vertex transient, depending on the reinforcement function f(n) that characterizes the model. We prove recurrence/transience results when the walk does not get stuck on a single edge. We also show that the diffusion constant need not be monotone in the reinforcement.

Originele taal-2	Engels
Pagina's (van-tot)	1519-1539
Tijdschrift	Stochastic Processes and their Applications
Volume	117
Nummer van het tijdschrift	10
DOI's	https://doi.org/10.1016/j.spa.2007.02.003
Status	Gepubliceerd - 2007

Toegang tot document

10.1016/j.spa.2007.02.003

Vingerafdruk Duik in de onderzoeksthema's van 'Senile reinforced random walks'. Samen vormen ze een unieke vingerafdruk.

Citeer dit

@article{ff221202681a4de4b0f47914bee42a64,

title = "Senile reinforced random walks",

abstract = "We consider random walks with transition probabilities depending on the number of consecutive traversals n of the edge most recently traversed. Such walks may get stuck on a single edge, or have every vertex recurrent or every vertex transient, depending on the reinforcement function f(n) that characterizes the model. We prove recurrence/transience results when the walk does not get stuck on a single edge. We also show that the diffusion constant need not be monotone in the reinforcement.",

author = "M.P. Holmes and A. Sakai",

year = "2007",

doi = "10.1016/j.spa.2007.02.003",

language = "English",

volume = "117",

pages = "1519--1539",

journal = "Stochastic Processes and their Applications",

issn = "0304-4149",

publisher = "Elsevier",

number = "10",

}

TY - JOUR

T1 - Senile reinforced random walks

AU - Holmes, M.P.

AU - Sakai, A.

PY - 2007

Y1 - 2007

N2 - We consider random walks with transition probabilities depending on the number of consecutive traversals n of the edge most recently traversed. Such walks may get stuck on a single edge, or have every vertex recurrent or every vertex transient, depending on the reinforcement function f(n) that characterizes the model. We prove recurrence/transience results when the walk does not get stuck on a single edge. We also show that the diffusion constant need not be monotone in the reinforcement.

AB - We consider random walks with transition probabilities depending on the number of consecutive traversals n of the edge most recently traversed. Such walks may get stuck on a single edge, or have every vertex recurrent or every vertex transient, depending on the reinforcement function f(n) that characterizes the model. We prove recurrence/transience results when the walk does not get stuck on a single edge. We also show that the diffusion constant need not be monotone in the reinforcement.

U2 - 10.1016/j.spa.2007.02.003

DO - 10.1016/j.spa.2007.02.003

M3 - Article

VL - 117

SP - 1519

EP - 1539

JO - Stochastic Processes and their Applications

JF - Stochastic Processes and their Applications

SN - 0304-4149

IS - 10

ER -