Skip to main content
SpringerLink
Log in

Clusters of Exceedances for Evolving Random Graphs

  • Conference paper
  • First Online:
Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13766 ))

  • 295 Accesses

Abstract

Evolution of random undirected graphs by the clustering attachment (CA) without node and edge deletion and with uniform node deletion is investigated. The CA causes clusters of consecutive exceedances of the modularity over a sufficiently high threshold. The modularity is a measure that allows us to divide graphs into communities. It shows the connectivity of nodes in the community. An extremal index (a local dependence measure) approximates the mean cluster size of exceedances over a sufficiently high threshold. Considering the change of the modularity at each evolution step, the extremal index of the latter random sequence indicates the consecutive large connectivity of nodes and thus, it reflects the community appearance during the network evolution. This allows to consider the community structure of the network from perspectives of the extreme value analysis. By simulation study we show that estimates of the extremal index of the modularity and the tail index of node degrees depend on the CA parameters. The latter estimates are compared both for evolution without node and edge deletion and with uniform node deletion.

The reported study was funded by the Russian Science Foundation RSF, project number 22-21-00177 (recipient N.M. Markovich, conceptualization, methodology development, formal analysis, writing–original draft preparation; recipient M.S.Ryzhov, software, data validation).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Ghoshal, G., Chi, L., Barabási, A.L.: Uncovering the role of elementary processes in network evolution. Sci. Rep. 3, 2920 (2013)

    Article  Google Scholar 

  2. Norros, I., Reittu, H.: On a conditionally Poissonian graph process. Adv. Appl. Prob. (SGSA) 38, 59–75 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Wan, P., Wang, T., Davis, R.A., Resnick, S.I.: Are extreme value estimation methods useful for network data? Extremes 23, 171–195 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bagrow, J., Brockmann, D.: Natural emergence of clusters and bursts in network evolution. Phys. Rev. X. 3, 021016 (2012). https://doi.org/10.1103/PhysRevX.3.021016

    Article  Google Scholar 

  5. Gao, P., Van Der Hofstad, R., Southwell, A., Stegehuis, C.: Counting triangles in power-law uniform random graphs. Electron. J. Comb. 27(3), 1–21 (2020)

    MathSciNet  MATH  Google Scholar 

  6. Weedage, L., Litvak, N., Stegehuis, C.: Locating highly connected clusters in large networks with HyperLogLog counters. J. Compl. Netw. 9(2), cnab023 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75–174 (2010)

    Article  MathSciNet  Google Scholar 

  8. Clauset, A., Newman, M.E., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(6), 066111 (2004). https://doi.org/10.1103/PhysRevE.70.066111

    Article  Google Scholar 

  9. Dugu\(\acute{e}\), N., Prerz, A.: Directed Louvain : maximizing modularity in directed networks. Research Report] Universit\(\acute{e}\) d’Orl\(\acute{e}\)ans. hal-01231784 (2015)

    Google Scholar 

  10. Leadbetter, M.R.: Extremes and local dependence in stationary sequences. Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 65(2), 291–306 (1983). https://doi.org/10.1007/BF00532484

    Article  MathSciNet  MATH  Google Scholar 

  11. Hill, B.M.: A simple general approach to inference about the tail of a distribution. Ann. Statist. 3, 1163–1174 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  12. Markovich, N.M.: Nonparametric Analysis of Univariate Heavy-Tailed data: Research and Practice. Wiley, Chichester, West Sussex (2007)

    Book  MATH  Google Scholar 

  13. Ferro, C.A.T., Segers, J.: Inference for clusters of extreme values. J. R. Statist. Soc. B. 65, 545–556 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  14. Markovich N.M., Rodionov I.V.: Threshold selection for extremal index estimation. ArXiv e-prints, arXiv:2009.02318 (2020)

  15. Censor-Hillel, K., Shachnai, H.: Partial information spreading with application to distributed maximum coverage. In: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (PODC 2010), pp. 161–170. ACM, New York, USA (2010). https://doi.org/10.1145/1835698.1835739

Download references

Author information

Authors and Affiliations

  1. V.A. Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Profsoyuznaya Str. 65, 117997, Moscow, Russia

    Natalia M. Markovich & Maksim S. Ryzhov

Authors
  1. Natalia M. Markovich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maksim S. Ryzhov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Natalia M. Markovich .

Editor information

Editors and Affiliations

  1. V. A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences, Moscow, Russia

    Vladimir M. Vishnevskiy

  2. Peoples' Friendship University of Russia, Moscow, Russia

    Konstantin E. Samouylov

  3. V. A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences, Moscow, Russia

    Dmitry V. Kozyrev

Rights and permissions

Reprints and permissions

Copyright information

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

Markovich, N.M., Ryzhov, M.S. (2022). Clusters of Exceedances for Evolving Random Graphs. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds) Distributed Computer and Communication Networks: Control, Computation, Communications. DCCN 2022. Lecture Notes in Computer Science, vol 13766 . Springer, Cham. https://doi.org/10.1007/978-3-031-23207-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-23207-7_6

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation