Skip to main content

The Iterated Local Directed Transitivity Model for Social Networks

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12091))

Abstract

We introduce a new, deterministic directed graph model for social networks, based on the transitivity of triads. In the Iterated Local Directed Transitivity (ILDT) model, new nodes are born over discrete time-steps and inherit the link structure of their parent nodes. The ILDT model may be viewed as a directed graph analog of the ILT model for undirected graphs introduced in [4]. We investigate network science and graph-theoretical properties of ILDT digraphs. We prove that the ILDT model exhibits a densification power law, so that the digraphs generated by the models densify over time. The number of directed triads are investigated, and counts are given of the number of directed 3-cycles and transitive 3-cycles. A higher number of transitive 3-cycles are generated by the ILDT model, as found in real-world, on-line social networks that have orientations on their edges. We discuss the eigenvalues of the adjacency matrices of ILDT digraphs. We finish by showing that in many instances of the chosen initial digraph, the model eventually generates digraphs with Hamiltonian directed cycles.

The first author acknowledges funding from an NSERC Discovery grant, while the third author acknowledges support from an NSERC Postdoctoral Fellowship.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

References

  1. Bonato, A.: A Course on the Web Graph. Graduate Studies Series in Mathematics. American Mathematical Society, Providence (2008)

    Book  Google Scholar 

  2. Bonato, A., Chuangpishit, H., English, S., Kay, B., Meger, E.: The iterated local model for social networks. Discrete Applied Mathematics (accepted)

    Google Scholar 

  3. Bonato, A., Hadi, N., Horn, P., Prałat, P., Wang, C.: A dynamic model for on-line social networks. In: Avrachenkov, K., Donato, D., Litvak, N. (eds.) WAW 2009. LNCS, vol. 5427, pp. 127–142. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-540-95995-3_11

    Chapter  MATH  Google Scholar 

  4. Bonato, A., Hadi, N., Horn, P., Prałat, P., Wang, C.: Models of on-line social networks. Internet Math. 6, 285–313 (2011)

    Article  Google Scholar 

  5. Bonato, A., Tian, A.: Complex networks and social networks. In: Kranakis, E. (ed.) Social Networks. Mathematics in Industry, vol. 18, pp. 269–286. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-30904-5_12

    Chapter  Google Scholar 

  6. Chung, F.R.K.: Spectral Graph Theory. American Mathematical Society, Providence (1997)

    MATH  Google Scholar 

  7. Chung, F.R.K., Lu, L.: Complex Graphs and Networks. American Mathematical Society, Providence (2006)

    Book  Google Scholar 

  8. Chung, F.R.K., Dewey, G., Galas, D.J., Lu, L.: Duplication models for biological networks. J. Comput. Biol. 10, 677–688 (2003)

    Article  Google Scholar 

  9. Easley, D., Kleinberg, J.: Networks, Crowds, and Markets Reasoning About a Highly Connected World. Cambridge University Press, Cambridge (2010)

    Book  Google Scholar 

  10. Guha, R.V., Kumar, R., Raghavan, P., Tomkins, A.: Propagation of trust and distrust. In: Proceedings of WWW (2004)

    Google Scholar 

  11. Heider, F.: The Psychology of Interpersonal Relations. John Wiley, New York (1958)

    Book  Google Scholar 

  12. Huang, J., Shen, H., Hou, L., Cheng, X.: Signed graph attention networks. In: Proceedings of Artificial Neural Networks and Machine Learning – ICANN (2019)

    Google Scholar 

  13. Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Stochastic models for the web graph. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (2000)

    Google Scholar 

  14. Leskovec, J., Huttenlocher, D.P., Kleinberg, J.M.: Signed networks in social media. In: Proceedings of the ACM SIGCHI (2010)

    Google Scholar 

  15. Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2005)

    Google Scholar 

  16. Scott, J.P.: Social Network Analysis: A Handbook. Sage Publications Ltd., London (2000)

    Google Scholar 

  17. Small, L., Mason, O.: Information diffusion on the iterated local transitivity model of online social networks. Discrete Appl. Math. 161, 1338–1344 (2013)

    Article  MathSciNet  Google Scholar 

  18. Song, D., Meyer, D.A.: A model of consistent node types in signed directed social networks. In: Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (2014)

    Google Scholar 

  19. West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anthony Bonato .

Editor information

Editors and Affiliations

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

Bonato, A., Cranston, D.W., Huggan, M.A., Marbach, T., Mutharasan, R. (2020). The Iterated Local Directed Transitivity Model for Social Networks. In: Kamiński, B., Prałat, P., Szufel, P. (eds) Algorithms and Models for the Web Graph. WAW 2020. Lecture Notes in Computer Science(), vol 12091. Springer, Cham. https://doi.org/10.1007/978-3-030-48478-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-48478-1_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-48477-4

  • Online ISBN: 978-3-030-48478-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics