Efficient Multiscale Methods for Highly Heterogeneous Spatial Network Models
Yingjie Zhou,Xiang Zhong,Changqing Ye,Eric T. Chung

TL;DR
This paper introduces an algebraic multiscale method for highly heterogeneous spatial networks that is efficient, geometry-independent, and adaptable to various boundary conditions, validated by theoretical analysis and numerical experiments.
Contribution
The proposed method is a purely algebraic multiscale approach that avoids geometric parameters, enabling broader applicability and efficient simulation of complex heterogeneous networks.
Findings
Convergence is independent of heterogeneity contrast.
The method operates entirely within an algebraic framework.
Numerical experiments confirm the method's effectiveness.
Abstract
Modeling complex spatial networks with multiscale heterogeneity poses significant mathematical and computational challenges. Lacking explicit PDE discretizations and facing excessive degrees of freedom, conventional methods often become computationally prohibitive. To address these challenges, we propose an efficient multiscale modeling for highly heterogeneous spatial networks. We construct multiscale basis functions tailored to spatial network models with heterogeneous edge weights and node degrees. A key novelty is that the proposed method doesn't introduce geometric parameters (such as Dirichlet nodes, distances, or mesh sizes), thereby preserving its purely algebraic nature and ensuring broad applicability. By incorporating a subgraph-wise estimate, we define a Poincar\'e constant that renders the method independent of the underlying graph geometry. Then through…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
