what-when-how
In Depth Tutorials and Information
References
1. L. Backstrom, C. Dwork, and Jon Kleinberg. Wherefore art thou r3579x?: Anonymized
social networks, hidden patterns, and structural steganography. In
Proceedings of the
16th International Conference onWorldWideWeb (WWW '07)
, New York, pp. 181-
190, 2007, ACM Press.
2. Lars Backstrom, Dan Huttenlocher, Jon Kleinberg, and Xiangyang Lan. Group forma-
tion in large social networks: membership, growth, and evolution. In
Proceedingsofthe
12thACMSIGKDDInternationalConferenceonKnowledgeDiscoveryandDataMining
(KDD'06)
, New York, pp. 44-54, 2006, ACM Press.
3. Jeffrey Baumes, Mark K. Goldberg, Malik Magdon-Ismail, and William A. Wallace.
Discovering hidden groups in communication networks. In
ISI
, pp. 378-389, 2004.
4. Tanya Y. Berger-Wolf and Jared Saia. A framework for analysis of dynamic social net-
works. In
KDD'06
, pp. 523-528, 2006.
5. Alina Campan and Traian Marius Truta. A clustering approach for data and structural
anonymity in social networks. In
PinKDD'08
, 2008.
6. Deepayan Chakrabarti and Christos Faloutsos. Graph mining: laws, generators, and
algorithms.
ACMComput.Surv.
, 38(1):2, 2006.
7. Fan Chung and Ronald Graham. Sparse quasi-random graphs.
Combinatorica
,
22(2):217-244, 2002.
8. D. Cvetkovic, P. Rowlinson, and S. Simic.
EigenspacesofGraphs
. Cambridge University
Press, Cambridge, England, 1997.
9. Luciano da F. Costa, Francisco A. Rodrigues, Gonzalo Travieso, and P. R. Villas
Boas. Characterization of complex networks: A survey of measurements.
Adv.Phys.
,
56:167, 2007.
10. Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Ming Gu, and Horst D. Simon. A min-
max cut algorithm for graph partitioning and data clustering. In Proceedings of the 2001
IEEE International conference on Data Mining. pp. 107-114, 2001.
11. P. Erdos and A. Renyi. On random graphs i.
Publicationes Mathematicae
, 6:290-
297, 1959.
12. Ernesto Estrada and Juan A. Rodríguez-Velázquez. Subgraph centrality in complex
networks.
Phys.Rev.E
, 71(056103), 2005.
13. Andrew Fast, David Jensen, and Brian Neil Levine. Creating social networks to improve
peer-to-peer networking. In
KDD'05
, pp. 568-573, 2005.
14. Z. Furedi and J. Komlos. he eigenvalues of random symmetric matrices.
Combinatorica
,
1 (3):233-241, 1981.
15. M. Girvan and M. E. Newman. Community structure in social and biological net-
works.
Proc.Natl.Acad.Sci.USA
, 99(12):7821-7826, June 2002.
16. M. Hay, G. Miklau, D. Jensen, P. Weis, and S. Srivastava. Anonymizing social net-
works.
UniversityofMassachusettsTechnicalReport
, 07-19, 2007.
17. Michael Hay, Gerome Miklau, David Jensen, Don Towsely, and Philipp Weis. Resisting
structural re-identification in anonymized social networks. In
VLDB
, 2008.
18. R. Horn and C. R. Johnson.
MatrixAnalysis
. Cambridge University Press, Cambridge,
England, 1985.
19. David Kempe, Jon M. Kleinberg, and Éva Tardos. Maximizing the spread of influence
through a social network. In
KDD'03
, pp. 137-146, 2003.
