Hostname: page-component-74656f9884-rngvg Total loading time: 0 Render date: 2026-11-06T06:54:31.494Z Has data issue: false hasContentIssue false

Large-time behaviour and the second eigenvalue problem for finite-state mean-field interacting particle systems

Published online by Cambridge University Press:  08 July 2022

Sarath Yasodharan*
Affiliation:
Indian Institute of Science
Rajesh Sundaresan*
Affiliation:
Indian Institute of Science
*
*Postal address: Department of Electrical Communication Engineering, Indian Institute of Science, Bengaluru 560012, India.
*Postal address: Department of Electrical Communication Engineering, Indian Institute of Science, Bengaluru 560012, India.
Rights & Permissions [Opens in a new window]

Abstract

This article examines large-time behaviour of finite-state mean-field interacting particle systems. Our first main result is a sharp estimate (in the exponential scale) of the time required for convergence of the empirical measure process of the N-particle system to its invariant measure; we show that when time is of the order $\exp\{N\Lambda\}$ for a suitable constant $\Lambda > 0$, the process has mixed well and it is close to its invariant measure. We then obtain large-N asymptotics of the second-largest eigenvalue of the generator associated with the empirical measure process when it is reversible with respect to its invariant measure. We show that its absolute value scales as $\exp\{{-}N\Lambda\}$. The main tools used in establishing our results are the large deviation properties of the empirical measure process from its large-N limit. As an application of the study of large-time behaviour, we also show convergence of the empirical measure of the system of particles to a global minimum of a certain ‘entropy’ function when particles are added over time in a controlled fashion. The controlled addition of particles is analogous to the cooling schedule associated with the search for a global minimum of a function using the simulated annealing algorithm.

Information

Type
Original Article
Copyright
© The Author(s), 2022. Published by Cambridge University Press on behalf of Applied Probability Trust
Figure 0

Figure 1. An example of the hierarchy of cycles with $|L| = 9$ and $m = 2$ that illustrates the above definitions. There are four 1-cycles and two 2-cycles. The nodes in the bottom row represent the elements of L, and the nodes above it represent the hierarchy of cycles. Dashed and dotted lines indicate the $(k-1)$-cycles belonging to a k-cycle. Thick lines indicate the $(k-1)$-cycles that attain $\max_{\pi^{k-1} \in \pi^k} \tilde{V}\!\left(\pi^{k-1}\right)$ for a k-cycle $\pi^{k}$. Circles indicate the sets $A_k\!\left(\pi^{k+1}\right)$. Dashed lines indicate the cycle $\pi^{k-1}\notin A_{k-1}\!\left(\pi^k\right)$ that attains the maximum in the second line in the definition of $c_{k-1}\!\left(\pi^k\right)$; $c_0\big(\pi_1^1\big) = 0$ (which is not indicated in the figure), and all other $c_{k-1}\!\left(\pi^k\right)$ are positive.