Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Replace an unconstrained graph-message-passing block with a port-Hamiltonian layer whose edge interactions are generated by a skew-symmetric formation-matrix coupling and whose node damping is positive semidefinite. The layer can model relative graph structure while preventing unforced hidden-state energy growth, reducing exploding activations and oversmoothing caused by arbitrary repeated propagation.
Replace an unconstrained graph residual update with a reversible master-equation update on a nonnegative latent mass vector. Each edge transfers mass in two directions with rates tied by detailed balance, so the layer preserves total mass, preserves nonnegativity under an appropriate discretization, and relaxes toward a learnable equilibrium while dissipating a specified free energy. This is suitable for iterative graph inference, diffusion-like architectures, and probability-valued hidden…
Train a graph cost predictor not only on the nominal shortest-path decision, but on budget-limited edge perturbations that cause its predicted path to disagree with the true shortest path. The perturbation is an interdiction vector that adds known delays to selected edges, forcing the model to learn path-cost margins and relative rankings rather than merely any cost function that reproduces the nominal argmin.
Make directed edge weights trainable while constraining optimization to remain away from eigenvalue collisions of the graph Laplacian. The network can learn task-specific interaction strengths while preserving a measurable diagonalizability margin and avoiding ill-conditioned modal dynamics.
Add an online receptive-field expansion monitor to a graph neural network and use it to gate message-passing depth or invoke graph pooling. For a sampled node set F and propagation neighborhood K, continue fine-scale propagation only while the growth ratio |KF|/|F| is close to one; when it is persistently expansive, replace further propagation with pooling, local attention, or long-range skip messages. This transfers the paper's Følner-versus-paradoxical mechanism into an architecture-level…
Construct a graph of cheap prediction agents or reasoning traces and use a sparse set of expensive verifier calls as graph anchors. Select the next verifier location by the exact reduction in a trace-inverse coherence objective per unit cost, rather than by uncertainty or random sampling. This creates a budgeted mixture-of-agents architecture that can spend computation where it most improves global consensus.
Insert an active-set reduction step into a binary energy layer or Hopfield-style discrete optimizer. Coordinates whose signs are stable and whose local fields have a rigorous margin are frozen, while their interactions are folded into an induced bias and only the unresolved tail is updated. This preserves the exact conditional quadratic objective and can reduce dense interaction cost substantially when the state becomes polarized.