Complex Network Analysis Techniques
External reference: https://openalex.org/T10064
- DerStandard dataset spans ten years of comments and votes
- Ontology-guided LLMs extract cybersecurity knowledge graphs from logs
-
Algorithm enumerates maximal balanced quasi-cliques in signed graphs 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.
-
Graph correlations test independence between binary networks Framework for testing conditional and unconditional independence between binary graphs using community correlations and graph encoder embeddings.
-
Model identifies roles and trade-offs in multiplex networks Framework for identifying roles in multiplex networks by modeling trade-offs across layers while accounting for independence, dependence, and interdependence mechanisms.
-
Rumor model identifies thresholds for extinction and persistence Mathematical analysis of rumor propagation using compartmental models with reproduction numbers and control strategies for misinformation mitigation through fact-checking and contact reduction.
-
HKEN improved influential-node identification in network tests Algorithm for identifying influential nodes in complex networks by integrating hierarchical k-shell decomposition with extended neighborhood analysis, validated against SIR propagation models.