为流动主导的网络设计了能精确模拟对流的新型消息传递机制。
MeGA-MP: Metric Graph Advection Message Passing -- A Physics-Informed Message Passing Operator for Advection-Dominated Metric Graphs

- 基于物理先验构建消息传递算子,显式编码一维对流动力学。
- 纯对流场景下无需训练即可逼近真实动态,误差由理论推导确定。
- 适用于供水管网等复杂系统,支持跨拓扑零样本泛化。
许多现实世界系统以网络形式组织,其时空动态沿连接传播而非节点间离散发生,如供水网、燃气网、电网和交通流网络。这些系统天然可建模为度量图,其中边对应一维欧氏子空间并在顶点处连接。度量图独立于全局欧氏空间,限制了典型物理信息神经网络(PINNs)和算子学习方法的应用。特别是对流这类传输动态,需要能捕捉图上反对称与长程依赖的方法,这本身具有挑战性。本文提出一种新颖的物理信息消息传递算子,将度量图上的线性对流作为归纳偏置进行编码。在纯对流设置下,该算子在理论上可恢复精确动态,仅存在可推导的离散化误差,无需任何训练。结合可训练组件(如MLP),该算子扩展至供水系统中的对流-反应动力学,在性能上优于基线方法,并实现跨不同图拓扑的零样本泛化。
原文摘要 · Abstract (English)
Many real-world systems are organized as networks where spatio-temporal dynamics unfold along connections and not discretely between nodes. Examples include utility networks such as water distribution systems or gas networks, electrical grids, and traffic flow networks. Such systems are naturally modeled as metric graphs, where edges correspond to one-dimensional Euclidean subspaces connected at vertices. Metric graphs are independent of an underlying global Euclidean space, limiting direct application of typical PINNs and operator-learning methods. Especially transport dynamics like advection require a methodology able to capture antisymmetric and long-range dependencies on graphs, which is itself a challenge. We propose a novel physics-informed message passing operator that encodes linear advection on metric graphs as an inductive bias. In the purely advective setting, the operator provably recovers the exact dynamics up to a theoretically derived discretization error without any training. Combined with trainable components like MLPs, our message passing operator extends to realistic advection-reaction dynamics in water distribution systems, where we achieve superior performance compared to baselines and zero-shot generalization across different graph topologies.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。