References

ANRD15

Nesreen K. Ahmed, Jennifer Neville, Ryan A. Rossi, and Nick Duffield. Efficient Graphlet Counting for Large Networks. In 2015 IEEE International Conference on Data Mining, 1–10. Atlantic City, NJ, USA, 2015. IEEE. doi:10.1109/ICDM.2015.141.

BBPastorSatorrasV04

A. Barrat, M. Barthelemy, R. Pastor-Satorras, and A. Vespignani. The architecture of complex weighted networks. Proceedings of the National Academy of Sciences, 101(11):3747–3752, 2004. doi:10.1073/pnas.0400087101.

VBM+21

Nicolò Vallarano, Matteo Bruno, Emiliano Marchese, Giuseppe Trapani, Fabio Saracco, Giulio Cimini, Mario Zanon, and Tiziano Squartini. Fast and scalable likelihood maximization for Exponential Random Graph Models with local constraints. Scientific Reports, 11(1):15227, 2021. doi:10.1038/s41598-021-93830-4.

WS98

D. J. Watts and S. H. Strogatz. Collective dynamics of `small-world' networks. Nature, 393(6684):440, 1998. doi:10.1038/30918.

YBL19

Hao Yin, Austin R. Benson, and Jure Leskovec. The Local Closure Coefficient: A New Perspective On Network Clustering. In Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, 303–311. Melbourne VIC Australia, 2019. ACM. doi:10.1145/3289600.3290991.