Properties and Performance of the ABCDe Random Graph Model with Community Structure

Fisher, Ronald A., and Frank Yates. Statistical tables for biological, agricultural and medical research. Oliver and Boyd Ltd, London, 1943

1943

Earlier work this paper cites.

Gene M. Amdahl. 1967. Validity of the single processor approach to achieving large scale computing capabilities. In Proceedings of the April 18-20, 1967, spring joint computer conference (AFIPS ’67 (Spring)). Association for Computing Machinery, New York, NY, USA, 483–485. https://doi.org/10.1145/1465482.1465560

1967

Earlier work this paper cites.

L. Freeman. “A set of measures of centrality based on betweenness”. Sociometry (1977)

1977

Earlier work this paper cites.

L. Freeman. “Centrality in social networks: conceptual clarification”. Soc. Networks 1

1979

Earlier work this paper cites.

Bollobás, B.: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European Journal of Combinatorics, 1, 311–316 (1980)

1980

Earlier work this paper cites.

Watts, Duncan J., and Steven H. Strogatz. ”Collective dynamics of ‘small-world’networks.” nature 393, no. 6684 (1998): 440-442

1998

Earlier work this paper cites.

S. Brin and L. Page. “The anatomy of a large-scale hypertextual Web search engine”. Comput. Networks ISDN Systems 30(1-7)

1998

Earlier work this paper cites.

R. Pastor-Satorras, A. Vazquez, A. Vespignani. “Dynamical and correlation properties of the Internet”. Phys. Rev. Lett. 87

2001

Earlier work this paper cites.

M.E.J. Newman. “Assortative mixing in networks”. Phys. Rev. Lett. 89

2002

Cited alongside, same era.

M.E.J. Newman, M. Girvan. “Finding and evaluating community structure in networks”. Phys. Rev. E . 2004; 69: 026–113

2004

Cited alongside, same era.

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

2006

Cited alongside, same era.

A. Lancichinetti, S. Fortunato, and F. Radicchi. Benchmark graphs for testing community detection algorithms. Phys. Rev. E, 78(4), 2008

2008

Cited alongside, same era.

V.D. Blondel, J-L. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment, 2008(10):P10008, 2008

2008

Cited alongside, same era.

Maria Chiara Angelini, Francesco Caltagirone, Florent Krzakala, and Lenka Zdeborová. Spectral detection on sparse hypergraphs. In 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), pages 66–73. IEEE, 2015

2015

Later among the works it cites.

Bezanson, J., Edelman, A., Karpinski, S., and Shah, V.: Julia: A fresh approach to numerical computing. SIAM Review, 69, 65–98 (2017)

2017

Later among the works it cites.

T. Kumar, S. Vaidyanathan, H. Ananthapadmanabhan, S. Parthasarathy and B. Ravindran, A New Measure of Modularity in Hypergraphs: Theoretical Insights and Implications for Effective Clustering. In: Cherifi H., Gaito S., Mendes J., Moro E., Rocha L. (eds) Complex Networks and Their Applications VIII. COMPLEX NETWORKS 2019. Studies in Computational Intelligence, vol 881. Springer, Cham

2019

Later among the works it cites.

B. Kamiński, P. Prałat, and F. Théberge, Artificial Benchmark for Community Detection (ABCD)—Fast Random Graph Model with Community Structure, Network Science 9(2) (2021), 153–178