Skip to main content
SpringerLink
Log in

Leader Nodes in Communities for Information Spreading

  • Conference paper
  • First Online:
Distributed Computer and Communication Networks (DCCN 2020)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 12563))

Abstract

The paper is devoted to the effective information spreading in random complex networks. Our objective is to elect leader nodes or communities of the network, which may spread the content among all nodes faster. We consider a well-known SPREAD algorithm by Mosk-Aoyama and Shah (2006), which provides the spreading and the growth of the node set possessing the information. Assuming that all nodes have asynchronous clocks, the next node is chosen uniformly among nodes of the network by the global clock tick according to a Poisson process. The extremal index measures the clustering tendency of high threshold exceedances. The node extremal index shows the ability to attract highly ranked nodes in the node orbit. Considering a closeness centrality as a measure of a node’s leadership, we find the relation between its extremal index and the minimal spreading time.

The reported study was partly funded by RFBR, project number 19-01-00090 (recipient N. M. Markovich, conceptualization, mathematical model development, methodology development; recipient M. S. Ryzhov, numerical analysis, 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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Caers, J., Beirlant, J., Vynckier, P.: Bootstrap confidence intervals for tail indices. Comput. Stat. Data Anal. 26(3), 259–277 (1998). https://doi.org/10.1016/S0167-9473(97)00033-9

  2. 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 (2010). https://doi.org/10.1145/1835698.1835739

  3. 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 

  4. Dekkers, A.L.M., Einmahl, J.H.J., De Haan, L.: A moment estimator for the index of an extreme-value distribution. Ann. Stat. 17(4), 1833–1855 (1989). https://doi.org/10.1214/aos/1176347397

    Article  MathSciNet  MATH  Google Scholar 

  5. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959). https://doi.org/10.1007/BF01386390

    Article  MathSciNet  MATH  Google Scholar 

  6. Ferro, C., Segers, J.: Inference for clusters of extreme values. J. R. Stat. Soc. B 65(2), 545–556 (2003). https://doi.org/10.1111/1467-9868.00401

    Article  MathSciNet  MATH  Google Scholar 

  7. Giraitis, L., Leipus, R., Philippe, A.: A test for stationarity versus trend and unit root for a wide class of dependent errors. Econ. Theory 22, 989–1029 (2006). https://doi.org/10.1017/S026646660606049X

    Article  MathSciNet  MATH  Google Scholar 

  8. Hall, P.: Using the bootstrap to estimate mean squared error and select smoothing parameter in nonparametric problems. J. Multivar. Anal. 32, 177–203 (1990). https://doi.org/10.1016/0047-259X(90)90080-2

    Article  MathSciNet  MATH  Google Scholar 

  9. Holme, P., Litvak, N.: Cost-efficient vaccination protocols for network epidemiology. PLoS Comput. Biol. 13(9) (2017). https://doi.org/10.1371/journal.pcbi.1005696

  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. Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6(1) (2008). https://doi.org/10.1080/15427951.2009.10129177

  12. Markovich, N.M., Ryzhov, M.S., Krieger, U.R.: Nonparametric analysis of extremes on web graphs: PageRank versus Max-Linear model. CCIS 700, 13–26 (2017). https://doi.org/10.1007/978-3-319-66836-9_2

    Article  MATH  Google Scholar 

  13. Markovich, N.M., Ryzhov, M.S., Krieger, U.R.: Statistical clustering of a random network by extremal properties. CCIS 919, 71–82 (2018). https://doi.org/10.1007/978-3-319-99447-5_7

    Article  Google Scholar 

  14. Mosk-Aoyama, D., Shah, D.: Computing separable functions via gossip. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing (PODC 2006), pp. 113–122. ACM, New York (2006). https://doi.org/10.1145/1146381.1146401

  15. Newman, M.E.J.: Networks: An Introduction, 2nd edn. Oxford University Press, Oxford (2018). ISBN-10:0198805098

    Google Scholar 

  16. Penrose, M.: Random Geometric Graphs. Oxford Studies in Probability (2003). https://doi.org/10.1093/acprof:oso/9780198506263.001.0001

  17. Stephenson, K., Zelen, M.: Rethinking centrality: methods and examples. Soc. Netw. 11(1), 1–37 (1989). https://doi.org/10.1016/0378-8733(89)90016-6

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Natalia M. Markovich & Maxim S. Ryzhov

Authors
  1. Natalia M. Markovich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maxim S. Ryzhov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Natalia M. Markovich or Maxim S. Ryzhov .

Editor information

Editors and Affiliations

  1. Institute of Control Sciences of the Russian Academy of Sciences, Moscow, Russia

    Vladimir M. Vishnevskiy

  2. RUDN University, Moscow, Russia

    Konstantin E. Samouylov

  3. Institute of Control Sciences of the Russian Academy of Sciences, Moscow, Russia

    Dmitry V. Kozyrev

Rights and permissions

Reprints and permissions

Copyright information

© 2020 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. (2020). Leader Nodes in Communities for Information Spreading. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds) Distributed Computer and Communication Networks. DCCN 2020. Lecture Notes in Computer Science(), vol 12563. Springer, Cham. https://doi.org/10.1007/978-3-030-66471-8_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-66471-8_36

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-66470-1

  • Online ISBN: 978-3-030-66471-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation