pith. sign in

arxiv: 2502.04280 · v3 · submitted 2025-02-06 · 🧮 math.PR

Mean-Field Analysis of Latent Variable Process Models on Dynamically Evolving Graphs with Feedback Effects

Ankan Ganguly , Konstantinos Spiliopoulos , Daniel Sussman This is my paper

Pith reviewed 2026-05-23 03:59 UTC · model grok-4.3

classification 🧮 math.PR
keywords mean-field limitlatent space networksdynamic graphspropagation of chaosgraphonco-evolving processesconditional independencesocial dynamics
0
0 comments X

The pith

Dynamic latent space networks with bi-directional feedback converge in distribution to a conditional limiting model as the number of nodes diverges.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper examines models in which agents hold opinions that evolve as stochastic processes while their interaction network changes over time, with mutual influence between opinions and connections, dependence on past network states, and only local information available to each agent. It establishes that a randomly sampled agent from such a network approaches a well-defined limiting probabilistic object that encodes the conditional dependence between the latent opinion process and the network evolution. This limiting object then determines the large-n behavior of the overall opinion distribution, the joint opinion-network statistics, and the connectivity pattern summarized by the graphon. The derivation relies on a general conditional propagation of chaos property proved for the class. Readers interested in social or opinion dynamics would care because the limit supplies a tractable description of macroscopic behavior in very large systems without requiring simulation of every individual agent.

Core claim

We characterize the distributional limit of a random sample taken from the latent space network as the number of nodes in the network diverges. We describe the rich conditional probabilistic structure of the resulting limiting model which we use to establish the limiting behavior of the empirical measure of the latent process, a conditional empirical measure relating the latent process to the network process and the network process graphon. In proving our main results, we derive a general conditional propagation of chaos result, which is of independent interest.

What carries the argument

The conditional propagation of chaos result, which yields independence of sampled processes conditional on the limiting empirical measures and graphon.

If this is right

  • The empirical measure of the latent process converges to the marginal law of the limiting latent process.
  • The conditional empirical measure relating the latent process to the network process converges to its limiting counterpart.
  • The network process graphon converges to the graphon of the limiting model.
  • The asymptotic behavior of the full system is completely determined by the conditional structure of the limiting model.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same conditional-propagation technique can be applied to other particle systems in which state variables and interaction structure co-evolve.
  • Large-scale numerical studies of opinion dynamics can be replaced by solving the lower-dimensional limiting equations derived from the conditional model.
  • The separation between marginal and conditional measures allows independent study of opinion evolution and network evolution while retaining their coupling.

Load-bearing premise

The models belong to the generic class featuring bi-directional feedback, persistence in the network, and localized interactions, and the processes satisfy the technical conditions needed for the mean-field limit and conditional propagation of chaos.

What would settle it

For any concrete model in the class, compute the empirical measures of the latent process, the conditional measure, and the graphon at successively larger finite n and verify whether they approach the quantities predicted by the limiting conditional model.

Figures

Figures reproduced from arXiv: 2502.04280 by Ankan Ganguly, Daniel Sussman, Konstantinos Spiliopoulos.

Figure 1
Figure 1. Figure 1: The Mean Square Error of the mean-field approximation of the particle trajectories [PITH_FULL_IMAGE:figures/full_fig_p018_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: The density of edges in the symmetric difference network [PITH_FULL_IMAGE:figures/full_fig_p019_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: In Figures 3(a)-(c), we examine the average error we would find if we tried to approximate [PITH_FULL_IMAGE:figures/full_fig_p020_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: The average difference in the 2nd largest eigenvalue of the mean-field model and the [PITH_FULL_IMAGE:figures/full_fig_p021_4.png] view at source ↗
read the original abstract

We study the mean-field limit of a generic class of dynamic co-evolving latent space networks motivated by the social and opinion dynamics literature. Such models include $n$ agents, whose opinions are given by latent stochastic processes, and a dynamic network process describing agent interactions. Models in this class incorporate (a) bi-directional feedback between the latent processes and the network process, (b) persistence effects, meaning that the network structure at the current time depends on the value of the latent processes at the current time but also on the network structure at the previous time instance and (c) localized interactions, meaning that individual agents do not have global information. We characterize the distributional limit of a random sample taken from the latent space network as the number of nodes in the network diverges. We describe the rich conditional probabilistic structure of the resulting limiting model which we use to establish the limiting behavior of the following quantities: (i) the empirical measure of the latent process, (ii) a conditional empirical measure relating the latent process to the network process and (iii) the network process graphon. In proving our main results, we derive a general conditional propagation of chaos result, which is of independent interest. Our novel approach to studying the limiting behavior of random samples proves to be a very useful methodology for fully grasping the asymptotic behavior of co-evolving particle systems. Numerical results are included to illustrate the theoretical findings.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper studies the mean-field limit of a generic class of dynamic co-evolving latent space networks with bi-directional feedback between latent processes and the network process, persistence effects in the network structure, and localized interactions. It characterizes the distributional limit of a random sample from the latent space network as n diverges, describes the conditional probabilistic structure of the limit, and establishes the limiting behavior of the empirical measure of the latent process, a conditional empirical measure relating latent and network processes, and the network process graphon. The proofs rely on deriving a general conditional propagation of chaos result of independent interest.

Significance. If the technical conditions for well-posedness under bi-directional feedback are supplied and verified, the work would provide a useful rigorous framework for asymptotic analysis of co-evolving particle systems in social and opinion dynamics models. The conditional propagation of chaos result could have broader applicability, and the numerical illustrations support the theoretical claims.

major comments (2)
  1. [Main results / Theorem on conditional PoC (likely §3–4)] The central claim relies on a 'general conditional propagation of chaos' result for models with bi-directional feedback (abstract and main theorems). Standard arguments do not automatically yield a well-posed fixed-point problem for the joint limit of the latent empirical measure and graphon evolution; explicit hypotheses such as uniform Lipschitz bounds on the feedback maps or contraction conditions in a suitable Wasserstein/Skorokhod space are required for existence and uniqueness but appear unstated in the hypotheses.
  2. [Assumptions and technical conditions section] The persistence term in the network process requires moment controls that survive the feedback loop to close the propagation of chaos; without these, the claim that the models belong to the stated generic class does not guarantee the limiting object is well-defined (abstract, weakest assumption paragraph).
minor comments (1)
  1. [Section describing the limiting model] Notation for the conditional empirical measure and graphon limit could be clarified with an explicit diagram or table of the limiting objects.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive comments on the technical conditions needed for well-posedness. We address the two major comments point by point below and will revise the manuscript to incorporate the requested clarifications.

read point-by-point responses

  1. Referee: The central claim relies on a 'general conditional propagation of chaos' result for models with bi-directional feedback (abstract and main theorems). Standard arguments do not automatically yield a well-posed fixed-point problem for the joint limit of the latent empirical measure and graphon evolution; explicit hypotheses such as uniform Lipschitz bounds on the feedback maps or contraction conditions in a suitable Wasserstein/Skorokhod space are required for existence and uniqueness but appear unstated in the hypotheses.

    Authors: We agree that explicit conditions are necessary to guarantee existence and uniqueness of the joint limit. The current hypotheses in Section 2 impose regularity on the kernels but do not isolate the uniform Lipschitz and contraction requirements in Wasserstein-Skorokhod distance. In the revision we will add a dedicated paragraph (or subsection) stating these hypotheses explicitly and sketch the contraction mapping argument that closes the fixed-point problem for the pair (empirical measure, graphon). revision: yes

  2. Referee: The persistence term in the network process requires moment controls that survive the feedback loop to close the propagation of chaos; without these, the claim that the models belong to the stated generic class does not guarantee the limiting object is well-defined (abstract, weakest assumption paragraph).

    Authors: The generic class is introduced with integrability assumptions on the latent processes, yet these do not automatically propagate through the bi-directional feedback when persistence is present. We will strengthen the assumption paragraph to include uniform moment bounds (e.g., sup_n E[sup_t |X_t^n|^p] < ∞ for p > 1) that are preserved by the feedback maps, thereby ensuring the limiting objects remain well-defined. revision: yes

Circularity Check

0 steps flagged

No circularity: standard mean-field limit theorem resting on external assumptions

full rationale

The paper derives distributional limits and a conditional propagation of chaos result for co-evolving latent processes and graphons under bi-directional feedback, persistence, and localized interactions. The abstract and description frame this as a limit theorem whose validity depends on stated technical conditions for the mean-field limit and PoC to hold; no equations, parameters, or uniqueness claims are shown to reduce to fitted inputs or self-referential definitions by construction. No load-bearing self-citations, ansatzes smuggled via prior work, or renaming of known results appear in the provided material. This matches the default expectation of a non-circular derivation chain for such probabilistic limit papers.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on standard existence/uniqueness assumptions for the underlying stochastic processes and on the model class satisfying the listed structural properties (feedback, persistence, locality). No free parameters or invented entities are introduced in the abstract.

axioms (1)
  • domain assumption The latent processes and network process satisfy conditions allowing the mean-field limit and conditional propagation of chaos to exist
    Invoked to justify convergence of the empirical measures and graphon.

pith-pipeline@v0.9.0 · 5788 in / 1236 out tokens · 93626 ms · 2026-05-23T03:59:43.246332+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

87 extracted references · 87 canonical work pages · 1 internal anchor

  1. [1]

    Romain Abraham, Jean-Fran¸ cois Delmas, and Julien Weibel,Probability-graphons: Limits of large dense weighted graphs (2023), available at arXiv:2312.15935

    work page arXiv 2023

  2. [2]

    Political Econ

    Frankin Allen and Douglas Gale, Financial Contagion, J. Political Econ. 108 (2000), 1–33. https://doi.org/ 10.1086/262109

    work page doi:10.1086/262109 2000

  3. [3]

    Avanti Athreya, Donniell E Fishkind, Minh Tang, Carey E Priebe, Youngser Park, Joshua T Vogelstein, Keith Levin, Vince Lyzinski, Yichen Qin, and Daniel L Sussman, Statistical inference on random dot product graphs: a survey, J. Mach. Learn. Res. 18 (2018), no. 226, 1–92. http://jmlr.org/papers/v18/17-448.html

    work page 2018

  4. [4]

    Luca Avena, Rangel Baldasso, Rajat Subhra Hazra, Frank den Hollander, and Matteo Quattropani, The voter model on random regular graphs with random rewiring (2025), available at arXiv:2501.08703

    work page arXiv 2025

  5. [5]

    Simone Baldassarri, Peter Braunsteins, Frank den Hollander, and Michel Mandjes, Opinion dynamics on dense dynamic random graphs (2024), available at arXiv:2410.14618v2

    work page arXiv 2024

  6. [6]

    Abhijit V Banerjee, A simple model of herd behavior , Q. J. Econ. 107 (1992), no. 3, 797–817. https://doi.org/ 10.2307/2118364

    work page doi:10.2307/2118364 1992

  7. [7]

    Riddhipratim Basu and Allan Sly, Evolving voter model on dense random graphs , Ann. Appl. Probab. 27 (2017), no. 2, 1235–1288. https://doi.org/10.1214/16-AAP1230. 62

    work page doi:10.1214/16-aap1230 2017

  8. [8]

    Erhan Bayraktar, Suman Chakraborty, and Ruoyu Wu, Graphon mean field systems , Ann. Appl. Probab. 33 (2023), no. 5, 3587 –3619. https://doi.org/10.1214/22-AAP1901

    work page doi:10.1214/22-aap1901 2023

  9. [9]

    Erhan Bayraktar and Ruoyu Wu, Mean field interaction on random graphs with dynamically changing multi-color edges, Stoch. Process. their Appl. 141 (2021), 197–244. https://doi.org/10.1016/j.spa.2021.07.005

    work page doi:10.1016/j.spa.2021.07.005 2021

  10. [10]

    , Stationarity and uniform in time convergence for the graphon particle system , Stoch. Process. their Appl. 150 (2022), 532–568. https://doi.org/10.1016/j.spa.2022.04.006

    work page doi:10.1016/j.spa.2022.04.006 2022

  11. [11]

    Shankar Bhamidi, Amarjit Budhiraja, and Rouyu Wu, Weakly interacting particle systems on inhomogeneous random graphs, Stoch. Process. their Appl. 129 (2019), no. 6, 2174–2206. https://doi.org/10.1016/j.spa. 2018.06.014

    work page doi:10.1016/j.spa 2019

  12. [12]

    Peter J Bickel and Purnamrita Sarkar, Hypothesis testing for automated community detection in networks , J. R. Stat. Soc., Ser. B: Stat. Methodol. 78 (2016), no. 1, 253–273. https://academic.oup.com/jrsssb/article/78/ 1/253/7040688

    work page 2016

  13. [13]

    (V Barnett Et al., ed.), Wiley Series in Proba- bility and Statistics, John Wiley & Sons, inc, 1999

    Patrick Billingsley, Convergence of Probability Measures, 2nd ed. (V Barnett Et al., ed.), Wiley Series in Proba- bility and Statistics, John Wiley & Sons, inc, 1999

    work page 1999

  14. [14]

    1-2, Springer-Verlag, Berlin Heidelberg, 2007

    Vladimir I Bogachev, Measure Theory, 1st ed., Vol. 1-2, Springer-Verlag, Berlin Heidelberg, 2007

    work page 2007

  15. [15]

    Christian Borgs, Jennifer T Chayes, L´ aszl´ o Lov´ asz, Vera T S´ os, and Katalin Vesztergombi,Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing , Adv. Math. 219 (2008), no. 6, 1801–1851. https://doi.org/10.1016/j.aim.2008.07.008

    work page doi:10.1016/j.aim.2008.07.008 2008

  16. [16]

    Multiway cuts and statistical physics , Ann

    , Convergent sequences of dense graphs II. Multiway cuts and statistical physics , Ann. Math. 176 (2012), no. 1, 151–219. https://doi.org/10.4007/annals.2012.176.1.2

    work page doi:10.4007/annals.2012.176.1.2 2012

  17. [17]

    Theory Relat

    Michelle Bou´ e, Paul Dupuis, and Richard S Ellis,Large deviations for small noise diffusions with discontinuous statistics, Probab. Theory Relat. Fields 116 (2000), 125–149. https://doi.org/10.1007/PL00008720

    work page doi:10.1007/pl00008720 2000

  18. [18]

    Peter Braunsteins, Frank den Hollander, and Michel Mandjes, Graphon-valued processes with vertex-level fluctu- ations (2022), 1–41 pp., available at arXiv:2209.01544v1

    work page arXiv 2022

  19. [19]

    , A sample-path large deviation principle for dynamic Erd˝ os–R´ enyi random graphs, Ann. Appl. Probab. 33 (2023), no. 4, 3278 –3320. https://doi.org/10.1214/22-AAP1892

    work page doi:10.1214/22-aap1892 2023

  20. [20]

    Amarjit Budhiraja, Debankur Mukherjee, and Ruoyu Wu, Supermarket model on graphs , Ann. Appl. Probab. 29 (2019), no. 3, 1740–1777. https://doi.org/10.1214/18-AAP1437

    work page doi:10.1214/18-aap1437 2019

  21. [21]

    Control Optim

    Peter E Caines and Minyi Huang, Graphon mean field games and their equations , SIAM J. Control Optim. 59 (2021), no. 6, 4373–4399. https://doi.org/10.1137/20M136373X

    work page doi:10.1137/20m136373x 2021

  22. [22]

    Louis-Pierre Chaintron and Antoine Diez, Propagation of chaos: A review of models, methods and applications. I. Models and methods, Kinet. Relat. Models 15 (2022), no. 6, 895–1015. https://doi.org/10.3934/krm.2022017

    work page doi:10.3934/krm.2022017 2022

  23. [23]

    , Propagation of chaos: A review of models, methods and applications. II. Applications , Kinet. Relat. Models 15 (2022), no. 6, 1017–1173. https://doi.org/10.3934/krm.2022018

    work page doi:10.3934/krm.2022018 2022

  24. [24]

    Fan Chen, Sebastien Roch, Karl Rohe, and Shuqi Yu,Estimating graph dimension with cross-validated eigenvalues (2021), available at arXiv:2108.03336

    work page arXiv 2021

  25. [25]

    3, 581–588

    Peter Clifford and Aidan Sudbury, A model for spatial conflict , Biometrika 60 (1973), no. 3, 581–588. https: //doi.org/10.2307/2335008

    work page doi:10.2307/2335008 1973

  26. [26]

    Fabio Coppini, Helge Dietert, and Giambattista Giacomin, A law of large numbers and large deviations for interacting diffusions on Erd¨ os-R´ enyi graphs, Stoch. Dyn. 20 (2020), no. 2. https://doi.org/10.1142/ S0219493720500100

    work page 2020

  27. [27]

    https: //doi.org/10.1016/j.neucom.2016.02.031

    Marco Corneli, Pierre Latouche, and Fabrice Rossi, Exact ICL maximization in a non-stationary temporal extension of the stochastic block model for dynamic networks , Neurocomputing 192 (2016), 81–91. https: //doi.org/10.1016/j.neucom.2016.02.031

    work page doi:10.1016/j.neucom.2016.02.031 2016

  28. [28]

    Complex Syst

    Guillaume Deffuant, David Neau, Fr´ ed´ eric Amblard, and G´ erard Weisbuch,Mixing beliefs among interacting agents, Adv. Complex Syst. 3 (2000), 87–98. https://doi.org/10.1142/S0219525900000078

    work page doi:10.1142/s0219525900000078 2000

  29. [29]

    Eugene Stanley, and Walter Quattrociocchi, Modeling confirmation bias and polarization , Sci

    Michela Del Vicario, Antonio Scala, Guido Caldarelli, H. Eugene Stanley, and Walter Quattrociocchi, Modeling confirmation bias and polarization , Sci. Rep. 7 (2017), no. 1, 40391. https://doi.org/10.1038/srep40391

    work page doi:10.1038/srep40391 2017

  30. [30]

    Sylvain Delattre, Giambattista Giacomin, and Eric Lu¸ con, A note on dynamical models on random graphs and Fokker–Planck equations , J. Stat. Phys. 165 (2016), no. 4, 785–798. https://doi.org/10.1007/ s10955-016-1652-3 . 63

    work page 2016

  31. [31]

    Marjorie B Douglis, Social factors influencing the hierarchies of small flocks of the domestic hen: interactions between resident and part-time members of organized flocks , Physiol. Zool. 21 (1948), no. 2, 147–182. https: //doi.org/10.1086/physzool.21.2.30151991

    work page doi:10.1086/physzool.21.2.30151991 1948

  32. [32]

    Richard Durrett, Probability: Theory and Examples , Cambridge Series in Statistical and Probabilistic Mathe- matics, Cambridge University Press, 2019

    work page 2019

  33. [33]

    Rick Durrett and Dong Yao, Susceptible–infected epidemics on evolving graphs , Electron. J. Probab. 27 (2022), 1 –66. https://doi.org/10.1214/22-EJP828

    work page doi:10.1214/22-ejp828 2022

  34. [34]

    Larry Eisenberg and Thomas H Noe, Systemic risk in financial systems , Manag. Sci. 47 (2001), no. 2, 236–249. https://doi.org/10.1287/mnsc.47.2.236.9835

    work page doi:10.1287/mnsc.47.2.236.9835 2001

  35. [35]

    Matrix Anal

    Donniell E Fishkind, Daniel L Sussman, Minh Tang, Joshua T Vogelstein, and Carey E Priebe, Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown , SIAM J. Matrix Anal. Appl. 34 (2013), no. 1, 23–39. https://doi.org/10.1137/120875600

    work page doi:10.1137/120875600 2013

  36. [36]

    Gerald B Folland, Real Analysis: Modern Techniques and Their Applications , 2nd ed., Wiley, 1999

    work page 1999

  37. [37]

    Seth Frey and Robert L Goldstone, Cognitive mechanisms for human flocking dynamics , J. Comput. Soc. Sci. 1 (2018), no. 2, 349–375. https://doi.org/10.1007/s42001-018-0017-x

    work page doi:10.1007/s42001-018-0017-x 2018

  38. [38]

    Daniel Fricke and Thomas Lux, Core-periphery structure in the overnight money market: Evidence from e-MID trading platform, Comput. Econ. 45 (2015), 359–395. https://doi.org/10.1007/s10614-014-9427-x

    work page doi:10.1007/s10614-014-9427-x 2015

  39. [39]

    Noah E Friedkin and Eugene C Johnsen, Social influence and opinions , J. Math. Sociol. 15 (1990), no. 3-4, 193–206. https://doi.org/10.1080/0022250X.1990.9990069

    work page doi:10.1080/0022250x.1990.9990069 1990

  40. [40]

    Josselin Garnier, George Papanicolaou, and Tzu-Wei Yang, Consensus convergence with stochastic effects, Viet- nam J. Math. 45 (2017), 51–75. https://doi.org/10.1007/s10013-016-0190-2

    work page doi:10.1007/s10013-016-0190-2 2017

  41. [41]

    J¨ urgen G¨ artner,On the Mckean-Vlasov limit for interacting diffusions , Math. Nachr. 137 (1988), 197–248. https://doi.org/10.1002/mana.19881370116

    work page doi:10.1002/mana.19881370116 1988

  42. [42]

    Kay Giesecke, Konstantinos Spiliopoulos, and Richard Sowers, Default clustering in large portfolios: Typical events, Ann. Appl. Probab. 23 (2013), no. 1, 348–385. https://doi.org/10.1214/12-AAP845

    work page doi:10.1214/12-aap845 2013

  43. [43]

    Steve Hanneke, Wenjie Fu, and Eric P Xing, Discrete temporal models of social networks , Electron. J. Stat. 4 (2010), 585–605. https://doi.org/10.1214/09-EJS548

    work page doi:10.1214/09-ejs548 2010

  44. [44]

    Rainer Hegselmann and Ulrich Krause, Opinion dynamics and bounded confidence: models, analysis and simu- lation, J. Artif. Soc. Soc. Simul. 5 (2002), no. 3, 1–33. https://www.jasss.org/5/3/2.html

    work page 2002

  45. [45]

    Kenneth Hoffman, Analysis in Euclidean Space , Prentice-Hall, 1975

    work page 1975

  46. [46]

    Richard A Holley and Thomas M Liggett, Ergodic theorems for weakly interacting infinite systems and the voter model, Ann. Probab. 3 (1975), no. 4, 643–663. https://doi.org/10.1214/aop/1176996306

    work page doi:10.1214/aop/1176996306 1975

  47. [47]

    Samuel A Isaacson, Jingei Ma, and Konstantinos Spiliopoulos, Mean field limits of particle-based stochastic reaction-diffusion models, SIAM J. Math. Anal. 54 (2022), 453–511. https://doi.org/10.1137/20M1365600

    work page doi:10.1137/20m1365600 2022

  48. [48]

    Vassili N Kolokoltsov, Nonlinear Markov Processes and Kinetic Equations , Cambridge Tracts in Mathematics, Cambridge University Press, 2010

    work page 2010

  49. [49]

    Varma, and Antoine O

    Emmanuel Kravitzch, Yezekael Hayel, Vineeth S. Varma, and Antoine O. Berthet, Stability analysis of a socially inspired adaptive voter model , IEEE Control Syst. Lett. 7 (2023), 175–180. https://doi.org/10.1109/LCSYS. 2022.3185386

    work page doi:10.1109/lcsys 2023

  50. [50]

    Pavel N Krivitsky and Mark S Handcock, A separable model for dynamic networks , J. R. Stat. Soc., Ser. B: Stat. Methodol. 76 (2014), no. 1, 29. https://doi.org/10.1111/rssb.12014

    work page doi:10.1111/rssb.12014 2014

  51. [51]

    Thomas G Kurtz, Solutions of ordinary differential equations as limits of pure jump Markov processes , J. of Appl. Probab. 7 (1970), no. 1, 49–58. https://doi.org/10.2307/3212147

    work page doi:10.2307/3212147 1970

  52. [52]

    , Limit theorems for sequences of jump Markov processes approximating ordinary differential processes , J. of Appl. Probab. 8 (1971), no. 2, 344–356. https://doi.org/10.2307/3211904

    work page doi:10.2307/3211904 1971

  53. [53]

    60, American Mathematical Society, 2012

    L´ aszl´ o Lov´ asz,Large Networks and Graph Limits , Colloquium Publications, vol. 60, American Mathematical Society, 2012

    work page 2012

  54. [54]

    L´ aszl´ o Lov´ asz and Bal´ azs Szegedy,Limits of dense graph sequences , J. Comb. Theory, B 96 (2006), no. 6, 933–

    work page 2006

  55. [55]

    https://doi.org/10.1016/j.jctb.2006.05.002

    work page doi:10.1016/j.jctb.2006.05.002 2006

  56. [56]

    , Limits of compact decorated graphs (2010), available at arXiv:1010.5155. 64

    work page internal anchor Pith review Pith/arXiv arXiv 2010

  57. [57]

    Joshua Daniel Loyal and Yuguo Chen, An eigenmodel for dynamic multilayer networks , J. Mach. Learn. Res. 24 (2023), no. 128, 1–69. http://jmlr.org/papers/v24/21-0270.html

    work page 2023

  58. [58]

    James MacLaurin, The hydrodynamic limit of hawkes processes on adaptive stochastic networks (2024), available at arXiv:2411.09260

    work page arXiv 2024

  59. [59]

    Andrew J Majda, Cristian Franzke, and Boualem Khouider, An applied mathematics perspective on stochastic modelling for climate , Philos. Trans. R. Soc. A: Math., Phys. Eng. Sci. 366 (2008), 2427–2453. https://doi. org/10.1098/rsta.2008.0012

    work page doi:10.1098/rsta.2008.0012 2008

  60. [60]

    Antonis Matakos, Evimaria Terzi, and Panayiotis Tsaparas, Measuring and moderating opinion polariza- tion in social networks , Data Min. Knowl. Discov. 31 (2017), no. 5, 1480–1505. https://doi.org/10.1007/ s10618-017-0527-9

    work page 2017

  61. [61]

    Catherine Matias and Vincent Miele, Statistical clustering of temporal networks through a dynamic stochastic block model, J. R. Stat. Soc., Ser. B: Stat. Methodol. 79 (2017), 1119–1141. https://doi.org/10.1111/rssb. 12200

    work page doi:10.1111/rssb 2017

  62. [62]

    Henry P McKean, A class of Markov processes associated with nonlinear parabolic equations , Proc. Natl. Acad. Sci. U. S. A. 56 (1966), no. 6, 1907–1911. https://doi.org/10.1073/pnas.56.6.1907

    work page doi:10.1073/pnas.56.6.1907 1966

  63. [63]

    Karl Oelschl¨ ager,A martingale approach to the law of large numbers for weakly interacting stochastic processes , Ann. Probab. 12 (1984), no. 2, 458–479. https://doi.org/10.1214/aop/1176993301

    work page doi:10.1214/aop/1176993301 1984

  64. [64]

    Roberto I Oliveira and Guilherme H Reis, Interacting diffusions on random graphs with diverging average degrees: hydrodynamics and large deviations , J. Stat. Phys. 176 (2019), no. 5, 1057–1087. https://doi.org/10.1007/ s10955-019-02332-1

    work page 2019

  65. [65]

    Hancong Pan, Xiaojing Zhu, Cantay Caliskan, Dino P Christenson, Konstantinos Spiliopoulos, Dylan Walker, and Eric D Kolaczyk, Stochastic gradient descent-based inference for dynamic network models with attractors , J. Comput. Graph. Stat. (2025). https://doi.org/10.1080/10618600.2024.2447478

    work page doi:10.1080/10618600.2024.2447478 2025

  66. [66]

    Antonio F Peralta, Janos Kert´ esz, and Gerardo I˜ niguez,Opinion dynamics in social networks: From models to data (2022), available at arXiv:2201.01322

    work page arXiv 2022

  67. [67]

    Walter Rudin, Principles of Mathematical Analysis , 3rd ed., International Series in Pure and Applied Mathe- matics, McGraw-Hill, 1976

    work page 1976

  68. [68]

    Moore, Dynamic social network analysis using latent space models , Pro- ceedings of the 19th international conference on neural information processing systems, 2005, pp

    Purnamrita Sarkar and Andrew W. Moore, Dynamic social network analysis using latent space models , Pro- ceedings of the 19th international conference on neural information processing systems, 2005, pp. 1145–1152. https://dl.acm.org/doi/abs/10.5555/2976248.2976392

    work page doi:10.5555/2976248.2976392 2005

  69. [69]

    Daniel K Sewell and Yuguo Chen, Analysis of the formation of the structure of social networks by using latent space models for ranked dynamic networks , J. R. Stat. Soc., Ser. C: Appl. Stat. 64 (2015), no. 4, 611–633. https://doi.org/10.1111/rssc.12093

    work page doi:10.1111/rssc.12093 2015

  70. [70]

    , Latent space models for dynamic networks , J. Am. Stat. Assoc. 110 (2015), no. 512, 1646–1657. https: //doi.org/10.1080/01621459.2014.988214

    work page doi:10.1080/01621459.2014.988214 2015

  71. [71]

    , Latent space models for dynamic networks with weighted edges , Soc. Netw. 44 (2016), 105–116. https: //doi.org/10.1016/j.socnet.2015.07.005

    work page doi:10.1016/j.socnet.2015.07.005 2016

  72. [72]

    12 (2017), no

    , Latent space approaches to community detection in dynamic networks , Bayesian Anal. 12 (2017), no. 2, 351–377. https://doi.org/10.1214/16-BA1000

    work page doi:10.1214/16-ba1000 2017

  73. [73]

    Justin Sirignano and Konstantinos Spiliopoulos, Mean field analysis of neural networks: A law of large numbers , SIAM J. Appl. Math. 80 (2020), 725–752. https://doi.org/10.1137/18M1192184

    work page doi:10.1137/18m1192184 2020

  74. [74]

    Tom Snijders, Christian Steglich, and Michael Schweinberger, Modeling the coevolution of networks and behavior, Longitudinal Models in the Behavioral and Related Sciences, 2017, pp. 41–71

    work page 2017

  75. [75]

    Tom Snijders, Gerhard G Van de Bunt, and Christian EG Steglich, Introduction to stochastic actor-based models for network dynamics , Soc. Netw. 32 (2010), no. 1, 44–60. https://doi.org/10.1016/j.socnet.2009.02.004

    work page doi:10.1016/j.socnet.2009.02.004 2010

  76. [76]

    Tom Snijders and Marijtje van Duijn, Simulation for statistical inference in dynamic network models , Simul. Soc. Phenom., 1997, pp. 493–512. https://doi.org/10.1007/978-3-662-03366-1_38

    work page doi:10.1007/978-3-662-03366-1_38 1997

  77. [77]

    Konstantinos Spiliopoulos, Systemic Risk and Default Clustering for Large Financial Systems , Large Deviations and Asymptotic Methods in Finance, 2015, pp. 529–557

    work page 2015

  78. [78]

    Katarzyna Sznajd-Weron and Jozef Sznajd, Opinion evolution in closed community , Int. J. Mod. Phys. C 11 (2000), no. 06, 1157–1165. https://doi.org/10.1142/S0129183100000936. 65

    work page doi:10.1142/s0129183100000936 2000

  79. [79]

    Alain-Sol Sznitman, Topics in Propagation of Chaos , Springer-Verlag, 1991

    work page 1991

  80. [80]

    van Putten and J.H

    C. van Putten and J.H. van Schuppen, Invariance properties of the conditional independence relation , Ann. Probab. 13 (1985), no. 3, 934–945. http://doi.org/10.1214/aop/1176996548

    work page doi:10.1214/aop/1176996548 1985

Showing first 80 references.