Mean field systems on networks, with singular interaction through hitting times

Sergey Nadtochiy, Mykhaylo Shkolnikov

Research output: Contribution to journalArticlepeer-review

18 Scopus citations


Building on the line of work (Ann. Appl. Probab. 25 (2015) 2096-2133; Stochastic Process. Appl. 125 (2015) 2451-2492; Ann. Appl. Probab. 29 (2019) 89-129; Arch. Ration. Mech. Anal. 233 (2019) 643-699; Ann. Appl. Probab. 29 (2019) 2338-2373; Finance Stoch. 23 (2019) 535-594), we continue the study of particle systems with singular interaction through hitting times. In contrast to the previous research, we (i) consider very general driving processes and interaction functions, (ii) allow for inhomogeneous connection structures and (iii) analyze a game in which the particles determine their connections strategically. Hereby, we uncover two completely new phenomena. First, we characterize the "times of fragility" of such systems (e.g., the times when a macroscopic part of the population defaults or gets infected simultaneously, or when the neuron cells "synchronize") explicitly in terms of the dynamics of the driving processes, the current distribution of the particles' values and the topology of the underlying network (represented by its Perron-Frobenius eigenvalue). Second, we use such systems to describe a dynamic credit-network game and show that, in equilibrium, the system regularizes, that is, the times of fragility never occur, as the particles avoid them by adjusting their connections strategically. Two auxiliary mathematical results, useful in their own right, are uncovered during our investigation: a generalization of Schauder's fixed-point theorem for the Skorokhod space with the M1 topology, and the application of max-plus algebra to the equilibrium version of the network flow problem.

Original languageEnglish (US)
Pages (from-to)1520-1556
Number of pages37
JournalAnnals of Probability
Issue number3
StatePublished - 2020

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Statistics, Probability and Uncertainty


  • Cascades
  • Credit network game
  • Directed weighted graphs
  • Dynamic games
  • M1 topology
  • Max-plus algebra
  • Mean field games on graphs
  • Nash equilibrium
  • Network flow problem
  • Particle systems
  • Perron-frobenius eigenvalue
  • Regularization through a game
  • Schauder's fixed-point theorem
  • Self-excitation
  • Singular interaction through hitting times
  • Systemic risk
  • Times of fragility


Dive into the research topics of 'Mean field systems on networks, with singular interaction through hitting times'. Together they form a unique fingerprint.

Cite this