# Capacity-Preserving Transient Message Passing

- ID: 1387
- Canonical URL: https://synthcore.org/idea/1387/capacity-preserving-transient-message-passing
- API JSON: https://synthcore.org/api/idea/1387.json
- API Markdown: https://synthcore.org/api/idea/1387.md
- Verification status: failed_benchmark
- Source: [arXiv:2607.25065](https://arxiv.org/abs/2607.25065)
- Category: dynamics
- Solves: stability, accuracy, scalability
- ML areas: graph-nn, ssm, regularization
- Math tags: dynamical-systems, probability, graph-theory, geometry, functional-analysis
- Ratings: usefulness 7/10; difficulty 6/10; novelty 7/10

## Idea description

Replace ordinary graph convolution with a Markov diffusion whose edge transition probability is proportional to a geometric distance weight d(v,u)^(n−2), following the paper's Delaunay discretization theorem. Use graph Dirichlet capacity on expanding node shells to detect whether information escapes through the graph or repeatedly returns to local neighborhoods, and use this signal to select propagation depth or add a regularizer.

## Mathematical statement

Let M be an n-dimensional hyperbolic manifold, let m be a good point configuration, and let G=(V,E) be its Delaunay graph. For an edge {v,u}, let d(v,u) be its hyperbolic distance and define w(v,u)=d(v,u)^(n−2). The paper uses the transition probability p(v,u)=w(v,u) divided by the sum of w(v,z) over neighbors z of v, and proves that M is transient if and only if this weighted random walk on G is transient. For neural propagation, define the weighted Laplacian Lf(v)=sum over neighbors u of w(v,u)(f(v)−f(u)), the weighted degree q(v)=sum over neighbors u of w(v,u), and the row-stochastic diffusion matrix P with entries P(v,u)=w(v,u)/q(v). For node sets A contained in B, define graph capacity as the minimum Dirichlet energy over functions f taking value 1 on A, value 0 outside B, and values in [0,1] elsewhere. Large capacity across expanding shells indicates an energetically available route for escape; capacity that vanishes rapidly with shell radius indicates recurrent, locally trapped propagation.

## Key formulas

- p(v,u) = d(v,u)^(n−2) / sum over neighbors z of v of d(v,z)^(n−2)
- L_w f(v) = sum over neighbors u of w(v,u) [f(v) − f(u)], with w(v,u) = d(v,u)^(n−2), and P = D^(-1)W
- Cap_G(A,B) = infimum over f of (1/2) sum over ordered pairs (u,v) of w(u,v)[f(u) − f(v)]^2, subject to f=1 on A, f=0 outside B, and 0≤f≤1
- H_(t+1) = sigma(((1−alpha)H_t + alpha P H_t Theta_t + b_t)); L_cap = (1/K) sum over k of max(0, tau − Cap_hat(A_k,B_k))^2

## Implementation notes

Integrate this mechanism into a graph neural network layer wherever a normalized adjacency matrix is currently used. Assume that each node has a hyperbolic coordinate or another geometry from which edge distances can be computed. First construct a sparse neighborhood graph using a Delaunay approximation, k-nearest neighbors, or the existing graph topology. For every edge, compute d(v,u), set W[v,u] = d(v,u) raised to the power n−2, add a small epsilon to avoid zero degree, and row-normalize W to obtain P. Use the update H_next = activation((1−alpha)H + alpha times P H Theta + bias), where H is the node-feature matrix, Theta is a trainable weight matrix, and alpha is a residual diffusion strength. Pseudocode is: compute edge distances; assign W; normalize each row; for each layer compute message = P @ H; compute H = activation((1−alpha) * H + alpha * message @ Theta + bias). Every K layers, estimate capacity for shell pairs A_k and B_k by solving the constrained quadratic Dirichlet problem with conjugate gradients. A cheap approximation is to initialize f=1 on A_k and f=0 outside B_k, optimize the Dirichlet energy, and evaluate the final energy. The distance-weighted transition and capacity energy are taken from the paper; shell definitions, alpha, K, and threshold tau are engineering choices. Run first on a synthetic node-classification task generated from hyperbolic random graphs, comparing GCN, residual GCN, and this layer at equal parameter count. Also test a citation or molecular graph benchmark with available node coordinates. Measure validation accuracy, gradient norms, pairwise feature similarity, and the influence norm ||P^t e_v||_2 for multiple t. The quantitative prediction is that graphs with slowly decaying expanding-shell capacity will preserve long-range influence and delay oversmoothing, while graphs whose capacity decays rapidly will exhibit recurrent local mixing and little benefit from added depth. Sweep the hyperbolic curvature or global distance scale and look for a transition where shell-capacity decay changes regime; the transition should coincide with a sharp change in influence survival and the depth at which feature variance collapses.

## Verification

- Status: failed_benchmark
- Mechanism evidence: yes
- Mechanism confirmed: no
- Practical verdict: no_effect
- Verdict: Implemented distance-weighted Markov diffusion, residual message passing utilities, exact shell Dirichlet-capacity solves, and a synthetic comparison in run_experiment.py. The mechanism manifested: 1D capacity fit was -1.000 versus the predicted -1, 2D capacity was strongly affine in 1/log(R) (R²=0.985), 3D capacity remained nonzero (late/early=0.878), and influence norm decayed with exponent -0.249 versus the predicted -0.25. The weighted layer gave a small fixed-readout accuracy improvement (0.911 vs 0.906), but this is not evidence of a robust trained-GNN win.

### Mechanism check

- Verdict: Implemented distance-weighted Markov diffusion, residual message passing utilities, exact shell Dirichlet-capacity solves, and a synthetic comparison in run_experiment.py. The mechanism manifested: 1D capacity fit was -1.000 versus the predicted -1, 2D capacity was strongly affine in 1/log(R) (R²=0.985), 3D capacity remained nonzero (late/early=0.878), and influence norm decayed with exponent -0.249 versus the predicted -0.25. The weighted layer gave a small fixed-readout accuracy improvement (0.911 vs 0.906), but this is not evidence of a robust trained-GNN win.
- Confidence: 8/10
- Limitations: The task comparison uses a fixed coordinate readout rather than training matched-parameter GNNs. Capacity was evaluated on regular lattice shells with unit edge distances, not hyperbolic Delaunay graphs; no citation or molecular benchmark, GPU/CPU speed study, learned capacity regularizer, curvature sweep, or statistical repeats were run.

### Practical benchmark

- Paired seeds: 8
- Baseline mean: 0
- Idea mean: 0
- p-value: 0.0868
- Paired wins: 6/8
- Benchmark verdict: no significant win

## Artifacts

- [artifacts/bench_report.json](https://synthcore.org/code/539/artifacts/bench_report.json)
- [artifacts/bench_stdout.json](https://synthcore.org/code/539/artifacts/bench_stdout.json)
- [bench_graph.py](https://synthcore.org/code/539/bench_graph.py)
- [graph_track.py](https://synthcore.org/code/539/graph_track.py)
- [report.md](https://synthcore.org/code/539/report.md)
- [report_bench_2026-08-31T171745.md](https://synthcore.org/code/539/report_bench_2026-08-31T171745.md)
- [results.json](https://synthcore.org/code/539/results.json)
- [run_experiment.py](https://synthcore.org/code/539/run_experiment.py)
- [Download all files as ZIP](https://synthcore.org/download/539)

## Disclaimer

AI-generated research hypothesis, automatically tested. Not peer-reviewed.