topology

Spectral graph analysis for agent network topology — Laplacian decomposition, algebraic connectivity, bridge detection, and hypergraph group coordination.

Network topology analysis for distributed systems.

This module provides graph-theoretic tools for analyzing and optimizing network topologies in distributed systems.

Key features: - Graph Laplacian spectral analysis - Algebraic connectivity (λ₂) computation - Consensus convergence bounds - Connectivity analysis and fault tolerance verification

Submodules

Module	Description
laplacian	Laplacian matrix analysis, algebraic connectivity \(\lambda_2\), consensus bounds
connectivity	Vertex/edge connectivity, bridge detection, component analysis
hypergraph	Hypergraph topology for group coordination with \(L_H = D_v - H W D_e^{-1} H^T\)