Infinite WARM graphs III: strong reinforcement regime - UR1 - publications Maths-STIC Accéder directement au contenu
Article Dans Une Revue Nonlinearity Année : 2023

Infinite WARM graphs III: strong reinforcement regime

Christian Hirsch
Mark Holmes

Résumé

Abstract We study a reinforcement process on graphs G of bounded degree. The model involves a parameter α > 0 governing the strength of reinforcement, and Poisson clock rates λ v at the vertices v of the graph. When the Poisson clock at a vertex v rings, one of the edges incident to it is reinforced, with edge e being chosen with probability proportional to its current count (counts start from 1) raised to the power α . The main problem in such models is to describe the (random) subgraph , consisting of edges that are reinforced infinitely often. In this paper, we focus on the finite connected components of in the strong reinforcement regime ( α > 1) with clock rates that are uniformly bounded above. We show here that when α is sufficiently large, all connected components of are trees. When the firing rates λ v are constant, we show that all components are trees of diameter at most 3 when α is sufficiently large, and that there are infinitely many phase transitions as α ↓ 1 . For example, on the triangular lattice, increasingly large (odd) cycles appear as α ↓ 1 (while on the square lattice no finite component of contains a cycle for any α > 1). Increasingly long paths and other structures appear in both lattices when taking α ↓ 1 . In the special case where G = Z and α > 1, all connected components of are finite and we show that the possible cluster sizes are non-monotone in α . We also present several open problems.
Fichier principal
Vignette du fichier
hal-04116856.pdf (6.51 Mo) Télécharger le fichier
Origine : Publication financée par une institution

Dates et versions

hal-04116856 , version 1 (09-06-2023)

Identifiants

Citer

Christian Hirsch, Mark Holmes, Victor Kleptsyn. Infinite WARM graphs III: strong reinforcement regime. Nonlinearity, 2023, 36 (6), pp.3013-3042. ⟨10.1088/1361-6544/acc9a0⟩. ⟨hal-04116856⟩
16 Consultations
4 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More