Hostname: page-component-74656f9884-8rzl6 Total loading time: 0 Render date: 2026-11-05T22:11:17.687Z Has data issue: false hasContentIssue false

Propagation of chaos and large deviations in mean-field models with jumps on block-structured networks

Published online by Cambridge University Press:  05 June 2023

Donald A. Dawson*
Affiliation:
Carleton University
Ahmed Sid-Ali*
Affiliation:
Carleton University
Yiqiang Q. Zhao*
Affiliation:
Carleton University
*
*Postal address: School of Mathematics and Statistics, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario K1S 5B6, Canada.
*Postal address: School of Mathematics and Statistics, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario K1S 5B6, Canada.
*Postal address: School of Mathematics and Statistics, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario K1S 5B6, Canada.
Rights & Permissions [Opens in a new window]

Abstract

A system of interacting multi-class finite-state jump processes is analyzed. The model under consideration consists of a block-structured network with dynamically changing multi-color nodes. The interactions are local and described through local empirical measures. Two levels of heterogeneity are considered: between and within the blocks where the nodes are labeled into two types. The central nodes are those connected only to nodes from the same block, whereas the peripheral nodes are connected to both nodes from the same block and nodes from other blocks. Limits of such systems as the number of nodes tends to infinity are investigated. In particular, under specific regularity conditions, propagation of chaos and the law of large numbers are established in a multi-population setting. Moreover, it is shown that, as the number of nodes goes to infinity, the behavior of the system can be represented by the solution of a McKean–Vlasov system. Then, we prove large deviations principles for the vectors of empirical measures and the empirical processes, which extends the classical results of Dawson and Gärtner (Stochastics 20, 1987) and Léonard (Ann. Inst. H. Poincaré Prob. Statist. 31, 1995).

Information

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

Figure 1. Example of a block-structured graph with a complete peripheral subgraph. Here we have a 4-block-structured graph linked by a set of peripheral nodes. For the first block, the set of central nodes is $C_1^c=\{1,2\}$ and the set of peripheral nodes is $C_1^p=\{3,4\}$. The set of all peripheral nodes of the graph is given by the set of nodes $C^p=\{3,4,5,10,11,14,18\}$.