Skip to main content

Delta Density: Comparison of Different Sized Networks Irrespective of Their Size

  • Conference paper
  • First Online:
Complex Networks and Their Applications XI (COMPLEX NETWORKS 2016 2022)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 1078))

Included in the following conference series:

  • 1398 Accesses

Abstract

Two typical characteristics of networks are average degree and density. Both characteristics are related, but using the second one does not provide easily interpretable information when analyzing differently sized networks. This paper deals with the measurement of network density with the possibility of comparing networks of different sizes. We point out the problems of the classical approach and, in response, introduce a new measure called \(\Delta \)-density. The theoretical background of \(\Delta \)-density is accompanied by a practical application example. We use five real networks with temporal information in the experiments to analyze the evolution of \(\Delta \)-density.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 349.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 449.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 449.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Laurienti, P., Joyce, K., Telesford, Q., Burdette, J., Hayasaka, S.: Universal fractal scaling of self-organized networks. Nat. Precedings 5 (2010)

    Google Scholar 

  2. Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations (2005)

    Google Scholar 

  3. Self-similar scaling of density in complex real-world networks. Phys. A Stat. Mech. Appl. 391(8), 2794–2802 (2012)

    Google Scholar 

  4. Yin, H., Benson, A., Leskovec, J.: The local closure coefficient: a new perspective on network clustering, pp. 303–311 (2019)

    Google Scholar 

  5. van Wijk, B., Stam, C., Daffertshofer, A.: Comparing brain networks of different size and connectivity density using graph theory. PloS One 5, e13701 (2010)

    Google Scholar 

  6. Anderson, B., Butts, C., Carley, K., Heinz, H.: The interaction of size and density with graph-level indices Ž . Social Netw. 21, 239–267 (1999)

    Google Scholar 

Download references

Acknowledgements

This work is partially supported by SGS, VSB-Technical University of Ostrava, under the grant no. SP2022/77 and Ministry of Health of the Czech Republic under grants no. NU20-06-00269, NU21-06-00370.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jakub Plesnik .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Plesnik, J., Kubikova, K., Kudelka, M. (2023). Delta Density: Comparison of Different Sized Networks Irrespective of Their Size. In: Cherifi, H., Mantegna, R.N., Rocha, L.M., Cherifi, C., Micciche, S. (eds) Complex Networks and Their Applications XI. COMPLEX NETWORKS 2016 2022. Studies in Computational Intelligence, vol 1078. Springer, Cham. https://doi.org/10.1007/978-3-031-21131-7_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-21131-7_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-21130-0

  • Online ISBN: 978-3-031-21131-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics