2016/08/16 by K. P. Sinha, Olivier de Weck, Sinha, Kaushik +1
Computer Science · Physics and Astronomy · #05C50 #Combinatorics (math.CO) #Complex Network Analysis Techniques #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Interconnection Networks and Systems #Physics and Society (physics.soc-ph) #Social and Information Networks (cs.SI) #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.1608.08456
openalex publication_date 2016/08/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The complexity of highly interconnected systems is rooted in the interwoven architecture defined by its connectivity structure. In this paper, we develop matrix energy of the underlying connectivity structure as a measure of topological complexity and highlight interpretations about certain global features of underlying system connectivity patterns. The proposed complexity metric is shown to satisfy the Weyuker criteria as a measure of its validity as a formal complexity metric. We also introduce the notion of P point in the graph density space. The P point acts as a boundary between multiple connectivity regimes for finite-size graphs.