@inproceedings{Chakrabarti:2004,
        title = {R-MAT: A Recursive Model for Graph Mining},
        author = {D. Chakrabarti and Y. Zhan and C. Faloutsos},
        booktitle = {SIAM International Conference on Data Mining},
        year = 2004,
        biburl = {http://www.bibsonomy.org/bibtex/25e5cc221d7da719909f3bf8c507b0afc/mmcgloho},
	keywords = {r-mat}
}

@inproceedings{Leskovec:2005:pkdd,
        title = {Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication.},
        author = {Jure Leskovec and Deepayan Chakrabarti and Jon M. Kleinberg and Christos Faloutsos},
        booktitle = {PKDD},
        crossref = {conf/pkdd/2005},
        editor = {Alípio Jorge and Luís Torgo and Pavel Brazdil and Rui Camacho and João Gama},
        pages = {133-145},
        publisher = {Springer},
        series = {Lecture Notes in Computer Science},
        volume = 3721,
        year = 2005,
        url = {http://dblp.uni-trier.de/db/conf/pkdd/pkdd2005.html#LeskovecCKF05},
        ee = {http://dx.doi.org/10.1007/11564126_17},
	isbn = {3-540-29244-6},
	date = {2005-11-14},
	description = {dblp},
	biburl = {http://www.bibsonomy.org/bibtex/2bdc632d54a6dff030d0124436bb1b008/mmcgloho},
	keywords = {kronecker}
}

@inproceedings{conf/stoc/MosselR07,
        title = {On the submodularity of influence in social networks.},
        author = {Elchanan Mossel and Sébastien Roch},
        booktitle = {STOC},
        crossref = {conf/stoc/2007},
        editor = {David S. Johnson and Uriel Feige},
        pages = {128-134},
        publisher = {ACM},
        year = 2007,
        url = {http://dblp.uni-trier.de/db/conf/stoc/stoc2007.html#MosselR07},
        ee = {http://doi.acm.org/10.1145/1250790.1250811},
	isbn = {978-1-59593-631-8},
	date = {2007-06-13},
	description = {dblp},
	biburl = {http://www.bibsonomy.org/bibtex/2b73f19a10731c42064eb34b54ac0513b/mmcgloho},
	keywords = {influence diffusion}
}

@article{PhysRevLett.86.3200,
        title = {Epidemic Spreading in Scale-Free Networks},
        author = {Romualdo Pastor-Satorras and Alessandro Vespignani},
        journal = {Phys. Rev. Lett.},
        month = {Apr},
        number = 14,
        pages = {3200--3203},
        publisher = {American Physical Society},
        volume = 86,
        year = 2001,
        numpages = {3},
	doi = {10.1103/PhysRevLett.86.3200},
	biburl = {http://www.bibsonomy.org/bibtex/24e42da72517e538914e3c8d859d2d4e5/mmcgloho},
	keywords = {imported}
}

@article{PhysRevE.63.066117,
        title = {Epidemic dynamics and endemic states in complex networks},
        author = {Romualdo Pastor-Satorras and Alessandro Vespignani},
        journal = {Phys. Rev. E},
        month = {May},
        number = 6,
        pages = 066117,
        publisher = {American Physical Society},
        volume = 63,
        year = 2001,
        numpages = {8},
	doi = {10.1103/PhysRevE.63.066117},
	biburl = {http://www.bibsonomy.org/bibtex/2f427d5a77a7caa9c7549361984170cec/mmcgloho},
	keywords = {imported}
}

@article{coleman1957diffusion,
        title = {The diffusion of innovation among physicians},
        author = {James Coleman and Elihu Katz and Herbert Menzel},
        journal = {Sociometry},
        number = 4,
        pages = {253-270},
        volume = 20,
        year = 1957,
        added = {2007-01-22 11:56:01 -0800},
	doi = {doi:10.2307/2785979},
	url = {coleman/coleman-1957-the diffusion.pdf},
	modified = {2007-11-13 18:09:41 -0500},
	description = {Main paper DB},
	biburl = {http://www.bibsonomy.org/bibtex/2ca49699eca518f3c600ee919d89af5de/mmcgloho},
	keywords = {diffusion}
}

@article{valente1995origins,
        title = {The origins and development of the diffusion of innovations paradigm as an example of scientific growth},
        author = {Thomas W. Valente and Everett M. Rogers},
        journal = {Science Communications},
        month = {March},
        number = 3,
        pages = {242-273},
        volume = 16,
        year = 1995,
        added = {2007-01-22 11:56:01 -0800},
	modified = {2007-11-13 18:18:35 -0500},
	description = {Main paper DB},
	biburl = {http://www.bibsonomy.org/bibtex/2944b3f20940ed25da669ba8260c45c15/mmcgloho},
	keywords = {diffusion}
}

@book{baily1957mathematical,
        title = {The mathematical theory of epidemics},
        address = {London},
        author = {Norman T. J. Baily},
        publisher = {Charles Griffen},
        year = 1957,
        added = {2007-01-22 11:56:01 -0800},
	modified = {2007-11-13 18:07:27 -0500},
	description = {Main paper DB},
	biburl = {http://www.bibsonomy.org/bibtex/22693d44c12801c94cf6af3fd21c86d7e/mmcgloho},
	keywords = {epidemiology}
}

@article{milgram1967smallworld,
        title = {The Small World Problem},
        author = {Stanley Milgram},
        journal = {Psychology Today},
        pages = {60-67},
        volume = 2,
        year = 1967,
        added = {2007-01-22 11:56:01 -0800},
	url = {milgram/milgram-1967-the small.pdf},
	modified = {2007-11-13 18:16:19 -0500},
	description = {Main paper DB},
	biburl = {http://www.bibsonomy.org/bibtex/2479de6530a14a7aff4469f21678e8027/mmcgloho},
	keywords = {social-networks}
}

@book{dawkins1989selfish,
        title = {The selfish gene},
        address = {Oxford New York},
        author = {Richard Dawkins},
        edition = {New},
        publisher = {Oxford University Press},
        year = 1989,
        added = {2007-01-22 11:56:01 -0800},
	modified = {2007-11-13 18:10:06 -0500},
	description = {Main paper DB},
	biburl = {http://www.bibsonomy.org/bibtex/2ec6bf630f13bd2a37d11c391fec39003/mmcgloho},
	keywords = {diffusion evolution}
}

@book{gladwell2000tipping,
        title = {The tipping point: how little things can make a big difference},
        address = {Boston},
        author = {Malcolm Gladwell},
        edition = {1st},
        publisher = {Little Brown},
        year = 2000,
        added = {2007-01-22 11:56:01 -0800},
	modified = {2007-11-13 18:12:33 -0500},
	description = {Main paper DB},
	biburl = {http://www.bibsonomy.org/bibtex/2063aa3077882dbcf5ea1c96d3e89f062/mmcgloho},
	keywords = {book}
}

@article{lilijeros2001web,
        title = {The web of human sexual contacts},
        author = {Fredrick Lilijeros and Cristofer Edling and Lu{\'\i}s Amaral and Eugene Stanley and Yvonne {\AA}berg},
        journal = {Nature},
        pages = {907-908},
        volume = 411,
        year = 2001,
        added = {2007-01-22 11:56:01 -0800},
	doi = {doi:10.1038/35082140},
	modified = {2007-11-13 18:15:36 -0500},
	description = {Main paper DB},
	biburl = {http://www.bibsonomy.org/bibtex/2131d84ad09c429014b67930104db8b77/mmcgloho},
	keywords = {epidemiology social-networks}
}

@article{granovetter1978threshold,
        title = {Threshold Models of Collective Behavior},
        author = {Mark Granovetter},
        journal = {American Journal of Sociology},
        number = 6,
        pages = {1420-1443},
        volume = 83,
        year = 1978,
        added = {2007-01-22 11:56:01 -0800},
	doi = {doi:10.1086/226707},
	url = {granovetter/1978-threshold.pdf},
	modified = {2007-11-13 18:06:27 -0500},
	description = {Main paper DB},
	biburl = {http://www.bibsonomy.org/bibtex/25977f13eeeefe4933030f369914f24eb/mmcgloho},
	keywords = {social-networks}
}

@inproceedings{Tong:2006,
        title = {Center-piece subgraphs: problem definition and fast solutions},
        address = {New York, NY, USA},
        author = {Hanghang Tong and Christos Faloutsos},
        booktitle = {KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining},
        pages = {404--413},
        publisher = {ACM},
        year = 2006,
        url = {http://portal.acm.org/citation.cfm?id=1150448},
        location = {Philadelphia, PA, USA},
	isbn = {1-59593-339-5},
	doi = {http://doi.acm.org/10.1145/1150402.1150448},
	description = {Center-piece subgraphs},
	abstract = {Given Q nodes in a social network (say, authorship network), how can we find the node/author that is the center-piece, and has direct or indirect connections to all, or most of them? For example, this node could be the common advisor, or someone who started the research area that the Q nodes belong to. Isomorphic scenarios appear in law enforcement (find the master-mind criminal, connected to all current suspects), gene regulatory networks (find the protein that participates in pathways with all or most of the given Q proteins), viral marketing and many more.Connection subgraphs is an important first step, handling the case of Q=2 query nodes. Then, the connection subgraph algorithm finds the b intermediate nodes, that provide a good connection between the two original query nodes.Here we generalize the challenge in multiple dimensions: First, we allow more than two query nodes. Second, we allow a whole family of queries, ranging from 'OR' to 'AND', with 'softAND' in-between. Finally, we design and compare a fast approximation, and study the quality/speed trade-off.We also present experiments on the DBLP dataset. The experiments confirm that our proposed method naturally deals with multi-source queries and that the resulting subgraphs agree with our intuition. Wall-clock timing results on the DBLP dataset show that our proposed approximation achieve good accuracy for about 6:1 speedup.},
	biburl = {http://www.bibsonomy.org/bibtex/25b9a7663680b57d6e4c7bdbcb5af591e/mmcgloho},
	keywords = {imported}
}

@inproceedings{Guha:2004,
        title = {Propagation of trust and distrust},
        address = {New York, NY, USA},
        author = {R. Guha and Ravi Kumar and Prabhakar Raghavan and Andrew Tomkins},
        booktitle = {WWW '04: Proceedings of the 13th international conference on World Wide Web},
        pages = {403--412},
        publisher = {ACM},
        year = 2004,
        url = {http://portal.acm.org/citation.cfm?id=988672.988727},
        location = {New York, NY, USA},
	isbn = {1-58113-844-X},
	doi = {http://doi.acm.org/10.1145/988672.988727},
	description = {Propagation of trust and distrust},
	abstract = {A (directed) network of people connected by ratings or trust scores, and a model for propagating those trust scores, is a fundamental building block in many of today's most successful e-commerce and recommendation systems. We develop a framework of trust propagation schemes, each of which may be appropriate in certain circumstances, and evaluate the schemes on a large trust network consisting of 800K trust scores expressed among 130K people. We show that a small number of expressed trusts/distrust per individual allows us to predict trust between any two people in the system with high accuracy. Our work appears to be the first to incorporate distrust in a computational trust propagation setting.},
	biburl = {http://www.bibsonomy.org/bibtex/28377d56455a2a57ad2802ed4c4e36fbe/mmcgloho},
	keywords = {imported}
}

@article{346290,
        title = {Graph structure in the Web},
        address = {New York, NY, USA},
        author = {Andrei Broder and Ravi Kumar and Farzin Maghoul and Prabhakar Raghavan and Sridhar Rajagopalan and Raymie Stata and Andrew Tomkins and Janet Wiener},
        journal = {Comput. Netw.},
        number = {1-6},
        pages = {309--320},
        publisher = {Elsevier North-Holland, Inc.},
        volume = 33,
        year = 2000,
        url = {http://portal.acm.org/citation.cfm?id=346290},
        issn = {1389-1286},
	doi = {http://dx.doi.org/10.1016/S1389-1286(00)00083-9},
	description = {Graph structure in the Web, bowtie model},
	biburl = {http://www.bibsonomy.org/bibtex/24d293a2a2fd3a1de5daf9c6304ed1aae/mmcgloho},
	keywords = {imported}
}

@article{Ziegler:2005,
        title = {Propagation Models for Trust and Distrust in Social Networks},
        address = {Hingham, MA, USA},
        author = {Cai-Nicolas Ziegler and Georg Lausen},
        journal = {Information Systems Frontiers},
        number = {4-5},
        pages = {337--358},
        publisher = {Kluwer Academic Publishers},
        volume = 7,
        year = 2005,
        url = {http://portal.acm.org/citation.cfm?id=1108451.1108466&coll=GUIDE&dl=GUIDE#},
        issn = {1387-3326},
	doi = {http://dx.doi.org/10.1007/s10796-005-4807-3},
	description = {Propagation Models for Trust and Distrust in Social Networks},
	biburl = {http://www.bibsonomy.org/bibtex/2dacd24132be507ae6aed87e778584f2a/mmcgloho},
	keywords = {imported}
}

@inproceedings{Kumar:2008,
        title = {Connectivity structure of bipartite graphs via the KNC-plot},
        address = {New York, NY, USA},
        author = {Ravi Kumar and Andrew Tomkins and Erik Vee},
        booktitle = {WSDM '08: Proceedings of the international conference on Web search and web data mining},
        pages = {129--138},
        publisher = {ACM},
        year = 2008,
        location = {Palo Alto, California, USA},
	isbn = {978-1-59593-927-9},
	doi = {http://doi.acm.org/10.1145/1341531.1341550},
	description = {connected components, bipartite},
	biburl = {http://www.bibsonomy.org/bibtex/25090526b8f22cc041a047634c6a33e4d/mmcgloho},
	keywords = {imported}
}

@inproceedings{Backstrom:2008,
        title = {Preferential behavior in online groups},
        address = {New York, NY, USA},
        author = {Lars Backstrom and Ravi Kumar and Cameron Marlow and Jasmine Novak and Andrew Tomkins},
        booktitle = {WSDM '08: Proceedings of the international conference on Web search and web data mining},
        pages = {117--128},
        publisher = {ACM},
        year = 2008,
        location = {Palo Alto, California, USA},
	isbn = {978-1-59593-927-9},
	doi = {http://doi.acm.org/10.1145/1341531.1341549},
	description = {defines "thriving", "engagment", others.},
	biburl = {http://www.bibsonomy.org/bibtex/2d39662a0456998fc722be889fd1cfda4/mmcgloho},
	keywords = {imported}
}

@inproceedings{He:2006,
        title = {Inferring Privacy Information from Social Networks.},
        author = {Jianming He and Wesley W. Chu and Zhenyu Liu},
        booktitle = {ISI},
        crossref = {conf/isi/2006},
        editor = {Sharad Mehrotra and Daniel Dajun Zeng and Hsinchun Chen and Bhavani M. Thuraisingham and Fei-Yue Wang},
        pages = {154-165},
        publisher = {Springer},
        series = {Lecture Notes in Computer Science},
        volume = 3975,
        year = 2006,
        url = {http://dblp.uni-trier.de/db/conf/isi/isi2006.html#HeCL06},
        ee = {http://dx.doi.org/10.1007/11760146_14},
	isbn = {3-540-34478-0},
	date = {2006-05-15},
	description = {dblp,defines "influence strength" of a tie},
	biburl = {http://www.bibsonomy.org/bibtex/2359bc1ca48bf24290985aca88d9a21d3/mmcgloho},
	keywords = {influence privacy}
}