{"title":"Gaussian approximation of dynamic cavity equations for linearly-coupled stochastic dynamics","authors":"Mattia Tarabolo, Luca Dall'Asta","doi":"arxiv-2406.14200","DOIUrl":null,"url":null,"abstract":"Stochastic dynamics on sparse graphs and disordered systems often lead to\ncomplex behaviors characterized by heterogeneity in time and spatial scales,\nslow relaxation, localization, and aging phenomena. The mathematical tools and\napproximation techniques required to analyze these complex systems are still\nunder development, posing significant technical challenges and resulting in a\nreliance on numerical simulations. We introduce a novel computational framework\nfor investigating the dynamics of sparse disordered systems with continuous\ndegrees of freedom. Starting with a graphical model representation of the\ndynamic partition function for a system of linearly-coupled stochastic\ndifferential equations, we use dynamic cavity equations on locally tree-like\nfactor graphs to approximate the stochastic measure. Here, cavity marginals are\nidentified with local functionals of single-site trajectories. Our primary\napproximation involves a second-order truncation of a small-coupling expansion,\nleading to a Gaussian form for the cavity marginals. For linear dynamics with\nadditive noise, this method yields a closed set of causal integro-differential\nequations for cavity versions of one-time and two-time averages. These\nequations provide an exact dynamical description within the local tree-like\napproximation, retrieving classical results for the spectral density of sparse\nrandom matrices. Global constraints, non-linear forces, and state-dependent\nnoise terms can be addressed using a self-consistent perturbative closure\ntechnique. The resulting equations resemble those of dynamical mean-field\ntheory in the mode-coupling approximation used for fully-connected models.\nHowever, due to their cavity formulation, the present method can also be\napplied to ensembles of sparse random graphs and employed as a message-passing\nalgorithm on specific graph instances.","PeriodicalId":501065,"journal":{"name":"arXiv - PHYS - Data Analysis, Statistics and Probability","volume":"65 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - PHYS - Data Analysis, Statistics and Probability","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.14200","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Stochastic dynamics on sparse graphs and disordered systems often lead to
complex behaviors characterized by heterogeneity in time and spatial scales,
slow relaxation, localization, and aging phenomena. The mathematical tools and
approximation techniques required to analyze these complex systems are still
under development, posing significant technical challenges and resulting in a
reliance on numerical simulations. We introduce a novel computational framework
for investigating the dynamics of sparse disordered systems with continuous
degrees of freedom. Starting with a graphical model representation of the
dynamic partition function for a system of linearly-coupled stochastic
differential equations, we use dynamic cavity equations on locally tree-like
factor graphs to approximate the stochastic measure. Here, cavity marginals are
identified with local functionals of single-site trajectories. Our primary
approximation involves a second-order truncation of a small-coupling expansion,
leading to a Gaussian form for the cavity marginals. For linear dynamics with
additive noise, this method yields a closed set of causal integro-differential
equations for cavity versions of one-time and two-time averages. These
equations provide an exact dynamical description within the local tree-like
approximation, retrieving classical results for the spectral density of sparse
random matrices. Global constraints, non-linear forces, and state-dependent
noise terms can be addressed using a self-consistent perturbative closure
technique. The resulting equations resemble those of dynamical mean-field
theory in the mode-coupling approximation used for fully-connected models.
However, due to their cavity formulation, the present method can also be
applied to ensembles of sparse random graphs and employed as a message-passing
algorithm on specific graph instances.