Skip to main content
Log in

\(\text {BC}_{\mathrm {DCN}}\): a new edge centrality measure to identify and rank critical edges pertaining to SIR diffusion in complex networks

  • Original Article
  • Published:
Social Network Analysis and Mining Aims and scope Submit manuscript

Abstract

The identification of critical nodes and edges is essential for understanding the structural and functional aspects of complex networks. Like nodes, edges play a vital role in the structural organization of the complex systems and diffusion of the contagion. However, the identification of critical links traditionally has been given less attention compared to the identification of nodes. In this paper, we propose a new edge centrality measure derived from Betweenness Centrality, Degree, and Common Neighbourhood, namely \(\text {BC}_{\mathrm {DCN}}\). Experimental analysis on a variety of networks shows that \(\text {BC}_{\mathrm {DCN}}\) is capable of identifying those edges that facilitate Susceptible-Infected-Recovered (SIR) contagion diffusion. \(\text {BC}_{\mathrm {DCN}}\) also shows good and non-degrading performance in experiments designed to study the effect on network size and connectivity under successive edge removal. Theoretically and empirically, the time complexity of \(\text {BC}_{\mathrm {DCN}}\) is comparable to edge betweenness centrality, i.e., \(\mathcal {O}(|E||V|)\). Unlike other measures, \(\text {BC}_{\mathrm {DCN}}\) performs well on all three evaluation criteria, i.e., SIR diffusion simulation, successive edge removal experiments, and time complexity. It shows that the proposed method is fast and effective.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Availability of data and materials

Datasets and software library (networkx) is publicly available.

Code availability

Code is available on request.

References

  • Barnes R, Burkett T (2010) Structural redundancy and multiplicity in corporate networks. Int Netw Soc Netw Anal 30(2):4–20

    Google Scholar 

  • Beuming T, Skrabanek L, Niv MY, Mukherjee P, Weinstein H (2005) PDZBase: a protein–protein interaction database for PDZ-domains. Bioinformatics 21(6):827–828

    Google Scholar 

  • Brandes U (2001) A faster algorithm for betweenness centrality. J Math Sociol 25(2):163–177

    MATH  Google Scholar 

  • Cazals F, Karande C (2008) A note on the problem of reporting maximal cliques. Theor Comput Sci 407(1–3):564–568

    MathSciNet  MATH  Google Scholar 

  • Cheng XQ, Ren FX, Shen HW, Zhang ZK, Zhou T (2010) Bridgeness: a local index on edge significance in maintaining global connectivity. J Stat Mech Theory Exp 10:P10011

    Google Scholar 

  • Coleman JS (1964) Introduction to mathematical sociology. London Free Press, Glencoe

    Google Scholar 

  • De la Cruz CO, Matar M, Reichel L (2020) Edge importance in a network via line graphs and the matrix exponential. Numer Algorithms 83(2):807–832

    MathSciNet  MATH  Google Scholar 

  • De Meo P, Ferrara E, Fiumara G, Ricciardello A (2012) A novel measure of edge centrality in social networks. Knowl Based Syst 30:136–150

    Google Scholar 

  • Duch J, Arenas A (2005) Community detection in complex networks using extremal optimization. Phys Rev E 72(2):027104

    Google Scholar 

  • Eagle N, Sandy PA (2006) Reality mining: sensing complex social systems. Pers Ubiquitous Comput 10(4):255–268

    Google Scholar 

  • Eash RW, Chon KS, Lee YJ, Boyce DE (1983) Equilibrium traffic assignment on an aggregated highway network for sketch planning. Transp Res Rec 994:30–37

    Google Scholar 

  • Estrada E (2012) The structure of complex networks: theory and applications. Oxford University Press, Oxford

    MATH  Google Scholar 

  • Faust K (1997) Centrality in affiliation networks. Soc Netw 19(2):157–191

    Google Scholar 

  • Freeman LC, Webster CM, Kirke DM (1998) Exploring social structure using dynamic three-dimensional color images. Soc Netw 20(2):109–118

    Google Scholar 

  • Gao ZK, Small M, Kurths J (2017) Complex network analysis of time series. EPL (Europhys Lett) 116(5):50001

    Google Scholar 

  • Garas A, Schweitzer F, Havlin S (2012) A k-shell decomposition method for weighted networks. New J Phys 14(8):083030

    MATH  Google Scholar 

  • Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821–7826

    MathSciNet  MATH  Google Scholar 

  • Giuraniuc C, Hatchett J, Indekeu J, Leone M, Castillo IP, Van Schaeybroeck B, Vanderzande C (2005) Trading interactions for topology in scale-free networks. Phys Rev Lett 95(9):098701

    Google Scholar 

  • Guimera R, Danon L, Diaz-Guilera A, Giralt F, Arenas A (2003) Self-similar community structure in a network of human interactions. Phys Rev E 68(6):065103

    Google Scholar 

  • Hagberg AA, Schult DA, Swart PJ (2008) Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the 7th Python in science conference (SciPy2008), Pasadena, CA USA, pp 11–15

  • Hamann M, Lindner G, Meyerhenke H, Staudt CL, Wagner D (2016) Structure-preserving sparsification methods for social networks. Soc Netw Anal Min 6(1):22

    Google Scholar 

  • Hamers L et al (1989) Similarity measures in scientometric research: the Jaccard index versus Salton’s cosine formula. Inf Process Manag 25(3):315–18

    Google Scholar 

  • Han JDJ, Dupuy D, Bertin N, Cusick ME, Vidal M (2005) Effect of sampling on topology predictions of protein–protein interaction networks. Nat Biotechnol 23(7):839–844

    Google Scholar 

  • Hayes B (2006) Connecting the dots. Can the tools of graph theory and social-network studies unravel the next big plot? Am Sci 94(5):400–404

    Google Scholar 

  • Kanwar K, Kaushal S, Kumar H (2019) A hybrid node ranking technique for finding influential nodes in complex social networks. Library Hi Tech

  • Kendall MG (1945) The treatment of ties in ranking problems. Biometrika 33(3):239–251

    MathSciNet  MATH  Google Scholar 

  • Kimura M, Saito K, Motoda H (2009) Blocking links to minimize contamination spread in a social network. ACM Trans Knowl Discov Data (TKDD) 3(2):9

    Google Scholar 

  • Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys 6(11):888

    Google Scholar 

  • Knight WR (1966) A computer method for calculating Kendall’s tau with ungrouped data. J Am Stat Assoc 61(314):436–439

    MATH  Google Scholar 

  • Knuth DE (1993) The Stanford GraphBase: a platform for combinatorial computing, vol 37. Addison-Wesley, Reading

    MATH  Google Scholar 

  • Knuth DE (2008) The art of computer programming, volume 4, fascicle 0: introduction to combinatorial and Boolean functions. Addison-Wesley, Reading

    Google Scholar 

  • Kunegis J (2013a) KONECT—The Koblenz network collection. In: Proceedings of the international conference on world wide web companion, pp 1343–1350. http://userpages.uni-koblenz.de/~kunegis/paper/kunegis-koblenz-network-collection.pdf

  • Kunegis J (2013b) Konect: the Koblenz network collection. In: Proceedings of the 22nd international conference on world wide web. ACM, pp 1343–1350

  • Kunegis J (2013c) Konect: the Koblenz network collection. In: Proceedings of the 22nd international conference on world wide web, pp 1343–1350

  • Lam TW, Yue FL (1998) Edge ranking of graphs is hard. Discret Appl Math 85(1):71–86

    MathSciNet  MATH  Google Scholar 

  • Lambiotte R, Rosvall M, Scholtes I (2019) From networks to optimal higher-order models of complex systems. Nat Phys 15:1

    Google Scholar 

  • Leskovec J, Krevl A (2014) SNAP datasets: Stanford large network dataset collection. http://snap.stanford.edu/data

  • Liao H, Mariani MS, Medo M, Zhang YC, Zhou MY (2017) Ranking in evolving complex networks. Phys Rep 689:1–54

    MathSciNet  MATH  Google Scholar 

  • Lü L, Chen D, Ren XL, Zhang QM, Zhang YC, Zhou T (2016) Vital nodes identification in complex networks. Phys Rep 650:1–63

    MathSciNet  Google Scholar 

  • Lusseau D, Schneider K, Boisseau OJ, Haase P, Slooten E, Dawson SM (2003) The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav Ecol Sociobiol 54:396–405

    Google Scholar 

  • Melançon G, Sallaberry A (2008) Edge metrics for visual graph analytics: a comparative study. In: 2008 12th international conference information visualisation. IEEE, pp 610–615

  • Moody J (2001) Peer influence groups: identifying dense clusters in large networks. Soc Netw 23(4):261–283

    Google Scholar 

  • Nekovee M, Moreno Y, Bianconi G, Marsili M (2007) Theory of rumour spreading in complex social networks. Physica A 374(1):457–470

    Google Scholar 

  • Newman ME (2003) The structure and function of complex networks. SIAM Rev 45(2):167–256

    MathSciNet  MATH  Google Scholar 

  • Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036104

    MathSciNet  Google Scholar 

  • Nick B, Lee C, Cunningham P, Brandes U (2013) Simmelian backbones: amplifying hidden homophily in Facebook networks. In: Proceedings of the 2013 IEEE/ACM international conference on advances in social networks analysis and mining, pp 525–532

  • Pagani GA, Aiello M (2013) The power grid as a complex network: a survey. Physica A 392(11):2688–2700

    MathSciNet  MATH  Google Scholar 

  • Pastor-Satorras R, Castellano C, Van Mieghem P, Vespignani A (2015) Epidemic processes in complex networks. Rev Mod Phys 87:925–979. https://doi.org/10.1103/RevModPhys.87.925

    Article  MathSciNet  Google Scholar 

  • Rual JF, Venkatesan K, Hao T, Hirozane-Kishikawa T, Dricot A, Li N, Berriz GF, Gibbons FD, Dreze M, Ayivi-Guedehoussou N (2005) Towards a proteome-scale map of the human protein–protein interaction network. Nature 7062:1173–1178

    Google Scholar 

  • Saito K, Kimura M, Ohara K, Motoda H (2016) Detecting critical links in complex network to maintain information flow/reachability. In: Pacific rim international conference on artificial intelligence. Springer, pp 419–432

  • Shah N, Beutel A, Hooi B, Akoglu L, Gunnemann S, Makhija D, Kumar M, Faloutsos C (2016) Edgecentric: anomaly detection in edge-attributed networks. In: 2016 IEEE 16th international conference on data mining workshops (ICDMW). IEEE, pp 327–334

  • Wang JW, Rong LL (2009) Edge-based-attack induced cascading failures on scale-free networks. Physica A 388(8):1731–1737

    MathSciNet  Google Scholar 

  • Wang Z, He J, Nechifor A, Zhang D, Crossley P (2017) Identification of critical transmission lines in complex power networks. Energies 10(9):1294

    Google Scholar 

  • Webber W, Moffat A, Zobel J (2010) A similarity measure for indefinite rankings. ACM Trans Inf Syst (TOIS) 28(4):20

    Google Scholar 

  • Wong P, Sun C, Lo E, Yiu ML, Wu X, Zhao Z, Chan THH, Kao B (2017) Finding k most influential edges on flow graphs. Inf Syst 65:93–105

    Google Scholar 

  • Yan R, Li D, Wu W, Du DZ, Wang Y (2019a) Minimizing influence of rumors by blockers on social networks: algorithms and analysis. IEEE Trans Netw Sci Eng 7:1067–1078

    MathSciNet  Google Scholar 

  • Yan R, Li Y, Wu W, Li D, Wang Y (2019b) Rumor blocking through online link deletion on social networks. ACM Trans Knowl Discov Data (TKDD) 13(2):16

    Google Scholar 

  • Yu EY, Chen DB, Zhao JY (2018) Identifying critical edges in complex networks. Sci Rep 8(1):14469

    Google Scholar 

  • Zachary W (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33:452–473

    Google Scholar 

  • Zareie A, Sheikhahmadi A (2018) A hierarchical approach for influential node ranking in complex social networks. Expert Syst Appl 93:200–211

    Google Scholar 

  • Zeng A, Shen Z, Zhou J, Wu J, Fan Y, Wang Y, Stanley HE (2017) The science of science: from the perspective of complex systems. Phys Rep 714:1–73

    MathSciNet  MATH  Google Scholar 

  • Zhang J, Song B, Zhang Z, Liu H (2014) An approach for modeling vulnerability of the network of networks. Physica A 412:127–136

    Google Scholar 

  • Zhao N, Li J, Wang J, Li T, Yu Y, Zhou T (2020) Identifying significant edges via neighborhood information. Physica A 548:123877

    Google Scholar 

  • Zhu H, Yin X, Ma J, Hu W (2016) Identifying the main paths of information diffusion in online social networks. Physica A 452:320–328

    Google Scholar 

Download references

Funding

This work is supported by Ministry of Electronics & Information Technology (MeitY), Government of India under Visvesvaraya PhD Scheme for Electronics & IT.

Author information

Authors and Affiliations

Authors

Contributions

Equal contribution.

Corresponding author

Correspondence to Kushal Kanwar.

Ethics declarations

Conflict of interests

The authors declare that they have no conflict of interest.

Consent for publication

The publication has been approved by all co-authors.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kanwar, K., Kaushal, S., Kumar, H. et al. \(\text {BC}_{\mathrm {DCN}}\): a new edge centrality measure to identify and rank critical edges pertaining to SIR diffusion in complex networks. Soc. Netw. Anal. Min. 12, 49 (2022). https://doi.org/10.1007/s13278-022-00876-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s13278-022-00876-x

Keywords

Navigation