arXiv:2606. 08287v1 Announce Type: new Abstract: Finite element analysis (FEA) is essential for structural design but remains computationally expensive, particularly when evaluating multiple design iterations or load scenarios.
arXiv:2602. 10031v2 Announce Type: replace Abstract: Graph neural networks (GNNs) are commonly divided into message-passing neural networks (MPNNs) and spectral GNNs, reflecting two largely separate research traditions in machine learning and signal processing.
arXiv:2608.27883v1 Announce Type: new Abstract: Physical systems are often modeled by solution operators that map input fields, parameters, geometries, or past states to steady or future physical sta...
arXiv:2606. 03315v1 Announce Type: new Abstract: Graph foundation models aim to learn transferable knowledge from diverse graphs for generalization to unseen graphs and tasks.
arXiv:2608. 01160v1 Announce Type: new Abstract: Topological neural networks (TNNs) enable leveraging high-order structures on graphs (e.
arXiv:2607. 19387v1 Announce Type: cross Abstract: Surrogate modeling for high-dimensional nonlinear dynamical systems that exhibit chaos requires mechanisms that preserve not only pointwise accuracy but also the scale-dependent structure of physical fields.
The paper introduces higher-order positional encodings that enrich graph representations by incorporating topological information from lifted incidence structures, without altering existing graph learning backbones. It theoretically shows that these encodings can mix graph Laplacian frequencies beyond what scalar spectral filters achieve, and demonstrates their effectiveness on Graph Transformers for datasets like ZINC and synthetic benchmarks. The approach bridges graph positional encodings and topological deep learning, enabling standard models to exploit higher-order interactions.
arXiv:2607. 21607v1 Announce Type: cross Abstract: Graph Neural Networks propagate information through local message passing, but the graph topologies themselves can silently prevent any amount of training from solving long-range tasks.
arXiv:2606. 24956v1 Announce Type: new Abstract: Spectral graph neural networks (GNNs) interpret message passing as frequency-selective filtering.
The paper introduces Spectral-like Neural Discretisation (SpeND), a mesh‑free method that learns stencil weights via a neural network to approximate the modal response of a spectral operator across a specified band of wavenumbers. By projecting the network output onto the space of polynomial‑consistent weights, SpeND ensures exact consistency while minimizing dispersion and dissipation errors in a self‑supervised, physics‑agnostic manner. Experiments on disordered 2‑D node sets demonstrate that the learned fourth‑order operator matches the exact spectral response over a wider band than traditional LABFM or structured‑grid finite differences, and retains fourth‑order convergence upon refinement.
arXiv:2608. 09031v1 Announce Type: new Abstract: Graph neural networks typically propagate information through repeated message-passing layers, coupling the distance over which information travels with the number of nonlinear transformations applied.
arXiv:2606. 10909v1 Announce Type: cross Abstract: Reconstructing local stress fields in heterogeneous microstructures under non-linear, history-dependent loading remains a major computational bottleneck in multi-scale simulations.