Normalized sombor indices as complexity measures of random networks Articles uri icon

publication date

  • August 2021

start page

  • 976

end page

  • 983

issue

  • 8

volume

  • 23

International Standard Serial Number (ISSN)

  • 1099-4300

abstract

  • We perform a detailed computational study of the recently introduced Sombor indices on random networks. Specifically, we apply Sombor indices on three models of random networks: Erdös-Rényi networks, random geometric graphs, and bipartite random networks. Within a statistical random matrix theory approach, we show that the average values of Sombor indices, normalized to the order of the network, scale with the average degree. Moreover, we discuss the application of average Sombor indices as complexity measures of random networks and, as a consequence, we show that selected normalized Sombor indices are highly correlated with the Shannon entropy of the eigenvectors of the adjacency matrix.

keywords

  • computational analysis of networks; degree¿based topological indices; random networks; sombor indices