# Teleporting Simplicial Diffusion Layer

- ID: 1601
- Canonical URL: https://synthcore.org/idea/1601/teleporting-simplicial-diffusion-layer
- API JSON: https://synthcore.org/api/idea/1601.json
- API Markdown: https://synthcore.org/api/idea/1601.md
- Verification status: failed_benchmark
- Source: [arXiv:2607.29450](https://arxiv.org/abs/2607.29450)
- Category: dynamics
- Solves: stability, accuracy, scalability
- ML areas: graph-nn, regularization
- Math tags: graph-theory, spectral-theory, stochastic-processes, dynamical-systems
- Ratings: usefulness 7/10; difficulty 5/10; novelty 6/10

## Idea description

Replace ordinary graph message passing by diffusion over a simplicial complex or hypergraph, using incidence matrices to propagate information through nodes, edges, and higher-order faces. Mix the local higher-order walk with a teleportation operator so that the layer remains globally connected and avoids the slow mixing or oversmoothing caused by poorly connected complexes.

## Mathematical statement

Let \(\mathcal{X}\) be a \(D\)-dimensional simplicial complex with \(N_d\) \(d\)-simplices \(\sigma_i^{(d)}\). The incidence matrix \(A_d\in\{0,1\}^{N_{d-1}\times N_d}\) is defined by \(A_d(i,j)=1\) iff \(\sigma_i^{(d-1)}\subset\sigma_j^{(d)}\). Its upper degree is \(k_{i,up}^{(d-1)}=\sum_j A_d(i,j)\), while the lower degree of a \(d\)-simplex is \(k_{j,down}^{(d)}=\sum_i A_d(i,j)=d+1\). Construct a row-stochastic local diffusion matrix \(P_{loc}\) from normalized incidence products, for example \(P_{loc}=D_{d-1}^{-1}A_dD_d^{-1}A_d^{\mathsf T}\), with self-loops added if needed for aperiodicity. Let \(R\) be a row-stochastic teleportation matrix, such as uniform global mixing \(R=\mathbf{1}\mathbf{1}^{\mathsf T}/N_0\) or a learned feature-dependent kernel. The local-to-long-range interpolation is \(P_\alpha=(1-\alpha)P_{loc}+\alpha R\), where \(0\leq\alpha\leq1\). Because both terms are stochastic, \(P_\alpha\) is stable in the probability norm and, for uniform teleportation, all nonprincipal eigenvalues are contracted by approximately \(1-\alpha\).

## Key formulas

- $$A_d(\sigma_i^{(d-1)},\sigma_j^{(d)})=\mathbf{1}\{\sigma_i^{(d-1)}\subset\sigma_j^{(d)}\},\qquad k_{i,up}^{(d-1)}=\sum_{j=1}^{N_d}A_d(i,j),\qquad k_{j,down}^{(d)}=\sum_{i=1}^{N_{d-1}}A_d(i,j)=d+1.$$
- $$P_{loc}=D_{d-1}^{-1}A_dD_d^{-1}A_d^{\mathsf T},\qquad P_\alpha=(1-\alpha)P_{loc}+\alpha R,\qquad H_{\ell+1}=\phi\!\left(P_\alpha H_\ell W_\ell+b_\ell\right),$$
- $$\rho\!\left(P_\alpha-\mathbf{1}\pi_\alpha^{\mathsf T}\right)\leq 1-\alpha\quad\text{for uniform teleportation},$$
- $$t^{(g)}=(I-Q_\alpha)^{-1}\mathbf{1},\qquad Q_\alpha=P_\alpha[\mathcal{V}\setminus\{g\},\mathcal{V}\setminus\{g\}],$$

## Implementation notes

Integrate this as a message-passing layer for hypergraphs or simplicial complexes. Start with a dataset containing explicit hyperedges, or convert a graph into a clique complex and retain nodes, edges, and triangles. Precompute sparse incidence matrices \(A_d\), degree vectors, and the normalized local operator \(P_{loc}\). At each layer, choose \(R\) as either uniform global mixing, a sparse random landmark matrix, or a learned low-rank stochastic kernel. Compute \(H_{next}=\phi(((1-\alpha)P_{loc}+\alpha R)HW+b)\); use residual addition if the nonlinear layer is unstable. Pseudocode is: build incidence matrices; compute degrees with an epsilon floor; normalize \(P_{loc}\); set \(P=(1-alpha)P_{loc}+alpha R\); propagate \(H=P@H@W+b\); apply normalization and activation; optionally estimate the second eigenvalue by ten power iterations. The incidence construction and interpolation rule come from the paper's mechanism; the exact neural weights, residual path, and choice of \(R\) are engineering adaptations. First run a cheap node-classification experiment on Cora, a small hypergraph benchmark, and a synthetic two-community simplicial complex. Compare GCN/GAT against the same architecture with \(\alpha\in\{0,.01,.03,.1,.3\}\). The quantitative prediction is that the measured nonprincipal spectral radius decreases approximately linearly as \(1-\alpha\), while feature mixing time and oversmoothing decrease sharply once \(\alpha\) exceeds the inverse graph mixing time. On the synthetic complex, mean first-passage time to a target community should decrease monotonically with \(\alpha\); test whether validation accuracy peaks before the fully global limit \(\alpha=1\), indicating a locality-globality tradeoff rather than a generic parameter-count gain.

## Verification

- Status: failed_benchmark
- Mechanism evidence: yes
- Mechanism confirmed: no
- Practical verdict: inconclusive
- Verdict: Built a simplicial diffusion layer using triangle-node incidence matrices, normalized local walks, uniform teleportation, MFPT computation, and a small classification probe. The mechanism manifested: spectral radius matched rho_alpha=rho_0(1-alpha) with maximum absolute error 1.9e-15, slow-mode mixing at 12 steps matched prediction within 1.4e-14, and mean MFPT decreased monotonically from 528.45 at alpha=0 to 71.66 at alpha=0.6. In the toy classifier, accuracy improved from 0.617 for local diffusion to 0.817 at alpha=0.6, although this was only a synthetic experiment.

### Mechanism check

- Verdict: Built a simplicial diffusion layer using triangle-node incidence matrices, normalized local walks, uniform teleportation, MFPT computation, and a small classification probe. The mechanism manifested: spectral radius matched rho_alpha=rho_0(1-alpha) with maximum absolute error 1.9e-15, slow-mode mixing at 12 steps matched prediction within 1.4e-14, and mean MFPT decreased monotonically from 528.45 at alpha=0 to 71.66 at alpha=0.6. In the toy classifier, accuracy improved from 0.617 for local diffusion to 0.817 at alpha=0.6, although this was only a synthetic experiment.
- Confidence: 9/10
- Limitations: Only a regular synthetic cyclic triangle complex and a tiny fixed-seed ridge classifier were tested. No Cora, hypergraph benchmark, learned or sparse teleportation kernel, GPU implementation, runtime/scalability benchmark, multi-seed statistics, or comparison with GCN/GAT was evaluated.

### Practical benchmark

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

## Artifacts

- [bench_report.json](https://synthcore.org/code/601/bench_report.json)
- [registered_bench.py](https://synthcore.org/code/601/registered_bench.py)
- [report.md](https://synthcore.org/code/601/report.md)
- [report_bench_2026-08-31T193842.md](https://synthcore.org/code/601/report_bench_2026-08-31T193842.md)
- [results.json](https://synthcore.org/code/601/results.json)
- [run_bench.py](https://synthcore.org/code/601/run_bench.py)
- [simplicial_track.py](https://synthcore.org/code/601/simplicial_track.py)
- [teleport_simplicial.py](https://synthcore.org/code/601/teleport_simplicial.py)
- [verify_and_report.py](https://synthcore.org/code/601/verify_and_report.py)
- [Download all files as ZIP](https://synthcore.org/download/601)

## Disclaimer

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