Unwinding the hairball graph: Pruning algorithms for weighted complex networks

Physical Review E

Volumn 93, Issue 1, 2016, Pages

  Dianati, Navid ^a,b  

^a NORTHEASTERN UNIVERSITY   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

CONFIGURATION MODEL; ENSEMBLE APPROACHES; GIANT COMPONENTS; MARGINAL DISTRIBUTION; MARGINAL LIKELIHOOD; NETWORK GENERATION; PRUNING ALGORITHMS; WEIGHTED COMPLEX NETWORKS;

COMPLEX NETWORKS;

EID: 84954482539     PISSN: 24700045     EISSN: 24700053     Source Type: Journal    
DOI: 10.1103/PhysRevE.93.012304     Document Type: Article

References (17)

1. S. H. Strogatz, Exploring complex networks, Nature (London) 410, 268 (2001). NATUAS 0028-0836 10.1038/35065725
2. R. Albert and A.-L. Barabási, Statistical mechanics of complex networks, Rev. Mod. Phys. 74, 47 (2002). RMPHAT 0034-6861 10.1103/RevModPhys.74.47
3. M. Barthélemy, Spatial networks, Phys. Rep. 499, 1 (2011). PRPLCM 0370-1573 10.1016/j.physrep.2010.11.002
4. E. M. Jin, M. Girvan, and M. E. J. Newman, Structure of growing social networks, Phys. Rev. E 64, 046132 (2001). 1063-651X 10.1103/PhysRevE.64.046132
5. M. E. Newman, The structure and function of complex networks, SIAM Rev. 45, 167 (2003). SIREAD 0036-1445 10.1137/S003614450342480
6. N. Goyal, L. Rademacher, and S. Vempala, Expanders via random spanning trees, in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia, PA, 2009), pp. 576-585.
7. J. A. Kelner and A. Madry, Faster generation of random spanning trees, in Foundations of Computer Science 2009, FOCS'09, 50th Annual IEEE Symposium (IEEE, New York, 2009), pp. 13-21.
8. D. B. Wilson, Generating random spanning trees more quickly than the cover time, in Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC '96 (Association for Computing Machinery, New York, NY, 1996), pp. 296-303.
9. D. A. Spielman and S.-H. Teng, Spectral sparsification of graphs, SIAM J. Comput. 40, 981 (2011). 10.1137/08074489X
10. M. Á. Serrano, M. Boguñá, and A. Vespignani, Extracting the multiscale backbone of complex weighted networks, Proc. Natl. Acad. Sci. USA 106, 6483 (2009). PNASA6 0027-8424 10.1073/pnas.0808904106
11. F. Radicchi, J. Ramasco, and S. Fortunato, Information filtering in complex weighted networks, Phys. Rev. E 83, 046101 (2011). PLEEE8 1539-3755 10.1103/PhysRevE.83.046101
12. J. Park and M. E. J. Newman, Statistical mechanics of networks, Phys. Rev. E 70, 066117 (2004). PLEEE8 1539-3755 10.1103/PhysRevE.70.066117
13. O. Sagarra, F. Font-Clos, C. J. Pérez-Vicente, and A. Díaz-Guilera, The configuration multi-edge model: Assessing the effect of fixing node strengths on weighted network magnitudes, Europhys. Lett. 107, 38002 (2014). EULEEJ 0295-5075 10.1209/0295-5075/107/38002
14. O. Sagarra, C. P. Vicente, and A. Dïaz-Guilera, Statistical mechanics of multiedge networks, Phys. Rev. E 88, 062806 (2013). PLEEE8 1539-3755 10.1103/PhysRevE.88.062806
15. K. Huang, Introduction to Statistical Physics (CRC Press, Boca Raton, FL, 2001).
16. A. Barrat, M. Barthelemy, R. Pastor-Satorras, and A. Vespignani, The architecture of complex weighted networks, Proc. Nat. Acad. Sci. USA 101, 3747 (2004). PNASA6 0027-8424 10.1073/pnas.0400087101
17. D. B. West, Introduction to Graph Theory (Prentice Hall, Upper Saddle River, NJ, 2001), Vol. 2.