Skip to main content

DynamicScore: A Novel Metric for Quantifying Graph Dynamics

  • Conference paper
  • First Online:
Complex Networks & Their Applications XII (COMPLEX NETWORKS 2023)

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

Included in the following conference series:

  • 812 Accesses

Abstract

This study introduces a new metric called “DynamicScore” to evaluate the dynamics of graphs. It can be applied to both vertices and edges. Unlike traditional metrics, DynamicScore not only measures changes in the number of vertices or edges between consecutive time steps, but also takes into account the composition of these sets. To illustrate the possible contributions of this metric, we calculate it for increasing networks of preferential attachment (Barabási-Albert model) and Edge-Markovian graphs. The results improve our understanding of the dynamics inherent in these generated evolving graphs.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.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

Notes

  1. 1.

    In [3], this metric was referred to as ‘nervousness,’ a translation of a French term that could be misleading in English.

  2. 2.

    there are \(n(n-1)/2\) such edges.

References

  1. Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  2. Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.: Complex networks: structure and dynamics. Phys. Rep. 424(4–5), 175–308 (2006)

    Article  MathSciNet  Google Scholar 

  3. Bridonneau, V., Guinand, F., Pigné, Y.: Dynamic Graphs Generators Analysis : An Illustrative Case Study. LITIS, Le Havre Normandie University, Tech. rep. (2022)

    Google Scholar 

  4. Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. In: Frey, H., Li, X., Ruehrup, S. (eds.) Ad-hoc, Mobile, and Wireless Networks, pp. 346–359. Springer, Berlin Heidelberg (2011). https://doi.org/10.1007/978-3-642-22450-8_27

    Chapter  Google Scholar 

  5. Clementi, A.E.F., Macci, C., Monti, A., Pasquale, F., Silvestri, R.: Flooding time of edge-Markovian evolving graphs. SIAM J. Discret. Math. 24(4), 1694–1712 (2010)

    Article  MathSciNet  Google Scholar 

  6. Ferreira, A., Viennot, L.: A note on models, algorithms, and data structures for dynamic communication networks. Report, INRIA (2002). https://hal.inria.fr/inria-00072185

  7. Harary, F., Gupta, G.: Dynamic graph models. Math. Comput. Model. 25(7), 79–87 (1997)

    Article  MathSciNet  Google Scholar 

  8. Holme, P., Saramäki, J.: Temporal networks. Phys. Rep. 519(3), 97–125 (2012). Temporal Networks

    Google Scholar 

  9. Kostakos, V.: Temporal graphs. Phys. A 388(6), 1007–1023 (2009)

    Article  MathSciNet  Google Scholar 

  10. Xuan, B.B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. Found. Comput. Sci. 14(02), 267–285 (2003)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Guinand Frédéric .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 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

Vincent, B., Frédéric, G., Yoann, P. (2024). DynamicScore: A Novel Metric for Quantifying Graph Dynamics. In: Cherifi, H., Rocha, L.M., Cherifi, C., Donduran, M. (eds) Complex Networks & Their Applications XII. COMPLEX NETWORKS 2023. Studies in Computational Intelligence, vol 1142. Springer, Cham. https://doi.org/10.1007/978-3-031-53499-7_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-53499-7_35

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics