Abstract
The aim of our work is to study vertex-reinforced jump processes with super-linear weight function , for some . On any complete graph , we prove that there is one vertex such that the total time spent at v almost surely tends to infinity while the total time spent at the remaining vertices is bounded.
Le but de notre travail est d’étudier les processus de sauts renforcés par sites par une fonction de poids sur-linéaire , avec . Sur tout graphe complet , on montre qu’il y a un sommet tel que le temps total passé en v tend presque sûrement vers l’infini tandis que le temps total passé dans les sommets restants est borné.
Acknowledgements
O. Raimond’s research has been conducted as part of the project Labex MME-DII (ANR11-LBX-0023-01) and of the project ANR MALIN (ANR-16-CE93-0003). T.M. Nguyen’s research is partially supported by Crafoord Foundation and Thorild Dahlgren & Folke Lannér Funds. The authors would like to thank the anonymous referees for their careful reading and their valuable suggestions which improved the manuscript.
Citation
Olivier Raimond. Tuan-Minh Nguyen. "Strongly vertex-reinforced jump process on a complete graph." Ann. Inst. H. Poincaré Probab. Statist. 57 (3) 1549 - 1568, August 2021. https://doi.org/10.1214/20-AIHP1115
Information