Skip to main content

An Evolving Network Model from Clique Extension

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2022)

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

Included in the following conference series:

Abstract

We consider a new model for complex networks whose underlying mechanism is extending dense subgraphs. In the frustum model, we iteratively extend cliques over discrete-time steps. For many choices of the underlying parameters, graphs generated by the model densify over time. In the special case of the cone model, generated graphs provably satisfy properties observed in real-world complex networks such as the small world property and bad spectral expansion. We finish with a set of open problems and next steps for the frustum model.

Research supported by grants from NSERC and the Fields Institute.

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 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. Aksoy, S.G., Joslyn, C., Ortiz Marrero, C., Praggastis, B., Purvine, E.: Hypernetwork science via high-order hypergraph walks. EPJ Data Sci. 9(1), 1–34 (2020). https://doi.org/10.1140/epjds/s13688-020-00231-0

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Behague, N., Bonato, A., Huggan, M.A., Malik, R., Marbach, T.G.: The iterated local transitivity model for hypergraphs (2022)

    Google Scholar 

  4. Benson, A.R., Gleich, D.F., Leskovec, J.: Higher-order organization of complex networks. Science 353, 163–166 (2016)

    Article  Google Scholar 

  5. Bollobás, B., Riordan, O., Spencer, J., Tusnády, G.: The degree sequence of a scale-free random graph process. Random Struct. Algorithms 18, 279–290 (2001)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  7. Bonato, A., Chuangpishit, H., English, S., Kay, B., Meger, E.: The iterated local model for social networks. Discret. Appl. Math. 284, 555–571 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  8. Bonato, A., Cranston, D.W., Huggan, M.A., Marbach, T., Mutharasan, R.: The iterated local directed transitivity model for social networks. In: Kamiński, B., Prałat, P., Szufel, P. (eds.) WAW 2020. LNCS, vol. 12091, pp. 111–123. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-48478-1_8

    Chapter  Google Scholar 

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

    Article  MATH  Google Scholar 

  10. Bonato, A., Infeld, E., Pokhrel, H., Prałat, P.: Common adversaries form alliances: modelling complex networks via anti-transitivity. In: Bonato, A., Chung Graham, F., Prałat, P. (eds.) WAW 2017. LNCS, vol. 10519, pp. 16–26. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-67810-8_2

    Chapter  Google Scholar 

  11. Bonato, A., Meger, E.: Iterated global models for complex networks. In: Kamiński, B., Prałat, P., Szufel, P. (eds.) WAW 2020. LNCS, vol. 12091, pp. 135–144. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-48478-1_10

    Chapter  Google Scholar 

  12. Bonato, A., Tian, A.: Complex networks and social networks, invited book chapter. In: Kranakis, E. (ed.) Social Networks. Springer, Cham (2011)

    Google Scholar 

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

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  15. Estrada, E.: Spectral scaling and good expansion properties in complex networks. Europhys. Lett. 73, 649–655 (2006)

    Article  MathSciNet  Google Scholar 

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

  17. West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Hoboken (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

© 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

Bonato, A., Cushman, R., Marbach, T.G., Zhang, Z. (2022). An Evolving Network Model from Clique Extension. In: Zhang, Y., Miao, D., Möhring, R. (eds) Computing and Combinatorics. COCOON 2022. Lecture Notes in Computer Science, vol 13595. Springer, Cham. https://doi.org/10.1007/978-3-031-22105-7_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-22105-7_38

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics