Skip to main content

Stochastic Processes with Trend Stationarity in High-Clustered Growth Networks

  • Conference paper
  • First Online:
Intelligent Sustainable Systems (ICoISS 2023)

Abstract

Many social and media networks add new users and their connections as they evolve. One of the realistic models describing the growth of complex networks that takes into account the peculiarities of the local node clustering is the triadic closure model. In this paper, we study the stochastic process that represents the behavior of the average degree of all neighbors for a node in a network generated by the triadic closure model. It is known that the expected values of this local characteristic grow according to a power law. We show that the process is trend-stationary, and moreover, the dynamics of the variation coefficient of the average degree of the node’s neighbors tends to zero over time. We discuss the result applicability to the analysis of media and social networks.

Supported by the Russian Science Foundation, project 22-18-00153.

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 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.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. Barabási AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509–512. https://doi.org/10.1126/science.286.5439.509

    Article  MathSciNet  MATH  Google Scholar 

  2. Bianconi G, Darst RK, Iacovacci J, Fortunato S (2014) Triadic closure as a basic generating mechanism of communities in complex networks. Phys Rev E 90:042806. https://doi.org/10.1103/PhysRevE.90.042806

    Article  Google Scholar 

  3. Hibshman JI, Gonzalez D, Sikdar S, Weninger T (2021) Joint subgraph-to-subgraph transitions: generalizing triadic closure for powerful and interpretable graph modeling. In: Proceedings of the 14th ACM international conference on web search and data mining. WSDM ’21. Association for Computing Machinery, New York, NY, USA, pp 815–823. https://doi.org/10.1145/3437963.3441817

  4. Holme P, Kim BJ (2002) Growing scale-free networks with tunable clustering. Phys Rev E 65(2):026107. https://doi.org/10.1103/PhysRevE.65.026107

  5. Huang H, Tang J, Liu L, Luo J, Fu X (2015) Triadic closure pattern analysis and prediction in social networks. IEEE Trans Knowl Data Eng 27(12):3374–3389. https://doi.org/10.1109/TKDE.2015.2453956

    Article  Google Scholar 

  6. Mironov S, Sidorov S, Malinskii I (2021) Degree-degree correlation in networks with preferential attachment based growth. In: Teixeira AS, Pacheco D, Oliveira M, Barbosa H, Gonçalves B, Menezes R (eds) Complex networks XII. Springer International Publishing, Cham, pp 51–58. https://doi.org/10.1007/978-3-030-81854-8_5

  7. Peixoto TP (2022) Disentangling homophily, community structure, and triadic closure in networks. Phys Rev X 12:011004. https://doi.org/10.1103/PhysRevX.12.011004

    Article  Google Scholar 

  8. Piva GG, Ribeiro FL, Mata AS (2021) Networks with growth and preferential attachment: modelling and applications. J Complex Netw 9(1). https://doi.org/10.1093/comnet/cnab008

  9. Qu J, Wang SJ, Jusup M, Wang Z (2015) Effects of random rewiring on the degree correlation of scale-free networks. Sci Rep 5:15450. https://doi.org/10.1038/srep15450

    Article  Google Scholar 

  10. Sidorov S, Mironov S, Grigoriev A, Tikhonova S (2022) An investigation into the trend stationarity of local characteristics in media and social networks. Systems 10(6):249. https://doi.org/10.3390/systems10060249

    Article  Google Scholar 

  11. Sidorov S, Mironov S, Tyshkevich S (2022) Surprising behavior of the average degree for a node’s neighbors in growth networks. In: Benito RM, Cherifi C, Cherifi H, Moro E, Rocha LM, Sales-Pardo M (eds) Complex networks & their applications X. Springer International Publishing, Cham, pp 463–474. https://doi.org/10.1007/978-3-030-93409-5_39

  12. Yang M, Chen X, Zhao M, Du Y, Li X (2021) Dynamic social network embedding based on triadic closure pattern analysis. In: 2021 20th international conference on ubiquitous computing and communications (IUCC/CIT/DSCI/SmartCNS). IEEE, pp 302–308. https://doi.org/10.1109/IUCC-CIT-DSCI-SmartCNS55181.2021.00057

  13. Yao D, van der Hoorn P, Litvak N (2018) Average nearest neighbor degrees in scale-free networks. Internet Math 2018:1–38. https://doi.org/10.24166/im.02.2018

  14. Zhou L, Yang Y, Ren X, Wu F, Zhuang Y (2018) Dynamic network embedding by modeling triadic closure process. In: Proceedings of the AAAI conference on artificial intelligence, vol 32, no 1. https://doi.org/10.1609/aaai.v32i1.11257

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sergei Sidorov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sidorov, S., Mironov, S., Tikhonova, S. (2023). Stochastic Processes with Trend Stationarity in High-Clustered Growth Networks. In: Raj, J.S., Perikos, I., Balas, V.E. (eds) Intelligent Sustainable Systems. ICoISS 2023. Lecture Notes in Networks and Systems, vol 665. Springer, Singapore. https://doi.org/10.1007/978-981-99-1726-6_21

Download citation

Publish with us

Policies and ethics