惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Blog — PlanetScale
Blog — PlanetScale
Vercel News
Vercel News
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
量子位
Y
Y Combinator Blog
IT之家
IT之家
博客园 - 聂微东
L
LangChain Blog
爱范儿
爱范儿
H
Help Net Security
GbyAI
GbyAI
F
Fortinet All Blogs
B
Blog
Microsoft Security Blog
Microsoft Security Blog
罗磊的独立博客
C
Check Point Blog
博客园 - 三生石上(FineUI控件)
小众软件
小众软件
D
DataBreaches.Net
Last Week in AI
Last Week in AI
WordPress大学
WordPress大学
B
Blog RSS Feed
酷 壳 – CoolShell
酷 壳 – CoolShell
宝玉的分享
宝玉的分享

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Mean field limit of non-exchangeable interacting diffusio...
[Submitted on 19 Jun 2026] · 2026-06-23 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:Systems in which the network structure and particle states co-evolve in mutual influence are increasingly recognized as essential for modeling complex adaptive systems. However, traditional models of non-exchangeable interacting particle systems frequently assume a fixed network topology, a simplification that fails to capture the dynamical nature of many real-world phenomena. In this paper, we rigorously establish the mean-field limit for systems of non-exchangeable interacting diffusions on co-evolutionary networks. The primary analytical challenge arises from the coupling between the network dynamics and the agents' states, which induces non-Markovian dynamics where the system's evolution depends on its entire history. Consequently, the macroscopic limit is not governed by a classical partial differential equation, but rather by a coupled system of path-dependent McKean-Vlasov SDEs for the particles' states together with a transport equation for the distribution of the weights. A further difficulty stems from the non-linear weight dynamics, which requires an adequate choice for the limiting network structure. To overcome the structural limitations of classical graphon theory, we employ the framework of \(\mathcal{K}\)-graphons (Lovász and Szegedy, 2010), also termed probability-graphons (Abraham, Delmas, and Weibel, 2025). To the best of our knowledge, this is the first example in the literature in which the natural topology of probability-graphons is used in the context of mean-field limits, providing a natural and rigorous framework that is fully compatible with non-linear network adaptivity.

Submission history

From: Julián Cabrera-Nyst [view email]
[v1] Fri, 19 Jun 2026 15:55:17 UTC (104 KB)