Issue No. 12 - December (2011 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.218
Xiaowei Ying , University of North Carolina at Charlotte, Charlotte
Leting Wu , University of North Carolina at Charlotte, Charlotte
Xintao Wu , University of North Carolina at Charlotte, Charlotte
Social networks tend to contain some amount of randomness and some amount of nonrandomness. The amount of randomness versus nonrandomness affects the properties of a social network. In this paper, we theoretically analyze graph randomness and present a framework which provides a series of nonrandomness measures at levels of edge, node, subgraph, and the overall graph. We show that graph nonrandomness can be obtained mathematically from the spectra of the adjacency matrix of the network. We derive the upper bound and lower bound of nonrandomness value of the overall graph. We investigate whether other graph spectra (such as Laplacian and normal spectra) could also be used to derive a nonrandomness framework. Our theoretical results showed that they are unlikely, if not impossible, to have a consistent framework to evaluate randomness. We also compare our proposed nonrandomness measures with some traditional measures such as modularity. Our theoretical and empirical studies show our proposed nonrandomness measures can characterize and capture graph randomness.
Randomness measures, graph spectra, social networks.
L. Wu, X. Ying and X. Wu, "A Spectrum-Based Framework for Quantifying Randomness of Social Networks," in IEEE Transactions on Knowledge & Data Engineering, vol. 23, no. , pp. 1842-1856, 2010.