diffusion-scores-neural-circuit

name	diffusion-scores-neural-circuit
description	Inferring active neural circuits from neural activity data using diffusion scores methodology. Identifies functionally connected neural populations through diffusive signal propagation patterns. Activation: diffusion scores, neural circuit inference, active circuit detection, functional connectivity inference, neural population analysis.

Diffusion Scores for Neural Circuit Inference

Methodology for inferring active neural circuits from recorded neural activity using diffusion score analysis, revealing functionally connected populations beyond structural connectivity.

Metadata

• Source: arXiv:2605.02852
• Authors: Savik Kinger, Johannes Bertram, Luciano Dyballa, Eviatar Yemini, Steven W. Zucker
• Published: 2026-05-05
• Categories: q-bio.NC

Core Methodology

Key Innovation

Uses diffusion scores — measures of signal propagation through neural activity data — to infer which neural circuits are actively engaged, distinguishing functional connectivity from mere structural connections.

Technical Framework

1. Activity Data Collection: Record neural population activity (calcium imaging, electrophysiology, fMRI)

2. Diffusion Score Computation:

   • Model activity propagation as diffusion on neural connectivity graph
   • Compute diffusion distances between neuron pairs over time
   • Identify neuron groups with coordinated diffusion patterns

3. Active Circuit Identification:

   • Neurons with high diffusion scores → hub neurons in active circuits
   • Clusters of correlated diffusion → functional circuit modules
   • Temporal evolution of diffusion → circuit activation dynamics

4. Validation:

   • Compare inferred circuits with known anatomical connectivity
   • Test prediction of circuit response to perturbations
   • Cross-validate across different behavioral states

Mathematical Foundation

• Graph Diffusion: Model neural activity as heat diffusion on connectivity graph

  dh/dt = -L·h
  

  where L is the graph Laplacian and h is activity vector

• Diffusion Score: For each neuron i at time t:

  D_i(t) = Σ_j exp(-λ_j·t) · φ_j(i) · <φ_j, h(0)>
  

  where λ_j, φ_j are eigenvalues/eigenvectors of L

• Active Circuit Score: Correlation of diffusion patterns across neuron pairs

  S_ij = corr(D_i(·), D_j(·))
  

Implementation Guide

Step-by-Step

1. Build Connectivity Graph: From anatomical data or functional correlation
2. Compute Graph Laplacian: L = D - A (degree matrix minus adjacency)
3. Eigendecomposition: Get eigenvalues and eigenvectors of L
4. Compute Diffusion: Propagate initial activity through graph
5. Calculate Scores: Compute diffusion scores for each neuron
6. Identify Circuits: Cluster neurons by diffusion score similarity
7. Validate: Compare with ground truth if available

Code Example

import numpy as np
from scipy.sparse.linalg import eigsh
from scipy.spatial.distance import squareform

def compute_diffusion_scores(adjacency, initial_activity, time_points):
    """Compute diffusion scores for neural circuit inference.
    
    Args:
        adjacency: N×N connectivity matrix
        initial_activity: N-dimensional initial activity pattern
        time_points: Array of time points to evaluate diffusion
    """
    N = adjacency.shape[0]
    degree = np.diag(adjacency.sum(axis=1))
    laplacian = degree - adjacency
    
    # Eigendecomposition
    eigenvalues, eigenvectors = eigsh(laplacian, k=min(50, N-2))
    
    # Compute diffusion at each time point
    diffusion_scores = np.zeros((len(time_points), N))
    for idx, t in enumerate(time_points):
        for k in range(len(eigenvalues)):
            coeff = np.dot(eigenvectors[:, k], initial_activity)
            diffusion_scores[idx] += (
                np.exp(-eigenvalues[k] * t) * eigenvectors[:, k] * coeff
            )
    
    return diffusion_scores

# Identify active circuits by clustering diffusion score trajectories
# High correlation in diffusion scores → same functional circuit

Applications

• Identifying functionally active neural circuits from imaging data
• Distinguishing structural vs. functional connectivity
• Tracking circuit dynamics across behavioral states
• Inferring circuit involvement in specific computations
• Validating computational models of neural circuits

Pitfalls

• Diffusion model assumes linear dynamics; real neural circuits are nonlinear
• Requires reasonably complete connectivity information
• Sensitive to noise in activity recordings
• May miss circuits with very slow or very fast dynamics (diffusion timescale mismatch)
• Graph Laplacian eigendecomposition is O(N³) — limits scalability to large networks

Related Skills

• brain-connectivity-analysis
• neural-population-dynamics
• sparse-neural-connectivity-recovery
• connectome-constrained-neural-network
• gaussian-graphical-models-brain-connectivity