Fetching the paper…
Reading the bibliography…
Community detection plays an important role in social networks, since it can help to naturally divide the network into smaller parts so as to simplify network analysis.
J. Holland, “Adaptation in natural and artificial systems: an introductory analysis with application to biology,” Control and artificial intelligence , 1975
1975
Earlier work this paper cites.
W. W. Zachary, “An information flow model for conflict and fission in small groups,” Journal of anthropological research , vol. 33, no. 4, pp. 452–473, 1977
1977
Earlier work this paper cites.
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” science , vol. 220, no. 4598, pp. 671–680, 1983
1983
Earlier work this paper cites.
R. Eberhart and J. Kennedy, “A new optimizer using particle swarm theory,” in Micro Machine and Human Science, 1995. MHS’95., Proceedings of the Sixth International Symposium on . IEEE, 1995, pp. 39–43
1995
Earlier work this paper cites.
A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” science , vol. 286, no. 5439, pp. 509–512, 1999
1999
Earlier work this paper cites.
——, “The structure of scientific collaboration networks,” Proceedings of the national academy of sciences , vol. 98, no. 2, pp. 404–409, 2001
2001
Earlier work this paper cites.
P. Holme, B. J. Kim, C. N. Yoon, and S. K. Han, “Attack vulnerability of complex networks,” Physical review E , vol. 65, no. 5, p. 056109, 2002
2002
Earlier work this paper cites.
M. Girvan and M. E. Newman, “Community structure in social and biological networks,” Proceedings of the national academy of sciences , vol. 99, no. 12, pp. 7821–7826, 2002
2002
Earlier work this paper cites.
M. E. Newman, “The structure and function of complex networks,” SIAM review , vol. 45, no. 2, pp. 167–256, 2003
2003
Earlier work this paper cites.
P. M. Gleiser and L. Danon, “Community structure in jazz,” Advances in complex systems , vol. 6, no. 04, pp. 565–573, 2003
2003
Earlier work this paper cites.
D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, and S. M. Dawson, “The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations,” Behavioral Ecology and Sociobiology , vol. 54, no. 4, pp. 396–405, 2003
2003
Earlier work this paper cites.
F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi, “Defining and identifying communities in networks,” Proceedings of the National Academy of Sciences , vol. 101, no. 9, pp. 2658–2663, 2004
2004
Earlier work this paper cites.
M. E. Newman, “Fast algorithm for detecting community structure in networks,” Physical review E , vol. 69, no. 6, p. 066133, 2004
2004
Earlier work this paper cites.
A. Clauset, M. E. Newman, and C. Moore, “Finding community structure in very large networks,” Physical review E , vol. 70, no. 6, p. 066111, 2004
2004
Earlier work this paper cites.
M. E. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical review E , vol. 69, no. 2, p. 026113, 2004
2004
Earlier work this paper cites.
J. R. Tyler, D. M. Wilkinson, and B. A. Huberman, “E-mail as spectroscopy: Automated discovery of community structure within organizations,” The Information Society , vol. 21, no. 2, pp. 143–153, 2005
2005
Earlier work this paper cites.
L. Danon, A. Diaz-Guilera, J. Duch, and A. Arenas, “Comparing community structure identification,” Journal of Statistical Mechanics: Theory and Experiment , vol. 2005, no. 09, p. P09008, 2005
2005
Earlier work this paper cites.
M. E. Newman, “Modularity and community structure in networks,” Proceedings of the national academy of sciences , vol. 103, no. 23, pp. 8577–8582, 2006
2006
Cited alongside, same era.
——, “Finding community structure in networks using the eigenvectors of matrices,” Physical review E , vol. 74, no. 3, p. 036104, 2006
2006
Cited alongside, same era.
A. A. Abbasi and M. Younis, “A survey on clustering algorithms for wireless sensor networks,” Computer communications , vol. 30, no. 14-15, pp. 2826–2841, 2007
2007
Cited alongside, same era.
2007
Cited alongside, same era.
U. N. Raghavan, R. Albert, and S. Kumara, “Near linear time algorithm to detect community structures in large-scale networks,” Physical review E , vol. 76, no. 3, p. 036106, 2007
S. Fortunato and D. Hric, “Community detection in networks: A user guide,” Physics Reports , vol. 659, pp. 1–44, 2016
2016
Later among the works it cites.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining . ACM, 2016, pp. 855–864
2016
Later among the works it cites.
Z. Yang, R. Algesheimer, and C. J. Tessone, “A comparative analysis of community detection algorithms on artificial networks,” Scientific reports , vol. 6, p. 30750, 2016
2016
Later among the works it cites.
Q. Xuan, Z.-Y. Zhang, C. Fu, H.-X. Hu, and V. Filkov, “Social synchrony on complex networks,” IEEE transactions on cybernetics , vol. 48, no. 5, pp. 1420–1431, 2018
2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2007
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 , vol. 2008, no. 10, p. P10008, 2008
2008
Cited alongside, same era.
M. Rosvall and C. T. Bergstrom, “Maps of random walks on complex networks reveal community structure,” Proceedings of the National Academy of Sciences , vol. 105, no. 4, pp. 1118–1123, 2008
2008
Cited alongside, same era.
B. Karrer, E. Levina, and M. E. Newman, “Robustness of community structure in networks,” Physical Review E , vol. 77, no. 4, p. 046119, 2008
2008
Cited alongside, same era.
A. Lancichinetti and S. Fortunato, “Community detection algorithms: a comparative analysis,” Physical review E , vol. 80, no. 5, p. 056117, 2009
2009
Cited alongside, same era.
P. Ronhovde and Z. Nussinov, “Multiresolution community detection for megascale networks by information-based replica correlations,” Physical Review E , vol. 80, no. 1, p. 016109, 2009
2009
Cited alongside, same era.
S. Schiavo, J. Reyes, and G. Fagiolo, “International trade and financial integration: a weighted network analysis,” Quantitative Finance , vol. 10, no. 4, pp. 389–399, 2010
2010
Cited alongside, same era.
S. Nagaraja, “The impact of unlinkability on adversarial community detection: effects and countermeasures,” in International Symposium on Privacy Enhancing Technologies Symposium . Springer, 2010, pp. 253–272
2010
Cited alongside, same era.
J. O. Garcia, A. Ashourvan, S. Muldoon, J. M. Vettel, and D. S. Bassett, “Applications of community detection techniques to brain graphs: Algorithmic considerations and implications for neural function,” Proceedings of the IEEE , vol. 106, no. 5, pp. 846–867, 2018
2018
Closest in time.
Z. Chen, J. Wu, Y. Xia, and X. Zhang, “Robustness of interdependent power grids and communication networks: A complex network perspective,” IEEE Transactions on Circuits and Systems II: Express Briefs , vol. 65, no. 1, pp. 115–119, 2018
2018
Closest in time.
C. Fu, M. Zhao, L. Fan, X. Chen, J. Chen, Z. Wu, Y. Xia, and Q. Xuan, “Link weight prediction using supervised learning methods and its application to yelp layered network,” IEEE Transactions on Knowledge and Data Engineering , 2018
2018
Closest in time.
H.-F. Zhang, F. Xu, Z.-K. Bao, and C. Ma, “Reconstructing of networks with binary-state dynamics via generalized statistical inference,” IEEE Transactions on Circuits and Systems I: Regular Papers , 2018
2018
Closest in time.
Q. Xuan, M. Zhou, Z.-Y. Zhang, C. Fu, Y. Xiang, Z. Wu, and V. Filkov, “Modern food foraging patterns: Geography and cuisine choices of restaurant patrons on yelp,” IEEE Transactions on Computational Social Systems , vol. 5, no. 2, pp. 508–517, 2018
2018
Closest in time.
M. Waniek, T. P. Michalak, M. J. Wooldridge, and T. Rahwan, “Hiding individuals and communities in a social network,” Nature Human Behaviour , vol. 2, no. 2, p. 139, 2018
2018
Closest in time.
V. Fionda and G. Pirro, “Community deception or: How to stop fearing community detection algorithms,” IEEE Transactions on Knowledge and Data Engineering , vol. 30, no. 4, pp. 660–673, 2018
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
D. Zügner, A. Akbarnejad, and S. Günnemann, “Adversarial attacks on neural networks for graph data,” in Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . ACM, 2018, pp. 2847–2856
2018
Closest in time.
2018
Closest in time.