Vignette d'image

Benaim, Michel

Nom
Benaim, Michel
Affiliation principale
Fonction
Professeur ordinaire
Email
michel.benaim@unine.ch
Identifiants
https://libra.unine.ch/handle/123456789/457
_
0000-0003-0703-3107

Résultat de la recherche

Filtres

11
1
1
1
Réinitialiser les filtres

Paramètres

Voici les éléments 1 - 1 sur 1
  • Publication
    Accès libre
    Strongly Vertex-Reinforced-Random-Walk on the complete graph
    (2012-08-31T06:07:51Z)
    Benaim, Michel 
    ;
    Olivier Raimond
    ;
    Bruno Schapira
    We study Vertex-Reinforced-Random-Walk on the complete graph with weights of the form $w(n)=n^\alpha$, with $\alpha>1$. Unlike for the Edge-Reinforced-Random-Walk, which in this case localizes a.s. on 2 sites, here we observe various phase transitions, and in particular localization on arbitrary large sets is possible, provided $\alpha$ is close enough to 1. Our proof relies on stochastic approximation techniques. At the end of the paper, we also prove a general result ensuring that any strongly reinforced VRRW on any bounded degree graph localizes a.s. on a finite subgraph.