Analysis of Network Data Based on Probability Neighborhood Cliques

• Abello J, Resende MGC, Sudarsky S (2002) Massive quasi-clique detection. In: LATIN ’02: Proceedings of the 5th Latin American Symposium on Theoretical Informatics, Springer, London, UK, pp 598–612

  Google Scholar 

• Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575–577, DOI http://doi.acm.org/10.1145/362342.362367

• Cazals F, Karande C (2008) A note on the problem of reporting maximal cliques. Theor Comput Sci 407(1–3):564–568, DOI10.1016/j.tcs.2008.05.010, http://dx.doi.org/10.1016/j.tcs.2008.05.010

  Google Scholar 

• Derényi I, Palla G, Vicsek T (2005) Clique percolation in random networks. Phys Rev Lett 94(16):160,202, DOI10.1103/PhysRevLett.94.160202, http://dx.doi.org/10.1103/PhysRevLett.94.160202

• Dhillon I, Guan Y, Kulis B (2005) A unified view of kernel k-means, spectral clustering and graph cuts. Tech. rep., UTCS Technical Report No. TR-04-25

  Google Scholar 

• Haraguchi M, Okubo Y (2006) A method for pinpoint clustering of web pages with pseudo-clique search. In: Jantke K, Lunzer A, Spyratos N, Tanaka Y (eds) Federation over the Web, Lecture Notes in Computer Science, vol 3847. Springer, Berlin/Heidelberg, pp 59–78, DOI10.1007/11605126_4, http://dx.doi.org/10.1007/11605126\_4

• Kolaczyk ED (2009) Statistical analysis of network data: methods and models, 1st edn. Springer, New York, DOI10.1007/978-0-387-88146-1

  Google Scholar 

• Lancichinetti A, Fortunato S, Kertész J (2009) Detecting the overlapping and hierarchical community structure in complex networks. New J Phys 11(3):033,015+, DOI10.1088/1367-2630/11/3/033015, http://dx.doi.org/10.1088/1367-2630/11/3/033015

• Mokken RJ (1979) Cliques, clubs and clans. Quality Quantity 13:161–173, DOI10.1007/BF00139635, http://dx.doi.org/10.1007/BF00139635

  Google Scholar 

• Newman MEJ (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69(6):066,133, DOI10.1103/PhysRevE.69.066133, arXiv:cond-mat/0309508

  Google Scholar 

• Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci USA 103(23):8577–8582, DOI10.1073/pnas.0601602103

  Google Scholar 

• Newman MEJ (2010) Networks: An introduction, 1st edn. Oxford University Press, USA

  MATH  Google Scholar 

• Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026,113, DOI10.1103/PhysRevE.69.026113

  Google Scholar 

• Palla G, Derényi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814–818, DOI10.1038/nature03607

  Google Scholar 

• Pardalos P, Rebennack S (2010) Computational challenges with cliques, quasi-cliques and clique partitions in graphs. In: Festa P (ed) Experimental algorithms, lecture notes in computer science, vol 6049. Springer, Berlin/Heidelberg, pp 13–22, http://dx.doi.org/10.1007/978-3-642-13193-6\_2

• Pavan M, Pelillo M (2003) A new graph-theoretic approach to clustering and segmentation. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol 1, pp 145–152

  Google Scholar 

• Rieder H (1994) Robust asymptotic statistics. Springer, Berlin

  Book  MATH  Google Scholar 

• Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33:452–473

  Google Scholar 

• Zeng Z, Wang J, Zhou L, Karypis G (2006) Coherent closed quasi-clique discovery from large dense graph databases. In: KDD ’06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, New York, NY, USA, pp 797–802, DOI10.1145/1150402.1150506, http://doi.acm.org/10.1145/1150402.1150506

Download references