Activity-Gated Spectral Message Passing
Implementation & benchmark of arXiv:2608.12647 — Activity-dependent epidemic spreading on multiscale brain networks predicts Alzheimer's disease progression
Source paper: Activity-dependent epidemic spreading on multiscale brain networks predicts Alzheimer's disease progression arXiv:2608.12647 ⓘ · analyzed Sep 1, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Replace fixed graph message weights with a source-node activity gate that amplifies or suppresses every outgoing message from that node. Use the linearized epidemic growth condition to calibrate the residual propagation strength so that the dominant graph mode is near, but below, an explicitly chosen stability threshold rather than being determined accidentally by the graph spectrum.
Formulas
Mathematical statement
The paper evolves infection probabilities p^I(t) and activity probabilities p^A(t) on a nonnegative weighted directed graph W, where W_{ij} is the edge weight from source node j to target node i. The source activity gate is g_j(t)=1+\delta p^A_j(t), with \delta>-1, and the full update is p^I(t+1)=p^I(t)+\varepsilon[((\mathbf{1}-p^I(t))\odot\beta W\operatorname{diag}(\mathbf{1}+\delta p^A(t))p^I(t))-\zeta p^I(t)]. Here \odot is elementwise multiplication, \beta is transmission strength, \zeta is clearance, and \varepsilon is the step size. Near the zero state, the saturation factor \mathbf{1}-p^I disappears, giving the Jacobian J=I+\varepsilon[\beta W\operatorname{diag}(\mathbf{1}+\delta p^A)-\zeta I]. For nonnegative W and fixed activity a, the dominant propagation mode grows when \beta\lambda_{\max}(W\operatorname{diag}(\mathbf{1}+\delta a))>\zeta; this is the paper's epidemic-threshold mechanism. In a neural layer, use the same source-side gate with a_i=\sigma(u^ op h_i+b), constrain \delta>-1, and normalize the residual coefficient using an estimate of \lambda_{\max}(W\operatorname{diag}(1+\delta a)) so the learned propagation has a controlled spectral radius.
Implementation notes
1. Integration point: implement this as a recurrent graph message-passing block for node features H in a GNN, preferably replacing a residual GCN layer. Let W be the sparse adjacency with nonnegative edge weights, V be a trainable feature projection, and maintain a bounded scalar state x_i for each node or compute x_i=sigmoid((Qh_i)_scalar). Compute a_i=sigmoid(u^T h_i+b) from the current source-node representation. 2. Pseudocode: initialize H and optional x; for each layer, compute gate g=1+delta*a with delta=softplus(raw_delta)-1; compute MvH = W @ (g[:,None] * (H @ V.T)); if spectral normalization is enabled, run 3-5 power iterations on M=W*diag(g) to estimate lambda_hat; choose eta so the target linear growth factor rho_target is 0.9-0.99 using eta=(rho_target+epsilon*zeta-1)/(beta*lambda_hat), clipped to [eta_min,eta_max]; update x=sigmoid(QH), H=H+eta*((1-x)*beta*MvH-zeta*H), then apply a standard output projection and optional LayerNorm. 3. The paper supplies the source-side multiplicative gate, saturation term, and threshold logic. Estimate lambda_hat empirically by sparse power iteration; estimate delta, beta, zeta, and u by gradient descent. For signed hidden features, use the gated propagation term directly but apply the saturation factor to a separate nonnegative scalar channel, or omit it and retain only the mathematically justified gated residual term. 4. First experiment: use a 3-6 layer model on Cora, ogbn-arxiv-subset, or a synthetic stochastic block model, comparing fixed-normalized GCN, GAT, ordinary residual GCN, and this module at equal hidden size and FLOPs. Measure validation accuracy, gradient norm, activation oversmoothing via pairwise cosine similarity across layers, and the estimated dominant eigenvalue. A successful result should show less oversmoothing and fewer unstable runs, or faster loss reduction at equal training steps, especially when node activity is correlated with class or community membership. Ablate the activity gate, spectral normalization, and saturation term separately.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.