Average Whenever You Meet: Opportunistic Protocols for Community Detection
暂无分享,去创建一个
Prasad Raghavendra | Luca Trevisan | Andrea E. F. Clementi | Luca Becchetti | Pasin Manurangsi | Emanuele Natale | Francesco Pasquale | P. Raghavendra | L. Trevisan | L. Becchetti | A. Clementi | Emanuele Natale | F. Pasquale | Pasin Manurangsi
[1] Stuart M. Allen,et al. Decentralised detection of periodic encounter communities in opportunistic networks , 2012, Ad Hoc Networks.
[2] Minoru Toda,et al. Springer Series in Solid-State Sciences , 1989 .
[3] David Eisenstat,et al. The computational power of population protocols , 2006, Distributed Computing.
[4] David Kempe,et al. A decentralized algorithm for spectral analysis , 2004, STOC '04.
[5] He Sun,et al. Distributed Graph Clustering and Sparsification , 2017 .
[6] Elchanan Mossel,et al. Reconstruction and estimation in the planted partition model , 2012, Probability Theory and Related Fields.
[7] Amin Coja-Oghlan,et al. Graph Partitioning via Adaptive Spectral Techniques , 2009, Combinatorics, Probability and Computing.
[8] Emmanuel Abbe,et al. Exact Recovery in the Stochastic Block Model , 2014, IEEE Transactions on Information Theory.
[9] Ioana Dumitriu,et al. Recovery and Rigidity in a Regular Stochastic Block Model , 2016, SODA.
[10] Frank McSherry,et al. Spectral partitioning of random graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[11] Cristopher Moore,et al. Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.
[12] Laurent Massoulié,et al. Community detection thresholds and the weak Ramanujan property , 2013, STOC.
[13] He Sun,et al. Distributed Graph Clustering by Load Balancing , 2016, SPAA.
[14] Stephen P. Boyd,et al. Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.
[15] Luca Trevisan,et al. Find Your Place: Simple Distributed Algorithms for Community Detection , 2015, SODA.
[16] Alessandro Panconesi,et al. Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .
[17] J. R. Ipsen. Products of independent Gaussian random matrices , 2015, 1510.06128.
[18] Mark Jerrum,et al. The Metropolis Algorithm for Graph Bisection , 1998, Discret. Appl. Math..
[19] Charles Bordenave,et al. A new proof of Friedman's second eigenvalue theorem and its extension to random lifts , 2015, Annales scientifiques de l'École normale supérieure.
[20] Martin E. Dyer,et al. The Solution of Some Random NP-Hard Problems in Polynomial Expected Time , 1989, J. Algorithms.
[21] Elchanan Mossel,et al. A Proof of the Block Model Threshold Conjecture , 2013, Combinatorica.
[22] Elchanan Mossel,et al. Belief propagation, robust reconstruction and optimal recovery of block models , 2013, COLT.