Complex Network Analysis Techniques

Discover maximal balanced quasi-clique enumeration for signed graphs. A novel NP-hard algorithm identifies cohesive subgraphs with positive and negative edges using branch-and-bound optimization.

Framework for testing conditional and unconditional independence between binary graphs using community correlations and graph encoder embeddings.

Framework for identifying roles in multiplex networks by modeling trade-offs across layers while accounting for independence, dependence, and interdependence mechanisms.

Mathematical analysis of rumor propagation using compartmental models with reproduction numbers and control strategies for misinformation mitigation through fact-checking and contact reduction.

Algorithm for identifying influential nodes in complex networks by integrating hierarchical k-shell decomposition with extended neighborhood analysis, validated against SIR propagation models.