1231 references, last updated Thu Jun 25 1:42:41 2009

[Aarão Reis, 2005 — AaraoReis05]

Fabio D. A. Aarão Reis. Scaling in the crossover from random to correlated growth. Technical Report cond-mat/0511131, Arxiv.org, 2005.

[AbdulJaleel and Qu, 2005 — AbdulJaleel&Qu05]

Nasreen AbdulJaleel and Yan Qu. Domain term extraction and structuring via link analysis. In Proceedings of the AAAI '05 Workshop on Link Analysis (LinkAnalysis 2005), pages 39–46, 2005.

[Abello, 2002 — Abello02]

J. Abello. Massive graph mining. In Proceedings of the FOCS '02 First Workshop on Algorithms and Models for the Web-Graph (WAW '02), 2002.

[Abrams and Strogatz, 2003 — Abrams&Strogatz03]

Daniel M. Abrams and Steven H. Strogatz. Modelling the dynamics of language death. Nature, 424:900, August 21, 2003.

[Acharyya and Ghosh, 2003 — Acharyya&Ghosh03]

Sreangsu Acharyya and Joydeep Ghosh. A maximum entropy framework for higher order link analysis on directed graphs. In Proceedings of the ACM SIGKDD '03 Workshop on Link Analysis for Detecting Complex Behavior (LinkKDD '03), 2003.

[Achlioptas et al., 2001 — Achlioptas&al.01]

Dimitris Achlioptas, Amos Fiat, Anna R. Karlin, and Frank McSherry. Web search via hub synthesis. In Proceedings of the Forty-Second Annual Symposium on Foundations of Computer Science (FOCS '01), pages 500–509, 2001.

[Achlioptas et al., 2006 — Achlioptas&al.06]

Dimitris Achlioptas, Aaron Clauset, David Kempe, and Cristopher Moore. On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. Technical Report cond-mat/0503087, Arvix.org, March 2006.

[Achlioptas, 1999 — Achlioptas99]

Dimitris Achlioptas. Threshold Phenomena in Random Graph Colouring and Satisfiability. PhD thesis, University of Toronto, 1999.

[Adafre and de Rijke, 2005 — Adafre&Rijke05]

Sisay Fissaha Adafre and Maarten de Rijke. Discovering missing links in Wikipedia. In Proceedings of the ACM SIGKDD '05 Workshop on Link Discovery: Issues, Approaches and Applications (LinkKDD '05), 2005.

[Adamic and Adar, 2003 — Adamic&Adar03]

Lada A. Adamic and Eytan Adar. Friends and neighbors on the Web. Social Networks, 25(3):211–230, 2003.

[Adamic and Adar, 2005 — Adamic&Adar05]

Lada Adamic and Eytan Adar. How to search a social network. Social Networks, 27(3):187–203, 2005.

[Adamic and Glance, 2005 — Adamic&Glance05]

Lada Adamic and Natalie Glance. The political Blogosphere and the 2004 U.S. election: Divided they Blog. In Proceedings of the WWW '05 Second Annual Workshop on the Weblogging Ecosystem: Aggregation, Analysis, and Dynamics, 2005.

[Adamic and Huberman, 2000 — Adamic&Huberman00]

Lada A. Adamic and Bernardo A. Huberman. Power law distribution of the World Wide Web. Science, 287:2115a, 2000.

[Adamic et al., 2001 — Adamic&al.01]

Lada A. Adamic, Rajan M. Lukose, Amit R. Puniyani, and Bernardo A Huberman. Search in power-law networks. Physical Review E, 64:46135–46143, September 26, 2001.

[Adamic et al., 2002 — Adamic&al.02]

Lada A. Adamic, Rajan M. Lukose, and Bernardo A. Huberman. Local Search in Unstructured Networks, chapter 13, pages 295–317. Wiley-VCH, Berlin, 2002.

[Adamic et al., 2003 — Adamic&al.03]

Lada A. Adamic, Orkut Buyukkokten, and Eytan Adar. A social network caught in the Web. First Monday, 8(6), June 2003.

[Adamic, 1999 — Adamic99]

Lada A. Adamic. The small world Web. In Proceedings of the Third European Conference on Research and Advanced Technology For Digital Libraries (ECDL '99), pages 443–452, 1999.

[Adamic, 2000 — Adamic00]

Lada A. Adamic. Zipf, power-laws, and Pareto - a ranking tutorial, 2000.

[Adar et al., 2004 — Adar&al.04]

Eytan Adar, Li Zhang, Lada A. Adamic, and Rajan M. Lukose. Implicit structure and the dynamics of Blogspace. In Proceedings of the WWW '04 First Annual Workshop on Weblogging Ecosystem: Aggregation, Analysis, and Dynamics, 2004.

[Adar, 2005 — Adar05]

Eytan Adar. GUESS: The graph exploration system. Online manual and tutorial, HP Labs, February 16, 2005.

[Adar, 2006 — Adar06]

Eytan Adar. GUESS: A language and interface for graph exploration. In CHI 06: Proceedings of the SIGCHI conference on Human Factors in computing systems, pages 791–800, New York, NY, USA, 2006. ACM Press.

[Adibi et al., 2004a — Adibi&al.04a]

Jafar Adibi, Hans Chalupsky, Marko Grobelnik, Dunja Mladenic, and Natasa Milic-Frayling. KDD-2004 workshop report: Link analysis and group detection (LinkKDD-2004). SIGKDD Explorations Newsletter, 6(2):136–139, December 2004.

[Adibi et al., 2004b — Adibi&al.04b]

Jafar Adibi, Clayton M. Morrison, and Paul R. Cohen. Measuring confidence intervals in link discovery: A bootstrap approach. In Proceedings of the ACM SIGKDD '04 Workshop on Link Analysis for Detecting Complex Behavior (LinkKDD '04), 2004.

[Adibi et al., 2005 — Adibi&al.05]

Jafar Adibi, P. Pantel, Marko Grobelnik, and Dunja Mladenic. KDD-2005 workshop report link discovery: Issues, approaches and application. SIGKDD Explorations Newsletter, 7(2):123–125, 2005.

[Adler and Mitzenmacher, 2001 — Adler&Mitzenmacher01]

Micah Adler and Michael Mitzenmacher. Towards compressing Web graphs. In Proceedings of the 2001 Data Compression Conference (DCC '01), page 203, 2001.

[Agarwal et al., 2006a — Agarwal&al.06]

Alekh Agarwal, Soumen Chakrabarti, and Sunny Aggarwal. Learning to rank networked entities. In Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '06), pages 14–23, 2006.

[Agarwal et al., 2006b — Agarwal&al.06b]

Sameer Agarwal, Kristin Branson, and Serge Belongie. Higher order learning with graphs. In Proceedings of the Twenty-Third International Conference on Machine Learning (ICML '06), pages 17–24, 2006.

[Agarwal, 2006 — Agarwal06]

Shivani Agarwal. Ranking on graph data. In Proceedings of the Twenty-Third International Conference on Machine Learning (ICML '06), pages 25–32, 2006.

[Agichtein et al., 2006a — Agichtein&al.06a]

Eugene Agichtein, Eric Brill, and Susan Dumais. Improving web search ranking by incorporating user behavior information. In Proceedings of the Twenty-Nineth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '06), pages 19–26, 2006.

[Agichtein et al., 2006b — Agichtein&al.06]

Eugene Agichtein, Eric Brill, Susan Dumais, and Robert Ragno. Learning user interaction models for predicting web search result preferences. In Proceedings of the Twenty-Nineth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '06), pages 3–10, 2006.

[Agliari et al., 2006 — Agliari&al.06]

E. Agliari, R. Burioni, D. Cassi, and F. M. Neri. Efficiency of information spreading in a population of diffusing agents. Physical Review E, 73:046138, 2006.

[Agosti and Pretto, 2005 — Agosti&Pretto05]

Maristella Agosti and Luca Pretto. A theoretical study of a generalized version of Kleinberg's HITS algorithm. Information Retrieval, 8(2):219–243, April 2005.

[Ahlgren et al., 2003 — Ahlgren&al.03]

Per Ahlgren, Bo Jarneving, and Ronald Rousseau. Requirements for a cocitation similarity measure, with special reference to Pearson's correlation coefficient. Journal of the American Society for Information Science and Technology, 54(6):550–560, April 2003.

[Ahlgren et al., 2004 — Ahlgren&al.04]

Per Ahlgren, Bo Jarneving, and Ronald Rousseaul. Author cocitation analysis and Pearson's r. Journal of the American Society for Information Science and Technology, 55(9):843, July 2004.

[Aiello et al., 2000 — Aiello&al.00]

William Aiello, Fan Chung, and Linyuan Lu. A random graph model for massive graphs. In Proceedings of the Thirty-Second ACM Symposium on the Theory of Computing (STOC '00), pages 171–180, 2000.

[Aiello et al., 2001 — Aiello&al.01]

William Aiello, Fan R. K. Chung, and Linyuan Lu. Random evolution in massive graphs. In Proceedings of the Forty-Second Annual Symposium on Foundations of Computer Science (FOCS '01), pages 510–519, 2001.

[Airoldi and Carley, 2005 — Airoldi&Carley05]

E. M. Airoldi and K. M. Carley. Sampling algorithms for pure network topologies. SIGKDD Explorations Newsletter, 7(2):13–22, 2005.

[Airoldi et al., 2005 — Airoldi&al.05]

Edoardo Airoldi, David Blei, Eric Xing, and Stephen Fienberg. A latent mixed membership model for relational data. In Proceedings of the ACM SIGKDD '05 Workshop on Link Discovery: Issues, Approaches and Applications (LinkKDD '05), 2005.

[Aktas et al., 2004 — Aktas&al.04]

Mehmet S. Aktas, Mehmet A. Nacar, and Filippo Menczer. Personalizing PageRank based on domain profiles. In Bamshad Mobasher, Bing Liu, Brij Masand, and Olfa Nasraoui, editors, Proceedings of the ACM SIGKDD '04 Sixth Workshop on Web Mining and Web Analysis (WebKDD '04), Seattle, Washington, USA, August 22, 2004.

[Alberich et al., 2002 — Alberich&al.02]

R. Alberich, J. Miro-Julia, and F. Rossello. Marvel universe looks almost like a real social network. Technical Report cond-mat/0202174, Arxiv.org, 2002.

[Albert and Albert, 2004 — Albert&Albert04]

István Albert and Réka Albert. Conserved network motifs allow protein-protein interaction prediction. Bioinformatics, 20(18):3346–3352, December 12, 2004.

[Albert and Barabási, 2000a — Albert&Barabasi00a]

Réka Albert and Albert-László Barabási. Dynamics of complex systems: Scaling laws for the period of boolean networks. Physical Review Letters, 84(24):5660–5663, June 2000.

[Albert and Barabási, 2000b — Albert&Barabasi00]

Réka Albert and Albert-László Barabási. Topology of evolving networks: Local events an universality. Physical Review Letters, 85(24):5234–5237, December 11, 2000.

[Albert and Barabási, 2002 — Albert&Barabasi02]

Réka Albert and Albert-László Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 74(1):47–98, 2002.

[Albert et al., 1999 — Albert&al.99a]

Réka Albert, Hawoong Jeong, and Albert-László Barabási. Diameter of the World Wide Web. Nature, 401(6749):130–131, September 1999.

[Albert et al., 2000 — Albert&al.00]

Réka Albert, Hawoong Jeong, and Albert-László Barabási. Error and attack tolerance of complex networks. Nature, 406(6794):378–382, July 27, 2000.

[Albert, 2004 — Albert04]

Réka Albert. Boolean modeling of genetic regulatory networks. In Eli Ben-Naim, Hans Frauenfelder, and Zoltan Toroczkai, editors, Complex Networks, pages 459–481. Springer Berlin/Heidelberg, 2004. Lecture Notes in Physics - Volume 650.

[Albert, 2005 — Albert05]

Réka Albert. Scale-free networks in cell biology. Journal of Cell Science, 118:4947–4957, 2005.

[Aldous and Fill, 1994 — Aldous&Fill94]

David Aldous and Jim Fill. Reversible Markov chains and random walks on graphs. Preprint, 1994.

[Aleman-Meza et al., 2006 — AlemanMeza&al.06]

Boanerges Aleman-Meza, Meenakshi Nagarajan, Cartic Ramakrishnan, Li Ding, Pranam Kolari, Amit P. Sheth, I. Budak Arpinar, Anupam Joshi, and Tim Finin. Semantic analytics on social networks: Experiences in addressing the problem of conflict of interest detection. In Proceedings of the Fifteenth International Conference on the World Wide Web (WWW '06), pages 407–416, 2006.

[Allegrini et al., 2004 — Allegrini&al.04]

Paolo Allegrini, Paolo Grigolini, and Luigi Palatella. Intermittency and scale-free networks: A dynamical model for human language complexity. Chaos, Solitons & Fractals, 20(1):95–105, April 2004.

[Alm and Arkin, 2003 — Alm&Arkin03]

Eric Alm and Adam P Arkin. Biological networks. Current Opinion in Structural Biology, 13(2):193–202, April 2003.

[Almaas et al., 2002 — Almaas&al.02]

Elvind Almaas, Rajendra V. Kulkarni, and David Stroud. Characterizing the structure of small-world networks. Physical Review Letters, 88(9):098101, 2002.

[Amaral et al., 2000 — Amaral&al.00]

Luís A. Nunes Amaral, A. Scala, Marc Barthélémy, and H. E. Stanley. Classes of small-world networks. Proceedings of the National Academy of Sciences of the United States of America, 97:11149–11152, 2000.

[Amento et al., 2000 — Amento&al.00]

Brian Amento, Loren G. Terveen, and William C. Hill. Does ``authority'' mean quality? predicting expert quality ratings of Web documents. In Proceedings of the Twenty-Third Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '00), pages 296–303, 2000.

[Amitay et al., 2004 — Amitay&al.04]

Einat Amitay, David Carmel, Michael Herscovici, Ronny Lempel, and Aya Soffer. Trend detection through temporal link analysis. Journal of the American Society for Information Science and Technology, 55(14):1261–1269, December 2004.

[Andersen et al., 2004 — Andersen&al.04a]

Reid Andersen, Fan. R. K. Chung, and Lincoln Lu. Analyzing the small world phenomenon using a hybrid model with local network flow (extended abstract). In Proceedings of the FOCS '04 Third Workshop on Algorithms and Models for the Web-Graph (WAW '04), pages 19–30, 2004.

[Andersen et al., 2006 — Andersen&al.06]

Reid Andersen, Fan Chung, and Kevin Lang. Local graph partitioning using PageRank vectors. In Proceedings of the Forty-Seventh Annual Symposium on Foundations of Computer Science (FOCS '06), 2006.

[Anderson et al., 2002 — Anderson&al.02]

Corin R. Anderson, Pedro Domingos, and Daniel S. Weld. Relational Markov models and their application to adaptive Web navigation. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '02), pages 143–152, 2002.

[Ando and Zhang, 2006 — Ando&Zhang06]

Rie Kuboto Ando and Tong Zhang. Learning on graph with Laplacian regularization. In Proceedings of the Twentieth Conference on Advances in Neural Information Processing Systems (NIPS 19), 2006.

[Ángel F. Zazo et al., 2005 — Zazo&al.05]

Ángel F. Zazo, Carlos G. Figuerola, José L. Alonso Berrocal, and Emilio Rodríguez. Reformulation of queries using similarity thesauri. Information Processing and Management, 41(5):1163–1173, September 2005.

[Angelova and Weikum, 2006 — Angelova&Weikum06]

Ralitsa Angelova and Gerhard Weikum. Graph-based text classification: Learn from your neighbors. In Proceedings of the Twenty-Nineth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '06), pages 485–492, 2006.

[Angiulli, 2006 — Angiulli06]

Fabrizio Angiulli. Clustering by exceptions. In Proceedings of the Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Aritificial Intelligence Conference (AAAI '06/IAAI '06), 2006.

[Antiqueira et al., 2006 — Antiqueira&al.06]

L. Antiqueira, M.G.V. Nunes, O.N. Oliveira Jr., and L. da F. Costa. Strong correlations between text quality and complex networks features. Physica A, June 2006.

[Anyanwu et al., 2005 — Anyanwu&al.05]

Kemafor Anyanwu, Angela Maduko, and Amit P. Sheth. SemRank: Ranking complex relationship search results on the semantic Web. In Proceedings of the Fourteenth International Conference on the World Wide Web (WWW '05), pages 117–127, 2005.

[Arasu et al., 2002 — Arasu&al.02]

Arvind Arasu, Jasmine Novak, Andrew Tomkins, and John Tomlin. PageRank computation and the structure of the Web: Experiments and algorithms. In Proceedings of the Eleventh International Conference on the World Wide Web (WWW '02), 2002.

[Argyriou et al., 2005 — Argyriou&al.05]

Andreas Argyriou, Mark Herbster, and Massimilano Pontil. Combining graph Laplacians for semi-supervised learning. In Proceedings of the Ninteenth Conference on Advances in Neural Information Processing Systems (NIPS 18), pages 67–74, 2005.

[Artymiuk et al., 2005 — Artymiuk&al.05]

Peter J. Artymiuk, Ruth V. Spriggs, and Peter Willett. Graph theoretic methods for the analysis of structural relationships in biological macromolecules. Journal of the American Society for Information Science and Technology, 56(5):518–528, March 2005.

[Asavathiratham, 2000 — Asavathiratham00]

Chalee Asavathiratham. The Influence Model: A Tractable Representation for the Dynamics of Networked Markov Chains. PhD thesis, Massachusetts Institute of Technology, 2000.

[Axelrod et al., 2006 — Axelrod&al.06]

Robert Axelrod, David E. Axelrod, and Jenneth J. Pienta. Evolution of cooperation among tumor cells. Proceedings of the National Academy of Sciences of the United States of America, 103(36):13474–13479, September 2006.

[Azar et al., 2001 — Azar&al.01]

Yossi Azar, Amos Fiat, Anna R. Karlin, Frank Mcsherry, and Jared Saia. Spectral analysis of data. In Proceedings of the Thirty-Third ACM Symposium on the Theory of Computing (STOC '01), pages 619–626, 2001.

[Azran, 2007 — Azran07]

Arik Azran. The rendezvous algorithm: Multiclass semi-supervised learning with markov random walks. In Proceedings of the Twenty-fourth International Conference on Machine Learning (ICML '07), 2007.

[Backstrom et al., 2006 — Backstrom&al.06]

Lars Backstrom, Dan Huttenlocher, Jon Kleinberg, and Xiangyang Lan. Group formation in large social networks: Membership, growth, and evolution. In Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '06), pages 44–54, 2006.

[Badia and Kantardzic, 2005 — Badia&Kantardzic05]

Antonio Badia and Mehmed Kantardzic. Graph building as a mining activity: Finding links in the small. In Proceedings of the ACM SIGKDD '05 Workshop on Link Discovery: Issues, Approaches and Applications (LinkKDD '05), 2005.

[Baeza-Yates and Castillo, 2004 — Baeza-Yates&Castillo04]

Ricardo A. Baeza-Yates and Carlos Castillo. Crawling the infinite Web: Five levels are enough. In Proceedings of the FOCS '04 Third Workshop on Algorithms and Models for the Web-Graph (WAW '04), pages 156–167, 2004.

[Baeza-Yates and Poblete, 2004 — Baeza-Yates&Poblete04]

Ricardo Baeza-Yates and Bárbara Poblete. Dynamics of the Chilean Web structure. In Proceedings of the WWW '04 Third International Workshop on Web Dynamics, 2004.

[Baeza-Yates et al., 2003 — Baeza-Yates&al.03]

Ricardo Baeza-Yates, Carlos Castillo, and Felip Saint-Jean. Web dynamics, structure, and page quality. In Proceedings of the WWW '03 Second Workshop on Algorithms and Models for the Web-Graph (WAW '03), 2003.

[Baeza-Yates et al., 2006 — BaezaYates&al.06]

Ricardo Baeza-Yates, Paolo Boldi, and Carlos Castillo. Generalizing PageRank: Damping functions for link-based ranking algorithms. In Proceedings of the Twenty-Nineth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '06), pages 308–315, 2006.

[Bagnoli and Bezzi, 2001 — Bagnoli&Bezzi01]

Franco Bagnoli and Michele Bezzi. Small world effects in evolution. Physical Review E, 64(2):021914, August 2001.

[Bakke et al., 2006 — Bakke&al.06]

Jan Øystein Haavig Bakke, Alex Hansen, and János Kertész. Failure and avalanches in complex networks. Technical Report cond-mat/0605461, Arxiv.org, May 18, 2006.

[Balcan and Blum, 2005 — Balcan&Blum05]

Maria-Florina Balcan and Avrim Blum. A PAC-style model for learning from labeled and unlabeled data. In Proceedings of Computational Learning Theory, 2005.

[Balcan and Blum, 2006 — Balcan&Blum06]

Maria-Florina Balcan and Avrim Blum. On a theory of learning with similarity functions. In Proceedings of the Twenty-Third International Conference on Machine Learning (ICML '06), pages 73–80, 2006.

[Baliński and Danilowicz, 2005 — Balinski&Danilowicz05]

Jaroslaw Baliński and Czeslaw Danilowicz. Re-ranking method based on inter-document distances. Information Processing and Management, 41(4):759–775, July 2005.

[Balmin et al., 2004 — Balmin&al.04]

Andrey Balmin, Vagelis Hristidis, and Yannis Papakonstantinou. ObjectRank: Authority-based keyword search in databases. In Proceedings of the Thirtieth International Conference on Very Large Data Bases (VLDB '04), pages 564–575, 2004.

[Balthrop et al., 2004 — Balthrop&al.04]

Justin Balthrop, Stephanie Forrest, Mark E. J. Newman, and Matthew M. Williamson. Technological networks and the spread of computer viruses. Science, 304(5670):527–529, April 23, 2004.

[Baltz and Kliemann, 2005 — Baltz&Kliemann05]

Andreas Baltz and Lasse Kliemann. Spectral analysis. In Ulrik Brandes and Thomas Erlebach, editors, Network Analysis: Methodological Foundations, pages 373–416. Springer Berlin/Heidelberg, 2005. Lecture Notes in Computer Science - Volume 3418.

[Bansal et al., 2002 — Bansal&al.02]

Nikhil Bansal, Avrim Blum, and Shuchi Chawla. Correlation clustering. In Proceedings of the Forty-Third Annual Symposium on Foundations of Computer Science (FOCS '02), pages 238–250, 2002.

[Bansal et al., 2004 — Bansal&al.04]

Nikhil Bansal, Avrim Blum, and Shuchi Chawla. Correlation clustering. Machine Learning, 56(1-3):89–113, 2004.

[Bar-Ilan and Peritz, 2004 — Bar-Ilan&Peritz04]

Judit Bar-Ilan and Bluma C. Peritz. Evolution, continuity, and disappearance of documents on a specific topic on the Web: A longitudinal study of infometrics. Journal of the American Society for Information Science and Technology, 55(11):980–990, September 2004.

[Bar-Ilan, 2003 — Bar-Ilan03]

Judit Bar-Ilan. Towards a framework for link characterization. In Proceedings of the WWW '03 Second Workshop on Algorithms and Models for the Web-Graph (WAW '03), 2003.

[Bar-Ilan, 2005a — BarIlan05a]

Judit Bar-Ilan. Comparing rankings of search results on the Web. Information Processing and Management, 41(6):1511–1519, December 2005.

[Bar-Ilan, 2005b — BarIlan05]

Judit Bar-Ilan. What do we know about links and linking? a framework for studying links in academic environments. Information Processing and Management, 41(4):973–986, July 2005.

[Bar-Ilan, 2006 — Bar-Ilan06]

Judit Bar-Ilan. An ego-centric citation analysis of the works of Michael O. Rabin based on multiple citation indexes. Information Processing and Management, 42(6):1553–1566, December 2006.

[Bar-Yossef and Gurevich, 2006 — BarYossef&Gurevich06]

Ziv Bar-Yossef and Maxim Gurevich. Random sampling from a search engine's index. In Proceedings of the Fifteenth International Conference on the World Wide Web (WWW '06), pages 367–376, 2006.

[Bar-Yossef et al., 2000 — Bar-Yossef&al.00]

Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz. Approximating aggregate queries about Web pages via random walks. In Proceedings of the Twenty-Sixth International Conference on Very Large Data Bases (VLDB '00), pages 535–544, 2000.

[Barabási and Albert, 1999 — Barabasi&Albert99]

Albert-László Barabási and Réka Albert. Emergence of scaling in random networks. Science, 286(5439):509–512, October 15, 1999.

[Barabási et al., 1999 — Barabasi&al.99]

Albert-László Barabási, Réka Albert, and Hawoong Jeong. Mean-field theory for scale-free random networks. Physica A, 272(2):173–187, 1999.

[Barabási et al., 2000 — Barabasi&al.00]

Albert-László Barabási, Réka Albert, Hawoong Jeong, and J. B. Brockman. Power-law distribution of the World Wide Web. Science, 287:2115a, 2000.

[Barabási et al., 2001 — Barabasi&al.01]

Albert-László Barabási, Erzsebet Ravasz, and Tamas Vicsek. Deterministic scale-free networks. Physica A, 299(4):559–564, 2001.

[Barabási et al., 2002 — Barabasi&al.02]

Albert-László Barabási, Hawoong Jeong, Zoltan Néda, Erzsebet Ravasz, A. Schubert, and Tamas Vicsek. Evolution of the social network of scientific collaborations. Physica A, 311(4):590–614, 2002.

[Barabási et al., 2004 — Barabasi&al.04]

Albert-László Barabási, Zoltán N. Oltvai, and Stefan Wuchty. Characteristics of biological networks. In Eli Ben-Naim, Hans Frauenfelder, and Zoltan Toroczkai, editors, Complex Networks, pages 443–457. Springer Berlin/Heidelberg, 2004. Lecture Notes in Physics - Volume 650.

[Barabási, 2002 — Barabasi02]

Albert-László Barabási. Linked: The New Science of Networks. Perseus, New York, 2002.

[Barabási, 2005 — Barabasi05]

Albert-László Barabási. The architecture of complexity: The structure and the dynamics of networks, from the Web to the cell. In Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '05), page 3, 2005.

[Barbour and Reinert, 2001 — Barbour&Reinert01]

A. D. Barbour and Gesine Reinert. Small worlds. Random Structures and Algorithms, 19(1):54–74, 2001.

[Baronchelli and Loreto, 2004 — Baronchelli&Loreto04]

Andrea Baronchelli and Vittorio Loreto. Data compression approach to information extraction and classification. Technical Report cond-mat/0403233, Arxiv.org, August 20, 2004.

[Barrat and Weigt, 2000 — Barrat&Weigt00]

Alain Barrat and M. Weigt. On the properties of small-world network models. The European Physical Journal B, 13:547–560, 2000.

[Barrat et al., 2004a — Barrat&al.04]

Alain Barrat, M. Barthélemy, R. Pastor-Satorras, and A. Vespignani. The architecture of complex weighted networks. Proceedings of the National Academy of Sciences of the United States of America, 101(11):3747–3752, March 2004.

[Barrat et al., 2004b — Barrat&al.04b]

Alain Barrat, Marc Barthélemy, and Alessandro Vespignani. Traffic-driven model of the World Wide Web graph. In Proceedings of the FOCS '04 Third Workshop on Algorithms and Models for the Web-Graph (WAW '04), pages 56–67, 2004.

[Barrat et al., 2004c — Barrat&al.04a]

Alain Barrat, Marc Bethélemy, and Alessandro Vespignani. Modeling the evolution of weighted networks. Physical Review E, 70:066149, 2004.

[Barthélémy and Amaral, 1999 — Barthelemy&Amaral99]

Marc Barthélémy and Luís A. Nunes Amaral. Small-world networks: evidence for a crossover picture. Physical Review Letters, 82:3180–3183, 1999.

[Batagelj and Mrvar, 2003 — Batagelj&Mrvar03]

Vladimir Batagelj and Andrej Mrvar. Density based approaches to network analysis: Analysis of Reuters terror news network. In Proceedings of the ACM SIGKDD '03 Workshop on Link Analysis for Detecting Complex Behavior (LinkKDD '03), 2003.

[Batagelj and Mrvar, 2006 — Batagelj&Mrvar06]

Vladimir Batagelj and Andrej Mrvar. Pajek: Program for Analysis and Visualization of Large Networks, March 27, 2006.

[Bauer and Bernard, 2002 — Bauer&Bernard02]

M. Bauer and D. Bernard. A simple asymmetric evolving random network. Technical Report cond-mat/0203232, Arxiv.org, 2002.

[Baxter, 1982 — Baxter82]

R. J. Baxter. Exactly Solved Models in Statistical Mechanics. Academic Press, London, 1982.

[Becchetti et al., 2006 — Becchetti&al.06]

Luca Becchetti, Carlos Casillo, Debora Donato, Stefano Leonardi, and Ricardo Baeza-Yates. Using rank propagation and probabilistic counting for link-based spam detection. In Proceedings of the 2006 Workshop on The Future of Web Search, Barcelona, Spain, May 19-20 2006.

[Beeferman and Berger, 2000 — Beeferman&Berger00]

Doug Beeferman and Adam Berger. Agglomerative clustering of a search engine query log. In Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '00), pages 407–416, 2000.

[Belding, 2004 — Belding04]

Theodore C. Belding. Nobility and stupidity: Modeling the evolution of class endogamy. Technical Report nLin.AO/0405048, Arxiv.org, June 3, 2004.

[Belkin and Niyogi, 2001 — Belkin&Niyogi01]

Mikhail Belkin and Partha Niyogi. Laplacian Eigenmaps and spectral techniques for embedding and clustering. In Proceedings of the Fifteenth Conference on Advances in Neural Information Processing Systems (NIPS 14), pages 585–591, 2001.

[Belkin and Niyogi, 2002 — Belkin&Niyogi02]

Mikhail Belkin and Partha Niyogi. Using manifold structure for partially labelled classification. In Proceedings of the Sixteenth Conference on Advances in Neural Information Processing Systems (NIPS 15), pages 929–936, 2002.

[Belkin and Niyogi, 2003 — Belkin&Niyogi03]

Mikhail Belkin and Partha Niyogi. Laplacian Eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6):1373–1396, 2003.

[Belkin and Niyogi, 2004 — Belkin&Niyogi04]

Mikhail Belkin and Partha Niyogi. Semi-supervised learning on Riemannian manifolds. Machine Learning, 56(1-3):209–239, 2004.

[Belkin et al., 2004a — Belkin&al.04b]

Mikhail Belkin, Irina Matveeva, and Partha Niyogi. Regularization and semi-supervised learning on large graphs. In COLT2004, 2004.

[Belkin et al., 2004b — Belkin&al.04a]

Mikhail Belkin, Partha Niyogi, and Vikas Sindhwani. Manifold regularization: A geometric framework for learning from examples. Technical report, University of Chicago Department of Computer Science, August 25, 2004.

[Belkin et al., 2005 — Belkin&al.05]

M. Belkin, P. Niyogi, and V. Sindhwani. On manifold regularization. In AISTAT, 2005.

[Belkin et al., 2006 — Belkin&al.06]

Mikhail Belkin, Partha Niyogi, and Vikas Sindhwani. Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. Journal of Machine Learning Research, 7:2399–2434, November 2006.

[Ben-Naim et al., 2004 — Ben-Naim&al.04]

Eli Ben-Naim, Paul L. Krapivsky, and Sidney Redner. Extremal properties of random structures. In Eli Ben-Naim, Hans Frauenfelder, and Zoltan Toroczkai, editors, Complex Networks, pages 211–233. Springer Berlin/Heidelberg, 2004. Lecture Notes in Physics - Volume 650.

[Benczúr et al., 2005 — Benczur&al.05]

András A. Benczúr, Károly Csalogány, Tamás Sarlós, and Máté Uher. SpamRank - fully automatic link spam detection. In Proceedings of the WWW '05 Workshop on Adversarial Information Retrieval on the Web (AIRWeb '05), 2005.

[Benczúr et al., 2006 — Sarlos&al.06]

Tamás Sarlós András A. Benczúr, Károly Csalogány, Dániel Fogaras, and Balázs Rácz. To randomize or not to randomize: Space optimal summaries for hyperlink analysis. In Proceedings of the Fifteenth International Conference on the World Wide Web (WWW '06), pages 297–306, 2006.

[Bender and Canfield, 1978 — Bender&Canfield78]

E. A. Bender and E. R. Canfield. The asymptotic number of labelled graphs with given degree sequences. Journal of Combinatorial Theory A, 24:296–307, 1978.

[Bennett and Demiriz, 1998 — Bennett&Demiriz98]

Kristin P. Bennett and Ayhan Demiriz. Semi-supervised support vector machines. In Proceedings of the Twelfth Conference on Advances in Neural Information Processing Systems (NIPS 11), pages 368–374, 1998.

[Bennett et al., 1998 — Bennet&al.98]

Kristin P. Bennett, Ayhan Demiriz, Zehra Cataltepe, Nathan Intrantor, Nathalie Japkowicz, Andrew McCallum, and Tom Mitchell. Using unlabeled data to help supervised learning. In Proceedings of the NIPS '98 Workshop on Integrating Supervised and Unsupervised Learning, 1998.

[Benoît, 2005 — Benoit05]

Gerald Benoît. Application of Markov chains in an interactive information retrieval system. Information Processing and Management, 41(4):843–857, July 2005.

[Bensman, 2004 — Bensman04]

Stephen J. Bensman. Pearson's r and author cocitation analysis: A commentary on the controversy. Journal of the American Society for Information Science and Technology, 55(10):935, August 2004.

[Berberich et al., 2004 — Berberich&al.04]

Klaus Berberich, Michalis Vazirgiannis, and Gerhard Weikum. T-Rank: Time-aware authority ranking. In Proceedings of the FOCS '04 Third Workshop on Algorithms and Models for the Web-Graph (WAW '04), pages 131–142, 2004.

[Berg and Lässig, 2002 — Berg&Lassig02]

Johannes Berg and Michael Lässig. Correlated random networks. Technical Report cond-mat/0205589, Arxiv.org, 2002.

[Bernardes et al., 2002 — Bernardes&al.02]

Americo T. Bernardes, Dietrich Stauffer, and Janos Kertész. Election results and the Sznajd model on Barabási network. The European Physical Journal B, 25:123–127, 2002.

[Bhalla and Iyengar, 1999 — Bhalla&Iyengar99]

Upinder S. Bhalla and Ravi Iyengar. Emergent properties of networks of biological signaling pathways. Science, 283:339–340, January 15, 1999.

[Bharat and Broder, 1998 — Bharat&Broder98]

Krishna Bharat and Andrei Broder. A technique for measuring the relative size and overlap of public Web search engines. In Proceedings of the Seventh International Conference on the World Wide Web (WWW '98), 1998.

[Bharat and Henzinger, 1998 — Bharat&Henzinger98]

Krishna Bharat and Monika Rauch Henzinger. Improved algorithms for topic distillation in a hyperlinked environment. In Proceedings of the Twenty-First Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '98), pages 104–111, 1998.

[Bharat et al., 1998 — Bharat&al.98]

Krishna Bharat, Andrei Broder, Monika Henzinger, Puneet Kumar, and Suresh Venkatasubramanian. The connectivity server: Fast access to linkage information on the Web. Computer Networks and ISDN Systems, 30(1-7):469–477, April 1, 1998.

[Bharat et al., 2001 — Bharat&al.01]

Krishna Bharat, B. Chang, M. Henzinger, and M. Ruhl. Who links to whom: Mining linkage between Web sites. In In Proceedings of IEEE ICDM-01, pages 51–58, 2001.

[Bhattacharya and Getoor, 2004 — Bhattacharya&Getoor04]

Indrajit Bhattacharya and Lise Getoor. Deduplication and group detection using links. In Proceedings of the ACM SIGKDD '04 Workshop on Link Analysis for Detecting Complex Behavior (LinkKDD '04), 2004.

[Bialas et al., 1997 — Bialas&al.97]

Piotr Bialas, Zdzislaw Burda, and Des Johnston. Condensation in the backgammon model. Nuclear Physics B, 493(3):505–516, 1997.

[Bianchini et al., 2001 — Bianchini&al.01]

Monica Bianchini, Marco Gori, and Franco Scarselli. Inside Google's Web page scoring system, 2001.

[Bianchini et al., 2002 — Bianchini&al.02]

Monica Bianchini, Marco Gori, and Franco Scarselli. PageRank: A circuital analysis. In Proceedings of the Eleventh International Conference on the World Wide Web (WWW '02), 2002.

[Bianchini et al., 2005 — Bianchini&al.05]

Monica Bianchini, Marco Gori, and Franco Scarselli. Inside PageRank. ACM Transactions on Internet Technology, 5(1):92–128, February 2005.

[Bianconi and Barabási, 2001a — Bianconi&Barabasi01b]

Ginestra Bianconi and Albert-László Barabási. Bose-Einstein condensation in complex networks. Physical Review Letters, 86(24):5632–5635, June 11, 2001.

[Bianconi and Barabási, 2001b — Bianconi&Barabasi01a]

Ginestra Bianconi and Albert-László Barabási. Competition and multiscaling in evolving networks. Europhysics Letters, 54(4):436–442, 2001.

[Bianconi and Marsili, 2006 — Bianconi&Marsili06]

Ginestra Bianconi and Matteo Marsili. Number of cliques in random scale-free network ensembles. Technical Report cond-mat/0606088, Arxiv.org, June 5, 2006.

[Bianconi, 2002 — Bianconi02]

Ginestra Bianconi. Mean-field solution of the ising model on a barabási-Albert network. Technical Report cond-mat/0204455, Arxiv.org, 2002.

[Bie and Cristianini, 2006 — Bie&Cristianini06]

Tijl De Bie and Nello Cristianini. Fast SDP relaxations of graph cut clustering, transduction, and other combinatorial problems. Journal of Machine Learning Research, 7:1409–1436, July 2006.

[Biemann, 2006 — biemann:2006:TextGraphs]

Chris Biemann. Chinese whispers - an efficient graph clustering algorithm and its application to natural language processing problems. In Proceedings of TextGraphs: the Second Workshop on Graph Based Methods for Natural Language Processing, pages 73–80, New York City, June 2006. Association for Computational Linguistics.

[Bilke and Peterson, 2001 — Bilke&Peterson01]

Sven Bilke and Carston Peterson. Topological properties of citation and metabolic networks. Physical Review E, 64(3):036106, September 2001.

[Billerbeck et al., 2003 — Billerbeck&al.03]

Bodo Billerbeck, Falk Scholer, Hugh E. Williams, and Justin Zobel. Query expansion using associated queries. In Proceedings of the Twelfth International Conference on Information and Knowledge Management (ACM CIKM '03), pages 2–9, 2003.

[Bjorneborn and Ingwersen, 2004 — Bjorneborn&Ingwersen04]

Lennart Bjorneborn and Peter Ingwersen. Toward a basic framework for webometrics. Journal of the American Society for Information Science and Technology, 55(14):1216–1227, December 2004.

[Blockeel and D u zeroski, 2005 — Blockeel&Dzeroski05]

Hendrik Blockeel and Sa u so D u zeroski. MultiRelational data mining 2005: Workshop report. SIGKDD Explorations Newsletter, 7(2):126–128, 2005.

[Blondel et al., 2004 — Blondel&al.04]

Vincent D. Blondel, Anahí Gajardo, Maureen Heymans, Pierre Senellart, and Paul Van Dooren. A measure of similarity between graph vertices: Applications to synonym extraction and Web searching. Society for Industrial and Applied Mathematics Review, 46(4), 2004.

[Bluestein, 1999 — Bluestein99]

William James Bluestein. Hypertext versions of journal articles: computer aided linking and realistic human evaluation. PhD thesis, University of Western Ontario, 1999.

[Blum and Chawla, 2001 — Blum&Chawla01]

Avrim Blum and Shuchi Chawla. Learning from labeled and unlabeled data using graph mincuts. In Proceedings of the Eighteenth International Conference on Machine Learning (ICML '01), pages 19–26, 2001.

[Blum and Mitchell, 1998 — Blum&Mitchell98]

Avrim Blum and Tom Mitchell. Combining labeled and unlabeled data with co-training. In Proceedings of the Eleventh Annual Conference on Computational Learning Theory (COLT '98), pages 92–100, Madison, Wisconsin, USA, 1998. ACM Press.

[Blum et al., 2004 — Blum&al.04]

Avrim Blum, John D. Lafferty, Mugizi Robert Rwebangira, and Rajashekar Reddy. Semi-supervised learning using randomized mincuts. In Proceedings of the Twenty-First International Conference on Machine Learning (ICML '04), 2004.

[Boldi et al., 2004 — Boldi&al.04]

Paolo Boldi, Massimo Santini, and Sebastiano Vigna. Do your worst to make the best: Paradoxical effects in PageRank incremental computations. In Proceedings of the FOCS '04 Third Workshop on Algorithms and Models for the Web-Graph (WAW '04), pages 168–180, 2004.

[Bollen et al., 2006 — Bollen&al.06]

Johan Bollen, Marko A. Rodriguez, and Herbert Van de Sompel. Journal status. Scientometrics, 69(3):669–687, December 2006.

[Bollobás and de la Vega, 1982 — Bollobas&Vega82]

Béla Bollobás and Wenceslas Fernandez de la Vega. The diameter of random regular graphs. Combinatorica, 2(2):125–134, 1982.

[Bollobás and Riordan, 2003a — Bollobas&Riordan03]

Béla Bollobás and Oliver Riordan. Coupling scale-free and classical random graphs. Internet Mathematics, 1(2):215–225, 2003.

[Bollobás and Riordan, 2003b — Bollobas&Riordan03a]

Béla Bollobás and Oliver Riordan. The diameter of a scale-free random graph. Preprint, 2003.

[Bollobás and Riordan, 2003c — Bollobas&Riordan03b]

Béla Bollobás and Oliver Riordan. Robustness and vulnerability of scale-free random graphs. Internet Mathematics, 1(1):1–35, 2003.

[Bollobás and Riordan, 2004 — Bollobas&Riordan04]

Béla Bollobás and Oliver Riordan. The phase transition and connectedness in uniformly grown random graphs. In Proceedings of the FOCS '04 Third Workshop on Algorithms and Models for the Web-Graph (WAW '04), pages 1–18, 2004.

[Bollobás et al., 2001 — Bollobas&al.01]

Béla Bollobás, Oliver Riordan, Joel Spencer, and Gabor Tusnady. The degree sequence of a scale-free random graph process. Random Structure Algorithms, 18:279–290, 2001.

[Bollobas et al., 2005 — Bollobas&al.05]

Bela Bollobas, Svante Janson, and Oliver Riordan. The phase transition in inhomogeneous random graphs. Technical Report math.PR/0504589, Arxiv.org, August 31, 2005.

[Bollobás, 1980 — Bollobas80]

Béla Bollobás. A probabilistic proof of an asymptotic formula for the number of labelled random graphs. The European Journal of Combinatorics, 1(311–316), 1980.

[Bollobás, 1985 — Bollobas85]

Béla Bollobás. Random Graphs. Academic Press, London, United Kingdom, 1985.

[Bollobás, 1998 — Bollobas98]

Béla Bollobás. Modern Graph Theory. Springer, New York, 1998.

[Bonacich, 1987 — Bonacich87]

Philip Bonacich. Power and centrality: A family of measures. American Journal of Sociology, 92(5):1170–1182, March 1987.

[Bonato and Janssen, 2002 — Bonato&Janssen02]

A. Bonato and J. Janssen. Limits of models of the Web graph. In Proceedings of the FOCS '02 First Workshop on Algorithms and Models for the Web-Graph (WAW '02), 2002.

[Bonato and Janssen, 2003 — Bonato&Janssen03]

Anthony Bonato and Jeanette Janssen. Infinite limits of copying models of the Web graph. Internet Mathematics, 1(2):193–213, 2003.

[Bordag et al., 2003 — Bordag&al.03]

Stefan Bordag, Gerhard Heyer, and Uwe Quasthoff. Small worlds of concepts and other principles of semantic search. Lecture Notes in Computer Science, 2877:10–19, 2003.

[Borgs et al., 2004 — Borgs&al.04]

Christian Borgs, Jennifer T. Chayes, Mohammad Mahdian, and Amin Saberi. Exploring the community structure of newsgroups. In Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '04), pages 783–787, 2004.

[Bornholdt and Ebel, 2001 — Bornholdt&Ebel01]

Stefan Bornholdt and Holger Ebel. World-wide Web scaling exponent from simon's 1955 model. Physical Review E, 64(3):035104, September 2001.

[Bornholdt and Rohlf, 2000 — Bornholdt&Rohlf00]

Stefan Bornholdt and Thimo Rohlf. Topological evolution of dynamical networks: Global criticality from local dynamical rules. Physical Review Letters, 84(26):6114–6117, June 26, 2000.

[Bornholdt and Schuster, 2002 — Bornholdt&Schuster02]

Stefan Bornholdt and Heinz Georg Schuster, editors. Handbook of Graphs and Networks. Wiley-VCH, Berlin, 2002.

[Borodin et al., 2001 — Borodin&al.01]

Allan Borodin, Gareth O. Roberts, Jeffrey S. Rosenthal, and Panayiotis Tsaparas. Finding authorities and hubs from link structures on the World Wide Web. In Proceedings of the Tenth International Conference on the World Wide Web (WWW '01), pages 415–429, 2001.

[Borodin et al., 2005 — Borodin&al.05]

Allan Borodin, Gareth O. Roberts, Jeffrey S. Rosenthal, and Panayiotis Tsaparas. Link analysis ranking: Algorithms, theory, and experiments. ACM Transactions on Internet Technology, 5(1):231–297, February 2005.

[Bose, 2002 — Bose02]

Indrani Bose. Biological networks. Technical Report cond-mat/0202192, Arxiv.org, 2002.

[Botafogo and Shneiderman, 1991 — Botafogo&Shneiderman91]

Rodrigo A. Botafogo and Ben Shneiderman. Identifying aggregates in hypertext structures. In Proceedings of the 1991 Conference on Hypertext, pages 63–74, San Antonio, Texas, USA, 1991. ACM Press.

[Bouali et al., 2005 — Bouali&al.05]

Fatma Bouali, Latifur Khan, and Florent Masseglia. The 6th international workshop on multimedia data mining (mdm/kdd2005). SIGKDD Explorations Newsletter, 7(2):148–150, 2005.

[Bouchaud and Mézard, 2000 — Bouchaud&Mezard00]

Jean-Philippe Bouchaud and Marc Mézard. Wealth condensation in a simple model of economy. Physica A, 282(4):536–545, 2000.

[Bouchaud and Potters, 2000 — Bouchaud&Potters00]

Jean-Philippe Bouchaud and Marc Potters. Theory of Financial Risks: From Statistical Physics to Risk Management. Cambridge University Press, Cambridge, 2000.

[Boyan et al., 1996 — Boyan&al.96]

Justin Boyan, Dayne Freitag, and Thorsten Joachims. A machine learning architecture for optimizing Web search engines. In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Conference on Innovative Applications of Artificial Intelligence (AAAI '96/IAAI '96), 1996.

[Boykov et al., 1999 — Boykov&al.99]

Yuri Boykov, Olga Veksler, and Ramin Zabih. Fast approximate energy minimization via graph cuts. In Proceedings of the International Conference on Computer Vision (ICCV 1), pages 377–384, 1999.

[Brants, 2005 — Brants05]

Thorsten Brants. Test data likelihood for PLSA models. Information Retrieval, 8(2):181–196, April 2005.

[Bray, 1996 — Bray96]

Tim Bray. Measuring the Web. In Proceedings of the Fifth International Conference on the World Wide Web (WWW '96), pages 993–1005, 1996.

[Brewington and Cybenko, 2000a — Brewington&Cybenko00b]

Brian E. Brewington and George Cybenko. How dynamic is the Web?. In Proceedings of the Ninth International Conference on the World Wide Web (WWW '00), 2000.

[Brewington and Cybenko, 2000b — Brewington&Cybenko00a]

Brian E. Brewington and George Cybenko. Keeping up with the changing Web. IEEE Computer Magazine, 33(5):52–58, 2000.

[Brin and Page, 1998 — Brin&Page98]

Sergey Brin and Lawrence Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30(1–7):107–117, 1998.

[Brinkmeier, 2006 — Brinkmeier06]

Michael Brinkmeier. PageRank revisited. ACM Transactions on Internet Technology, 6(3):282–301, August 2006.

[Broder et al., 1997 — Broder&al.97]

Andrei Z. Broder, Steven C. Glassman, Mark S. Manasse, and Geoffrey Zweig. Syntactic clustering of the Web. In Proceedings of the Sixth International Conference on the World Wide Web (WWW '97), 1997.

[Broder et al., 2000a — Broder&al.00]

Andrei Broder, Ravi Kumar, Farzin Maghoul, Prabhakar Raghavan, Sridhar Rajagopalan, Raymie Stata, Andrew Tomkins, and Janet Wiener. Graph structure in the web. In Proceedings of the Ninth International Conference on the World Wide Web (WWW '00), 2000.

[Broder et al., 2000b — Broder&al.00a]

Andrei Z. Broder, Robert Krauthgamer, and Michael Mitzenmacher. Improved classification via connectivity information. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '00), pages 576–585, San Francisco, California, United States, 2000. Society for Industrial and Applied Mathematics.

[Broder et al., 2006a — Broder&al.06a]

A. Z. Broder, R. Lempel, F. Maghoul, and J. Pedersen. Efficient PageRank approximation via graph aggregation. Information Retrieval, 9(2):123–138, March 2006.

[Broder et al., 2006b — Broder&al.06]

Andrei Broder, Marcus Fontura, Vanja Josifovski, Ravi Kumar, Rajeev Motwani, Shubha Nabar, Rina Panigrahy, Andrew Tomkins, and Ying Xu. Estimating corpus size via queries. In Proceedings of the Fifteenth International Conference on Information and Knowledge Management (ACM CIKM '06), pages 594–603, 2006.

[Brown et al., 2002 — Brown&al.02]

James H. Brown, Vijay K. Gupta, Bai-Lian Li, Bruce T. Milne, Carla Restrepo, and Geoffrey B. West. The fractal nature of nature: Power laws, ecological complexity and biodiversity. Philosophical Transactions of the Royal Society of London B, 357(1421):619–626, May 29, 2002.

[Bryan and Leise, 2006 — Bryan&Leise06]

Kurt Bryan and Tanya Leise. The 25,000,000,000 dollars eigenvector The linear algebra behind Google. SIAM Review, 48(3):569–581, September 2006.

[Buchanan, 2002 — Buchanan02]

Mark Buchanan. Nexus: Small Worlds and the Groundbreaking Science of Networks. W. W. Norton & Co., New York, 2002.

[Burda et al., 2001 — Burda&al.01]

Zdzislaw Burda, Joao D. Correia, and Andre Krzywicki. Statistical ensemble of scale-free random graphics. Physical Review E, 64(4):046118, October 2001.

[Burda et al., 2002 — Burda&al.02]

Zdzislaw Burda, D. Johnston, Jerzy Jurkiewicz, M. Kaminski, Maciej A. Nowak, Gabor Papp, and Ismail Zahed. Wealth condensation in Pareto macro-economics. Physical Review E, 65:026102, 2002.

[Burrell, 2002 — Burrell02]

Quentin L. Burrell. Will this paper ever be cited?. Journal of the American Society for Information Science and Technology, 53(3):232–235, 2002.

[Burrell, 2003a — Burrell03a]

Quentin L. Burrell. Age-specific citation rates and the Egghe-Rao function. Information Processing and Management, 39(5):761–770, September 2003.

[Burrell, 2003b — Burrell03b]

Quentin L. Burrell. Predicting future citation behavior. Journal of the American Society for Information Science and Technology, 54(5):372–378, March 2003.

[Burrell, 2004 — Burrell04]

Quentin L. Burrell. Fitting Lotka's law: Some cautionary observations on a recent paper by Newby et al. (2003). Journal of the American Society for Information Science and Technology, 55(13):1209–1210, December 2004.

[Butler, 2000 — Butler00]

Declan Butler. Souped-up search engines. Nature, 405(6783):112, 2000.

[Cai et al., 2005 — Cai&al.05]

Deng Cai, Zheng Shao, Xiaofei He, Xifeng Yan, and Jiawei Han. Mining hidden community in heterogeneous social networks. In Proceedings of the ACM SIGKDD '05 Workshop on Link Discovery: Issues, Approaches and Applications (LinkKDD '05), pages 58–65, 2005.

[Calado et al., 2003a — Calado&al.03b]

Pável Calado, Marco Cristo, Edleno Silva de Moura, Nivio Ziviani, Berthier A. Ribeiro-Neto, and Marcos André Gonçalves. Combining link-based and content-based methods for Web document classification. In Proceedings of the Twelfth International Conference on Information and Knowledge Management (ACM CIKM '03), pages 394–401, 2003.

[Calado et al., 2003b — Calado&al.03a]

Pável Calado, Berthier Ribeiro-Neto, Nivio Ziviani, Edleno Moura, and Ilmério Silva. Local versus global link information in the Web. ACM Transactions on Information Systems, 21(1):42–63, January 2003.

[Calado et al., 2006 — Calado&al.06]

Pável Calado, Marco Cristo, Marcos André Gonçalves, Edleno S. de Moura, Berthier Ribeiro-Neto, and Nivio Ziviani. Link-based similarity measures for the classification of Web documents. Journal of the American Society for Information Science and Technology, 57(2):208–221, January 2006.

[Caldarelli et al., 2002a — Caldarelli&al.02a]

G. Caldarelli, A. Capocci, P. De Los Rios, and M.A. Munoz. Scale-free networks without growth or preferential attachment: Good get richer. Technical Report cond-mat/0207366, Arxiv.org, October 28, 2002.

[Caldarelli et al., 2002b — Caldarelli&al.02b]

G. Caldarelli, P. De Los Rios, L. Laura, and S. Leonardi. A multi-layer model for the Webgraph. In 2nd International Workshop on Web Dynamics, Honolulu, Hawaii, May 2002.

[Caldarelli et al., 2003a — Caldarelli&al.03a]

G. Caldarelli, P. De Los Rios, L. Laura, S. Leonardi, and S. Millozzi. A study of stochastic models for the Web Graph. Technical Report 04-03, dipartimento di Informatica e Sistemistica, Universita' di Roma ``La Sapienza", 2003.

[Caldarelli et al., 2003b — Caldarelli&al.03b]

G. Caldarelli, P. De Los Rios, L. Laura, S. Leonardi, and S. Millozzi. A study of the properties of Web graphs. In 2nd Workshop on Algorithms and Models for the Web-Graph (WAW 2003), Budapest, Hungary, May 2003.

[Caldeira et al., 2006 — Caldeira&al.06]

Silvia M. G. Caldeira, Thierry C. Petit Lob ao, R. F. S. Andrade, Alexis Neme, and J. G. V. Miranda. The network of concepts in written texts. European Physical Journal B, 49(4):523–529, February 2006.

[Callaway et al., 2000 — Callaway&al.00]

Duncan S. Callaway, Mark E. J. Newman, Steven H. Strogatz, and Duncan J. Watts. Network robustness and fragility: Percolation on random graphs. Physical Review Letters, 85(25):5468–5471, December 18, 2000.

[Callaway et al., 2001 — Callaway&al.01]

Duncan S. Callaway, John E. Hopcroft, Jon M. Kleinberg, Mark E. J. Newman, and Steven H. Strogatz. Are randomly grown graphs really random?. Physical Review E, 64(4):041902, October 2001.

[Calvó-Armengol and Zenou, 2001 — Calvo-Armengol&Zenou01]

Antoni Calvó-Armengol and Yves Zenou. Job matching, social network and word-of-mouth communication. Technical Report nep/0111003, Arxiv.org, 2001.

[Capocci et al., 2004 — Capocci&al.04]

Andrea Capocci, Vito Domenico Pietro Servedio, Guido Caldarelli, and Francesca Colaiori. Communities detection in large networks. In Proceedings of the FOCS '04 Third Workshop on Algorithms and Models for the Web-Graph (WAW '04), pages 181–188, 2004.

[Capocci et al., 2006 — Capocci&al.06]

A. Capocci, V. D. P. Servedio, F. Colaiori, L. S. Buriol, D. Donato, S. Leonardi, and G. Caldarelli. Preferential attachment in the growth of social networks: the case of Wikipedia. Physical Review E, 74, September 25, 2006.

[Carlson and Doyle, 1999 — Carlson&Doyle99]

J. M. Carlson and John Doyle. Highly optimized tolerance: A mechanism for power laws in designed systems. Physical Review E, 60(2):1412–1427, August 1999.

[Carlson and Doyle, 2000 — Carlson&Doyle00]

J. M. Carlson and John Doyle. Highly optimized tolerance: Robustness and design in complex systems. Physical Review Letters, 84(11):2529–2532, March 13, 2000.

[Carrière and Kazman, 1997 — Carriere&Kazman97]

Jeromy Carrière and Rick Kazman. Webquery: Searching and visualizing the Web through connectivity. In Proceedings of the Sixth International Conference on the World Wide Web (WWW '97), pages 701–711, 1997.

[Chakrabarti and Das, 2005 — Chakrabarti&Das05]

Bikas K. Chakrabarti and Arnab Das. Tranverse Ising model, glass and quantum annealing. In Arnab Das and Bikas K. Chakrabarti, editors, Quantum Annealing and Related Optimization Methods. Springer, Heidelberg, 2005. Lecture Notes in Physics - Volume 679.

[Chakrabarti and Dom, 1998 — Chakrabarti&Dom98]

Soumen Chakrabarti and Byron Edward Dom. Feature diffusion across hyperlinks, April 1998.

[Chakrabarti and Faloutsos, 2006 — Chakrabarti&Faloutsos06]

Deepayan Chakrabarti and Christos Faloutsos. Graph mining: Laws, generators, and algorithms. ACM Computing Surveys, 38(1):2, March 2006.

[Chakrabarti et al., 1998a — Chakrabarti&al.98a]

S. Chakrabarti, B. Dom, P. Raghavan, S. Rajagopalan, D. Gibson, and Jon M. Kleinberg. Automatic resource compilation by analyzing hyperlink structure and associated text. In Proceedings of the Seventh International Conference on the World Wide Web (WWW '98), pages 65–74, 1998.

[Chakrabarti et al., 1998b — Chakrabarti&al.98c]

Soumen Chakrabarti, Byron Dom, Rakesh Agrawal, and Prabhakar Raghavan. Scalable feature selection, classification and signature generation for organizing large text databases into hierarchical topic taxonomies. The International Journal on Very Large Data Bases, 7(3):163–178, 1998.

[Chakrabarti et al., 1998c — Chakrabarti&al.98b]

Soumen Chakrabarti, Byron Dom, and Piotr Indyk. Enhanced hypertext categorization using hyperlinks. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (SIGMOD '98), pages 307–318, 1998.

[Chakrabarti et al., 1999a — Chakrabarti&al.99d]

Soumen Chakrabarti, Byron Dom, David Gibson, Jon Kleinberg, S. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew Tomkins. Hypersearching the Web. Scientific American, 280(6):54–60, June 1999.

[Chakrabarti et al., 1999b — Chakrabarti&al.99a]

Soumen Chakrabarti, Byron E. Dom, S. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins, David Gibson, and Jon Kleinberg. Mining the Web's link structure. Computer, 32(8):60–67, 1999.

[Chakrabarti et al., 1999c — Chakrabarti&al.99c]

Soumen Chakrabarti, David A. Gibson, and Kevin S. McCurley. Surfing the Web backwards. In Proceedings of the Eighth International Conference on the World Wide Web (WWW '99), pages 1679–1693, 1999.

[Chakrabarti et al., 1999d — Chakrabarti&al.99b]

Soumen Chakrabarti, Martin van den Berg, and Byron Dom. Focused crawling: A new approach to topic-specific Web resource discovery. In Proceedings of the Eighth International Conference on the World Wide Web (WWW '99), 1999.

[Chakrabarti et al., 2001 — Chakrabarti&al.01]

Soumen Chakrabarti, Mukul Joshi, and Vivek Tawde. Enhanced topic distillation using text, markup tags, and hyperlinks. In Proceedings of the Twenty-Fourth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '01), pages 208–216, 2001.

[Chakrabarti et al., 2002a — Chakrabarti&al.02b]

Soumen Chakrabarti, Mukul M. Joshi, Kunal Punera, and David M. Pennock. The structure of broad topics on the Web. In Proceedings of the Eleventh International Conference on the World Wide Web (WWW '02), pages 251–262, 2002.

[Chakrabarti et al., 2002b — Chakrabarti&al.02a]

Soumen Chakrabarti, Kunal Punera, and Mallela Subramanyam. Accelerated focused crawling through online relevance feedback. In Proceedings of the Eleventh International Conference on the World Wide Web (WWW '02), 2002.

[Chakrabarti et al., 2006 — Chakrabarti&al.06]

Deepayan Chakrabarti, Ravi Kumar, and Andrew Tomkins. Evolutionary clustering. In Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '06), pages 554–560, 2006.

[Chakrabarti, 2004 — Chakrabarti04]

Soumen Chakrabarti. Discovering links between lexical and surface features in questions and answers. In Proceedings of the ACM SIGKDD '04 Workshop on Link Analysis for Detecting Complex Behavior (LinkKDD '04), 2004.

[Chapelle and Zien, 2005 — Chapelle&Zien05]

O. Chapelle and A. Zien. Semi-supervised classification by low density separation. In AISTAT, 2005.

[Chapelle et al., 2006 — Chapelle&al.06]

Olivier Chapelle, Bernhard Schölkopf, and Alexander Zien. Semi-supervised learning. In Olivier Chapelle, Bernhard Schölkopf, and Alexander Zien, editors, Semi-Supervised Learning. MIT Press, 2006.

[Chatterjee and Sen, 2006 — Chatterjee&Sen06]

Arnab Chatterjee and Parongama Sen. Phase transitions in Ising model on a Euclidian network. Technical Report cond-mat/0606138, Arxiv.org, August 2, 2006.

[Chau et al., 2005 — Chau&al.05]

Michael Chau, Xiao Fang, and Olivia R. Liu Sheng. Analysis of the query logs of a web site search engine. Journal of the American Society for Information Science and Technology, 56(13):1363–1376, November 2005.

[Chawla and Karakoulas, 2005 — Chawla&Karakoulas05]

N. V. Chawla and G. Karakoulas. Learning from labeled and unlabeled data: An empirical study across techniques and domains. Journal of Artificial Intelligence Research, 23:331–366, 2005.

[Chen et al., 1995 — Chen&al.95]

Ye-Sho Chen, P. Pete Chong, and Morgan Y. Tong. Dynamic behavior of Bradford's law. Journal of the American Society for Information Science, 46(5):321–397, June 1995.

[Chen et al., 2002a — Chen&al.02a]

Qian Chen, Hyunseok Chang, Ramesh Govindan, Sugih Jamin, Scott J. Shenker, and Walter Willinger. The origin of power laws in internet topologies revisited. In Proceedings of the Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom '02), 2002.

[Chen et al., 2002b — Chen&al.02b]

Yen-Yu Chen, Qingqing Gan, and Torsten Suel. I/O-efficient techniques for computing PageRank. In Proceedings of the Eleventh International Conference on Information and Knowledge Management (ACM CIKM '02), pages 549–557, 2002.

[Chen et al., 2003 — Chen&al.03]

Zheng Chen, Shengping Liu, Liu Wenyin Geguang Pu, and Wei-Ying Ma. Building a Web thesaurus from Web link structure. In Proceedings of the Twenty-Sixth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '03), pages 48–55, 2003.

[Chen et al., 2004 — Chen&al.04]

Yen-Yu Chen, Qingqing Gan, and Torsten Suel. Local methods for estimating PageRank values. In Proceedings of the WWW '04 Third International Workshop on Web Dynamics, 2004.

[Chien et al., 2003 — Chien&al.03]

Steve Chien, Cynthia Dwork, Ravi Kumar, Daniel R. Simon, and D. Sivakumar. Link evolution: Analysis and algorithms. Internet Mathematics, 1(3):277–304, 2003.

[Chirita et al., 2005 — Chirita&al.05]

Paul-Alexandru Chirita, Jörg Diederich, and Wolfgang Nejdl. MailRank: Using ranking for spam detection. In Proceedings of the Fourteenth International Conference on Information and Knowledge Management (ACM CIKM '05), pages 373–380, 2005.

[Chitrapura and Kashyap, 2004 — Chitrapura&Kashyap04]

Krishna Prasad Chitrapura and Srinivas R. Kashyap. Node ranking in labeled directed graphs. In Proceedings of the Thirteenth International Conference on Information and Knowledge Management (ACM CIKM '04), pages 248–249, 2004.

[Chklovski and Pantel, 2004 — Chklovski&Pantel04]

Timothy Chklovski and Patrick Pantel. Path analysis for refining verb relations. In Proceedings of the ACM SIGKDD '04 Workshop on Link Analysis for Detecting Complex Behavior (LinkKDD '04), 2004.

[Cho et al., 2000 — Cho&al.00]

Junghoo Cho, Narayanan Shivakumar, and Hector Garcia-Molina. Finding replicated Web collections. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (SIGMOD '00), pages 355–366, 2000.

[Christensen et al., 2000 — Christensen&al.00]

Kim Christensen, Raul Donangelo, Belita Koiller, and Kim Sneppen. Evolution of random networks. Physical Review Letters, 81(11):2380–2383, September 14, 2000.

[Chu and Ghahramani, 2005 — Chu&Ghahramani05]

Wei Chu and Zoubin Ghahramani. Extensions of Gaussian processes for ranking: Semi-supervised and active learning. In Proceedings of the NIPS '05 Workshop on Learning to Rank, pages 29–34, 2005.

[Chung and Lu, 2003 — Chung&Lu03]

Fan R. K. Chung and Linyuan Lu. The average distance in a random graph with given expected degrees. Internet Mathematics, 1(1):91–114, 2003.

[Chung and Lu, 2004 — Chung&Lu04]

Fan Chung and Linyuan Lu. The small world phenomenon in hybrid power law graphs. In Eli Ben-Naim, Hans Frauenfelder, and Zoltan Toroczkai, editors, Complex Networks, pages 89–104. Springer Berlin/Heidelberg, 2004. Lecture Notes in Physics - Volume 650.

[Chung et al., 2002 — Chung&al.02]

Fan Chung, Linyuan Lu, and Van Vu. Eigenvalues of random power law graphs. In Proceedings of the FOCS '02 First Workshop on Algorithms and Models for the Web-Graph (WAW '02), 2002.

[Chung et al., 2003 — Chung&al.03]

Fan R. K. Chung, Linyuan Lu, and Van Vu. The spectra of random graphs with given expected degrees. Internet Mathematics, 1(3):257–275, 2003.

[Chung, 1997 — Chung97]

Fan R. K. Chung. Spectral Graph Theory. American Mathematical Society, Providence, RI, 1997.

[Cimiano and Staab, 2004 — Cimiano&Staab04]

Philipp Cimiano and Steffen Staab. Learning by Googling. SIGKDD Explorations Newsletter, 6(2):24–33, 2004.

[Clauset and Moore, 2003 — Clauset&Moore03]

Aaron Clauset and Christopher Moore. How do networks become navigable?. In Proceedings of the NIPS '03 Workshop on Robust Communication Dynamics in Complex Networks, 2003.

[Clauset and Young, 2005 — Clauset&Young05]

Aaron Clauset and Maxwell Young. Scale invariance in global terrorism. Technical Report physics/0502014, Arvix.org, May 2005.

[Clauset et al., 2004 — Clauset&al.04]

Aaron Clauset, Mark E. J. Newman, and Cristopher Moore. Finding community structure in very large networks. Physical Review E, 70:066111, December 6, 2004.

[Clauset, 2005 — Clauset05]

Aaron Clauset. Finding local community structure in networks. Technical Report physics/0503036, Arvix.org, March 2005.

[Cohen et al., 2000 — Cohen&al.00]

Reuven Cohen, Keren Erez, Daniel ben Avraham, and Shlomo Havlin. Resilience of the Internet to random breakdowns. Physical Review Letters, 85(21):4626–4628, November 20, 2000.

[Cohen, 2002a — Cohen02a]

David Cohen. All the world's a net. New Scientist, 2338, April 13, 2002.

[Cohen, 2002b — Cohen02b]

William Cohen. Improving a page classifier with anchor extraction and link analysis. In Proceedings of the Sixteenth Conference on Advances in Neural Information Processing Systems (NIPS 15), pages 1481–1488, 2002.

[Cohn and Chang, 2000 — Cohn&Chang00]

David Cohn and Huan Chang. Learning to probabilistically identify authoritative documents. In Proceedings of the Seventeenth International Conference on Machine Learning (ICML '00), pages 167–174, 2000.

[Cohn and Hofmann, 2000 — Cohn&Hofmann00]

David Cohn and Thomas Hofmann. The missing link - a probabilistic model of document content and hypertext connectivity. In Proceedings of the Fourteenth Conference on Advances in Neural Information Processing Systems (NIPS 13), pages 430–436, 2000.

[Colizza et al., 2006 — Colizza&al.06]

Vittoria Colizza, Alain Barrat, Marc Barthélemy, and Alessandro Vespignani. The role of the airline transportation network in the prediction and predictability of global epidemics. Proceedings of the National Academy of Sciences of the United States of America, 103(7):2015–2020, February 14, 2006.

[Collins-Thompson and Callan, 2005 — Collins-Thompson&Callan05]

Kevyn Collins-Thompson and Jamie Callan. Query expansion using random walk models. In Proceedings of the Fourteenth International Conference on Information and Knowledge Management (ACM CIKM '05), pages 704–711, 2005.

[Comets and Popov, 2005 — Comets&Popov05]

Francis Comets and Serguei Popov. On multidimensional branching random walks in random environment. Technical Report math/0507126, Arxiv.org, July 6, 2005.

[Conrad and Mitzenmacher, 2004 — Conrad&Mitzenmacher04]

Brian Conrad and Michael Mitzenmacher. Power laws for monkeys typing randomly: The case of unequal probabilities. IEEE Transactions on Information Theory, 50(7):1403–1414, 2004.

[Cooley, 2003 — Cooley03]

Robert Cooley. The use of Web structure and content to identify subjectively interesting Web usage patterns. ACM Transactions on Internet Technology, 3(2):93–116, May 2003.

[Cooper and Frieze, 2003a — Cooper&Frieze03b]

Colin Cooper and Alan Frieze. Crawling on simple models of Web graphs. Internet Mathematics, 1(1):57–90, 2003.

[Cooper and Frieze, 2003b — Cooper&Frieze03a]

Colin Cooper and Alan Frieze. A general model of Web graphs. Random Structures and Algorithms, 22:311–335, 2003.

[Cooper et al., 2004 — Cooper&al.04]

Colin Cooper, Ralf Klasing, and Michele Zito. Dominating sets in Web graphs. In Proceedings of the FOCS '04 Third Workshop on Algorithms and Models for the Web-Graph (WAW '04), pages 31–43, 2004.

[Corduneanu and Jaakkola, 2004 — Corduneanu&Jaakkola04]

Adrian Corduneanu and Tommi Jaakkola. Distributed information regularization on graphs. In Proceedings of the Eighteenth Conference on Advances in Neural Information Processing Systems (NIPS 17), pages 49–56, 2004.

[Corominas and Solé, 2006 — Corominas&Sole06]

Bernat Corominas and Ricard V. Solé. Network topology and self-consistency in language games. Journal of Theoretical Biology, 24(2):438–441, July 2006.

[Corso et al., 2004 — Corso&al.04]

Gianna M. Del Corso, Antonio Gulli, and Francesco Romani. Fast PageRank computation via a sparse linear system (extended abstract). In Proceedings of the FOCS '04 Third Workshop on Algorithms and Models for the Web-Graph (WAW '04), pages 118–130, 2004.

[Cortes and Mohri, 2006 — Cortes&Mohri06]

Corinna Cortes and Mehryar Mohri. On transductive regression. In Proceedings of the Twentieth Conference on Advances in Neural Information Processing Systems (NIPS 19), 2006.

[Cothey, 2004 — Cothey04]

Viv Cothey. Web-crawling reliability. Journal of the American Society for Information Science and Technology, 55(14):1228–1238, December 2004.

[Cour et al., 2006 — Cour&al.06]

Timothee Cour, Praveen Srinivasan, and Jianbo Shi. Balanced graph matching. In Proceedings of the Twentieth Conference on Advances in Neural Information Processing Systems (NIPS 19), 2006.

[Courtenage and Williams, 2004 — Courtenage&Williams04]

Simon Courtenage and Steven Williams. Finding relevant Web pages through equivalent hyperlinks. In Proceedings of the WWW '04 Third International Workshop on Web Dynamics, 2004.

[Cox and Perkins, 2005 — Cox&Perkins05]

J. Theodore Cox and Edwin A. Perkins. Rescaled Lotka-Volterra models converge to super-Brownian motion. Annals of Probability, 33(3):904–947, 2005.

[Craswell et al., 2001 — Craswell&al.01]

Nick Craswell, David Hawking, and Stephen E. Robertson. Effective site finding using link anchor information. In Proceedings of the Twenty-Fourth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '01), pages 250–257, 2001.

[Craven, 1998 — Craven98]

Mark Craven. Using statistical and relational methods to characterize hyperlink paths. In Proceedings of the AAAI '98 Fall Symposium on Artificial Intelligence and Link Analysis, pages 14–20, 1998.

[Crépey et al., 2006 — Crepey&al.06]

Pascal Crépey, Fabián P. Alvarez, and Marc Barthélemy. Epidemic variability in complex networks. Physical Review E, 73(4), 2006.

[Crestani and Lee, 2000 — Crestani&Lee00]

Fabio Crestani and Puay Leng Lee. Searching the Web by constrained spreading activation. Information Processing and Management, 36(4):585–605, July 1, 2000.

[Cronin and Meho, 2006 — Cronin&Meho06]

Blaise Cronin and Lokman Meho. Using the h-index to rank influential information scientists. Journal of the American Society for Information Science and Technology, 57(9):1275–1278, July 2006.

[Cronin et al., 1998 — Cronin&al.98]

Blaise Cronin, Herbert W. Snyder, Howard Rosenbaum, Anna Martinson, and Ewa Callahan. Invoked on the Web. Journal of the American Society for Information Science, 49(14):1319–1328, 1998.

[Cui et al., 2002 — Cui&al.02]

Hang Cui, Ji-Rong Wen, Jian-Yun Nie, and Wei-Ying Ma. Probabilistic query expansion using query logs. In Proceedings of the Eleventh International Conference on the World Wide Web (WWW '02), pages 325–332, 2002.

[Cuturi et al., 2005 — Cuturi&al.05]

Marco Cuturi, Kenji Fukumizu, and Jean-Philippe Vert. Semigroup kernels on measures. Journal of Machine Learning Research, 6:1169–1198, July 2005.

[Cvetcović et al., 1979 — Cvetcovic&al.79]

Dragos Cvetcović, M. Doob, and H. Sachs. Spectra of Graphs. Cambridge University Press, Cambridge, 1979.

[Daley and Gani, 1999 — Daley&Gani99]

Dary J. Daley and Joe M. Gani. Epidemic Modeling. Cambridge University Press, Cambridge, UK, 1999.

[Dall'Asta et al., 2006 — Dall'Asta&al.06]

Luca Dall'Asta, Andrea Baronchelli, Alain Barrat, and Vittorio Loreto. Agreement dynamics on small-world networks. Europhysics Letters, 73:969, 2006.

[Daniłowicz and Baliński, 2001 — Danilowicz&Balinski01]

Czesław Daniłowicz and Jarosław Baliński. Document ranking based upon Markov chains. Information Processing and Management, 37(4):623–637, July 2001.

[Das-Never et al., 2005 — Das-Neves&al.05]

Fernando A. Das-Never, Edward A. Fox, and Xiaoyan Yu. Connecting topics in document collections with stepping stones and pathways. In Proceedings of the Fourteenth International Conference on Information and Knowledge Management (ACM CIKM '05), pages 91–98, 2005.

[Dasgupta et al., 2004 — Dasgupta&al.04]

Anirban Dasgupta, John E. Hopcroft, and Frank McSherry. Spectral analysis of random graphs with skewed degree distributions. In Proceedings of the Forty-Fifth Annual Symposium on Foundations of Computer Science (FOCS '04), pages 602–610, 2004.

[Daumé III and Brill, 2004 — Daume&Brill04]

Hal Daumé III and Eric Brill. Web search intent induction via automatic query reformulation. In Proceedings of the 2004 Human Language Technology Conference and the North American Chapter of the Association for Computational Linguistics Annual Meeting (HLT '04/NAACL '04), 2004.

[Davidsen et al., 2001 — Davidsen&al.01]

J. Davidsen, H. Ebel, and Stefan Bornholdt. Emergence of a small world from local interactions: Modeling acquaintance networks. Physical Review Letters, 88:128701, March 8, 2001.

[Davis and Dhillon, 2006 — Davis&Dhillon06]

Jason V. Davis and Inderjit S. Dhillon. Estimating the global PageRank of Web communities. In Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '06), pages 116–125, 2006.

[Davison, 2000a — Davison00b]

Brian D. Davison. Recognizing nepotistic links on the Web. In Proceedings of the AAAI '00 Workshop on Artificial Intelligence for Web Search, pages 23–28, 2000.

[Davison, 2000b — Davison00a]

Brian D. Davison. Topical locality in the Web: Experiments and observations. In Proceedings of the Twenty-Third Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '00), pages 272–279, 2000.

[Davison, 2003a — Davison03b]

Brian D. Davison. Toward a unification of text and link analysis. In Proceedings of the Twenty-Sixth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '03), pages 367–368, 2003.

[Davison, 2003b — Davison03a]

Brian D. Davison. Unifying text and link analysis. In Proceedings of the IJCAI '03 Workshop on Text Mining and Link Analysis (TextLink 2003), 2003.

[de Jesus Holanda et al., 2004 — Holanda&al.04]

Adriano de Jesus Holanda, Ivan Torres Pisa, Osame Kinouchi, Alexandre Souto Martinez, and Evandro Eduardo Seron Ruiz. Thesaurus as a complex network. Physica A, 344:530–536, 2004.

[de Lima and Pedersen, 1999 — Lima&Pedersen99]

Erika F. de Lima and Jan O. Pedersen. Phrase recognition and expansion for short, precision-biased queries based on a query log. In Proceedings of the Twenty-Second Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '99), pages 145–152, 1999.

[de Lin and Chalupsky, 2004 — Lin&Chalupsky04]

Shou de Lin and Hans Chalupsky. Issues of verification for unsupervised discovery systems. In Proceedings of the ACM SIGKDD '04 Workshop on Link Analysis for Detecting Complex Behavior (LinkKDD '04), 2004.

[de Menezes et al., 2000 — Menezes&al.00]

M. Argollo de Menezes, Cristian F. Moukarzel, and T. J. P. Penna. First-order transition in small-world networks. Europhysics Letters, 50(5):574–579, June 1, 2000.

[de Solla Price, 1965a — Price65]

Derek J. de Solla Price. Networks of scientific papers. Science, 149(3683):510–515, July 30, 1965.

[de Solla Price, 1965b — deSollaPrice65]

Derek J. de Solla Price. Networks of scientific papers. Science, 149(3683):510–515, July 30, 1965.

[de Solla Price, 1976 — Price76]

Derek J. de Solla Price. A general theory of bibliometric and other cumulative advantage processes. Journal of the American Society for Information Science, 27:292–306, September-October 1976.

[Dean and Henzinger, 1999 — Dean&Henzinger99]

Jeffrey Dean and Monika R. Henzinger. Finding related pages in the World Wide Web. Computer Networks, 31(11–16):1467–1479, 1999.

[Deerwester et al., 1990 — Deerwester&al.90]

Scott C. Deerwester, Susan T. Dumais, Thomas K. Landauer, George W. Furnas, and Richard A. Harshman. Indexing by latent semantic analysis. Journal of the American Society for Information Science, 41(6):391–407, September 1990.

[Denis et al., 2003 — Denis&al.03]

François Denis, Anne Laurent, Rémi Gilleron, and Marc Tommasi. Text classification and co-training from positive and unlabeled examples. In Proceedings of the ICML '03 Workshop on The Continuum from Labeled to Unlabeled Data in Machine Learning and Data Mining, 2003.

[Desai and Narayanan, 2005 — Desai&Narayanan05]

Madhav Desai and Hariharan Narayanan. Damped random walks and the characteristic polynomial of the weighted Laplacian on a graph. Technical Report math/0506460, Arxiv.org, June 22, 2005.

[Dhillon and Modha, 2001 — Dhillon&Modha01]

Inderjit S. Dhillon and Dharmendra S. Modha. Concept decompositions for large sparse text data using clustering. Machine Learning, 42(1/2):143–175, 2001.

[Dhillon et al., 2001 — Dhillon&al.01]

Inderjit S. Dhillon, James Fan, and Yuqiang Guan. Efficient clustering of very large document collections. In R. Grossman, G. Kamath, and R. Naburu, editors, Data Mining for Scientific and Engineering Applications. Kluwer Academic Publishers, 2001.

[Dhillon et al., 2002 — Dhillon&al.02]

Inderjit S. Dhillon, Subramanyam Mallela, and Rahul Kumar. Enhanced word clustering for hierarchical text classification. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '02), pages 191–200, 2002.

[Dhillon et al., 2003 — Dhillon&al.03]

Inderjit Dhillon, Subramanyam Mallela, and Dharmendra Modha. Information-theoretic co-clustering. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '03), pages 89–98, 2003.

[Dhillon et al., 2004 — Dhillon&al.04]

Inderjit S. Dhillon, Yuqiang Guan, and Brian Kulis. Kernel k-means: Spectral clustering and normalized cuts. In Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '04), pages 551–556, 2004.

[Dhillon et al., 2005 — Dhillon&al.05]

Inderjit Dhillon, Yuqiang Guan, and Brian Kulis. A fast kernel-based multilevel algorithm for graph clustering. In Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '05), pages 629–634, 2005.

[Dhillon, 2001 — Dhillon01]

Inderjit S. Dhillon. Co-clustering documents and words using bipartite spectral graph partitioning. In Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '01), pages 269–274, 2001.

[Dhyani et al., 2002 — Dhyani&al.02]

Devanshu Dhyani, Wee Keong Ng, and Sourav S. Bhowmick. A survey of Web metrics. ACM Computing Surveys (CSUR), 34(4):469–503, 2002.

[Diestel, 2005 — Diestel05]

Reinhard Diestel. Graph Theory. Springer-Verlag, 2005.

[Dietz et al., 2007 — Dietz&al.07]

Laura Dietz, Steffen Bickel, and Tobias Scheffer. Unsupervised prediction of citation influences. In Proceedings of the Twenty-fourth International Conference on Machine Learning (ICML '07), 2007.

[Diligenti et al., 2000 — Diligenti&al.00]

Michelangelo Diligenti, Frans Coetzee, Steve Lawrence, C. Lee Giles, and Marco Gori. Focused crawling using context graphs. In Proceedings of the Twenty-Sixth International Conference on Very Large Data Bases (VLDB '00), pages 527–534, 2000.

[Dill et al., 2002 — Dill&al.02]

Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, and Andrew Tomkins. Self-similarity in the Web. ACM Transactions on Internet Technology, 2(3):205–223, August 2002.

[Dimakis et al., 2006 — Dimakis&al.06]

Alexandros G. Dimakis, Anand D. Sarwate, and Martin J. Wainwright. Geographic gossip: Efficient aggregation for sensor networks. Technical Report cs.IT/0602071, Arxiv.org, 2006.

[Ding and He, 2004 — Ding&He04]

Chris H. Q. Ding and Xiaofeng He. Linearized cluster assignment via spectral ordering. In Proceedings of the Twenty-First International Conference on Machine Learning (ICML '04), 2004.

[Ding et al., 2001 — Ding&al.01]

Chris H. Q. Ding, Xiaofeng He, Parry Husbands, Hongyuan Zha, and Horst Simon. Link analysis: Hubs and authorities on the World Wide Web. Technical Report 47847, LBNL, May 2001.

[Ding et al., 2002 — Ding&al.02]

Chris H. Q. Ding, Xiaofeng He, Parry Husbands, Hongyuan Zha, and Horst D. Simon. PageRank, HITS and a unified framework for link analysis. In Proceedings of the Twenty-Fifth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '02), pages 353–354, 2002.

[Ding et al., 2006 — Ding&al.06]

Ying Ding, François Scharffe, Andreas Harth, and Adrian Hogan. AuthorRank: Ranking improvement for the Web. In Proceedings of the 2006 International Conference on Semantic Web and Web Services (SWWS '06), 2006.

[Ding, 1999 — Ding99]

Chris H. Q. Ding. A similarity-based probability model for latent semantic indexing. In Proceedings of the Twenty-Second Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '99), pages 58–65, 1999.

[Ding, 2003 — Ding03]

Chris H. Q. Ding. Data clustering: Principal components, hopfield, and self-aggregation networks. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI '03), pages 479–484, 2003.

[Ding, 2005 — Ding05]

Chris H. Q. Ding. A probabilistic model for Latent Semantic Indexing. Journal of the American Society for Information Science and Technology, 56(6):597–608, April 2005.

[Dodds et al., 2003a — Dodds&al.03a]

Peter Sheridan Dodds, Roby Muhamad, and Duncan J. Watts. An experimental study of search in global social networks. Science, 301(5634):827–829, August 8, 2003.

[Dodds et al., 2003b — Dodds&al.03b]

Peter Sheridan Dodds, Roby Muhamad, and Duncan J. Watts. An experimental study of search in global social networks: Supplementary online material. Science, 301(5634):827–829, August 8, 2003.

[Dodds et al., 2003c — Dodds&al.03]

Peter Sheridan Dodds, Duncan J. Watts, and Charles F. Sabel. Information exchange and the robustness of organizational networks. Proceedings of the National Academy of Sciences of the United States of America, 100(21):12516–12521, October 14, 2003.

[Dom et al., 2003 — Dom&al.03]

B. Dom, I. Eiron, A. Cozzi, and Y. Zhang. Graph based ranking algorithm for email expertise analysis. In Proceedings of the Eighth ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD '03), 2003.

[Dominich and Skrop, 2005 — Dominich&Skrop05]

Sándor Dominich and Adrienn Skrop. PageRank and interaction information retrieval. Journal of the American Society for Information Science and Technology, 56(1):63–69, January 1, 2005.

[Dorogovtsev and Mendes, 2000a — Dorogovtsev&Mendes00b]

Sergey N. Dorogovtsev and José Fernando F. Mendes. Evolution of networks with aging of sites. Physical Review E, 62(2):1842–1845, August 2000.

[Dorogovtsev and Mendes, 2000b — Dorogovtsev&Mendes00a]

Sergey N. Dorogovtsev and José Fernando F. Mendes. Exactly solvable small-world networks. Europhysics Letters, 50(1):1–7, April 2000.

[Dorogovtsev and Mendes, 2000c — Dorogovtsev&Mendes00c]

Sergey N. Dorogovtsev and José Fernando F. Mendes. Scaling behaviour of developing and decaying networks. Europhysics Letters, 52(1):33–39, October 2000.

[Dorogovtsev and Mendes, 2001a — Dorogovtsev&Mendes01a]

Sergey N. Dorogovtsev and José Fernando F. Mendes. Effect of the accelerated growth of communications networks on their structure. Physical Review E, 63(2):025101, February 2001.

[Dorogovtsev and Mendes, 2001b — Dorogovtsev&Mendes01c]

Sergey N. Dorogovtsev and José Fernando F. Mendes. Language as an evolving word Web. Proceedings of the Royal Society of London B, 268(1485):2603–2606, December 22, 2001.

[Dorogovtsev and Mendes, 2001c — Dorogovtsev&Mendes01b]

Sergey N. Dorogovtsev and José Fernando F. Mendes. Scaling properties of scale-free evolving networks: Continuum approach. Physical Review E, 63(5):056125, May 2001.

[Dorogovtsev and Mendes, 2002 — Dorogovtsev&Mendes02a]

Sergey N. Dorogovtsev and José Fernando F. Mendes. Evolution of networks. Advances in Physics, 51(4):1079–1187, June 1, 2002.

[Dorogovtsev and Mendes, 2004 — Dorogovtsev&Mendes04]

Sergei N. Dorogovtsev and José F. F. Mendes. The shortest path to complex networks. World Scientific, 1, 2004.

[Dorogovtsev et al., 2000a — Dorogovtsev&al.00c]

Sergey N. Dorogovtsev, José Fernando F. Mendes, and A. N. Samukhin. Growing networks with heritable connectivity of nodes. Technical Report cond-mat/0011077, Arxiv.org, 2000.

[Dorogovtsev et al., 2000b — Dorogovtsev&al.00a]

Sergey N. Dorogovtsev, José Fernando F. Mendes, and A. N. Samukhin. Structure of growing networks with preferential linking. Physical Review Letters, 85(21):4633–4636, November 20, 2000.

[Dorogovtsev et al., 2000c — Dorogovtsev&al.00b]

Sergey N. Dorogovtsev, José Fernando F. Mendes, and A. N. Samukhin. WWW and internet models from 1955 till our days and the ``popularity is attractive'' principle. Technical Report cond-mat/0009090, Arxiv.org, 2000.

[Dorogovtsev et al., 2001a — Dorogovtsev&al.01b]

Sergey N. Dorogovtsev, José Fernando F. Mendes, and A. N. Samukhin. Generic scale of `scale-free' networks. Physical Review E, 63(6):062101, June 2001.

[Dorogovtsev et al., 2001b — Dorogovtsev&al.01a]

Sergey N. Dorogovtsev, José Fernando F. Mendes, and A. N. Samukhin. Giant strongly connected component of directed networks. Physical Review E, 64(2):025101, August 2001.

[Dorogovtsev et al., 2002a — Dorogovtsev&al.02b]

Sergey N. Dorogovtsev, A. V. Goltsev, and José Fernando F. Mendes. Ising model on networks with an arbitrary distribution of connections. Physical Review E, 66:016104, July 8, 2002.

[Dorogovtsev et al., 2002b — Dorogovtsev02b]

Sergey N. Dorogovtsev, José Fernando F. Mendes, and A. N. Samukhin. Modern architecture of random graphs: Constructions and correlations. Technical Report cond-mat/0206467, Arxiv.org, 2002.

[Dorogovtsev et al., 2002c — Dorogovtsev&al.02a]

Sergey N. Dorogovtsev, José Fernando F. Mendes, and A. N. Samukhin. Principles of statistical mechanics of random networks. Technical Report cond-mat/0204111, Arxiv.org, 2002.

[Dorogovtsev et al., 2004 — Dorogovtsev&al.04]

Sergei N. Dorogovtsev, Alexander V. Goltsev, José F. F. Mendes, and Alexander N. Samukhin. Spectral analysis of random networks. In Eli Ben-Naim, Hans Frauenfelder, and Zoltan Toroczkai, editors, Complex Networks, Lecture Notes in Physics - Volume 650, pages 35–50. Springer Berlin/Heidelberg, 2004.

[Dorogovtsev et al., 2005 — Dorogovtsev&al.05]

Sergey N. Dorogovtsev, José Fernando F. Mendes, and João Gama Oliveira. Frequency of occurrence of numbers in the World Wide Web. Technical Report physics/0504185, Arxiv.org, April 29, 2005.

[Doyle and Snell, 1984 — Doyle&Snell84]

Peter G. Doyle and J. Laurie Snell. Random walks and electric networks. Technical Report math.PR/0001057, Arxiv.org, 1984.

[Doyle et al., 2005 — Doyle&al.05]

John C. Doyle, David L. Alderson, Lun Li, Steven Low, Matthew Roughan, Stanislav Shalunov, Reiko Tanaka, and Walter Willinger. The ``robust yet fragile'' nature of the Internet. Proceedings of the National Academy of Sciences of the United States of America, 102(41):14497–14502, October 11, 2005.

[Driessens et al., 2006 — Driessens&al.06]

Kurt Driessens, Peter Reutemann, Bernhard Pfahringer, and Claire Leschi. Using weighted nearest neighbor to benefit from unlabeled data. In Wee Keong Ng, Masaru Kitsuregawa, Jianzhong Li, and Kuiyu Chang, editors, Proceedings of the Tenth Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining (PAKDD '06), volume 3918 of Lecture Notes in Computer Science, pages 60–69, 2006.

[Drineas et al., 1999 — Drineas&al.99]

Petros Drineas, Alan Frieze, Ravi Kannan, Santosh Vempala, and V. Vinay. Clustering in large graphs and matrices. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '99), 1999.

[Drineas et al., 2004 — Drineas&al.04]

Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, and V. Vinay. Clustering large graphs via the singular value decomposition. Machine Learning, 56(1-3):9–33, July 2004.

[D'Souza et al., 2007 — DSouza&al.07]

Raissa M. D'Souza, Christian Borgs, Jennifer T. Chayes, Noam Berger, and Robert D. Kleinberg. Emergence of tempered preferential attachment from optimization. Proceedings of the National Academy of Sciences of the United States of America, 104(15):6112–6117, April 10, 2007.

[Dupret, 2003 — Dupret03]

Georges Dupret. Latent concepts and the number orthogonal factors in latent semantic analysis. In Proceedings of the Twenty-Sixth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '03), pages 221–226, 2003.

[Dwork et al., 2001 — Dwork&al.01]

Cynthia Dwork, Ravi Kumar, Moni Naor, and D. Sivakumar. Rank aggregation methods for the Web. In Proceedings of the Tenth International Conference on the World Wide Web (WWW '01), pages 613–622, 2001.

[Ebel et al., 2002 — Ebel&al.02]

Holger Ebel, Lutz-Ingo Mielsch, and Stefan Bornholdt. Scale free topology of e-mail networks. Physical Review E, 66(3):035103, September 30, 2002.

[Eckmann and Moses, 2001 — Eckmann&Moses01]

Jean-Pierre Eckmann and Elisha Moses. Curvature of co-links uncovers hidden thematic layers in the World Wide Web. Technical Report cond-mat/0110338, Arxiv.org, 2001.

[Efron, 2004 — Efron04]

Miles Efron. The liberal media and right-wing conspiracies: Using cocitation information to estimate political orientation in Web documents. In Proceedings of the Thirteenth International Conference on Information and Knowledge Management (ACM CIKM '04), pages 248–249, 2004.

[Egghe and Rousseau, 1990 — Egghe&Rousseau90]

Leo Egghe and Ronald Rousseau. Introduction to Infometrics: Quantitative Methods in Library, Documentation and Information Science. Elsevier, Amsterdam, 1990.

[Egghe and Rousseau, 2003 — Egghe&Rousseau03]

Leo Egghe and Ronald Rousseau. A measure for the cohesion of weighted networks. Journal of the American Society for Information Science and Technology, 54(3):193–202, February 1, 2003.

[Egghe, 1999 — Egghe99]

L. Egghe. On the law of Zipf-Mandelbrot for multi-word phrases. Journal of the American Society for Information Science, 50(3):233–241, 1999.

[Egghe, 2005a — Egghe05a]

L. Egghe. The power of power laws and an interpretation of Lotkaian infometric systems as self-similar fractals. Journal of the American Society for Information Science and Technology, 57(7):669–675, May 2005.

[Egghe, 2005b — Egghe05b]

L. Egghe. Relations between the continuous and the discrete Lotka power function. Journal of the American Society for Information Science and Technology, 57(7):664–668, May 2005.

[Egghe, 2005c — Egghe05]

Leo Egghe. Zipfian and Lotkaian continuous concentration theory. Journal of the American Society for Information Science and Technology, 56(9):935–945, 2005.

[Ehrhardt et al., 2006 — Ehrhardt&al.06]

George C. M. A. Ehrhardt, Matteo Marsili, and Fernando Vega-Redondo. Phenomenological models of socio-economic network dynamics. Technical Report physics/0604036, Arxiv.org, April 5, 2006.

[Eirinaki et al., 2005 — Eirinaki&al.05]

Magdalini Eirinaki, Michalis Vazirgiannis, and Dimitris Kapogiannis. Web path recommendations based on page ranking and markov models. In Proceedings of the CIKM '05 International Workshop on Web Information and Data Management (WIDM '05), pages 2–9, 2005.

[Eiron and McCurley, 2003a — Eiron&McCurley03a]

Nadav Eiron and Kevin McCurley. Locality, hierarchy, and bidirectionality in the Web. In Proceedings of the WWW '03 Second Workshop on Algorithms and Models for the Web-Graph (WAW '03), 2003.

[Eiron and McCurley, 2003b — Eiron&McCurley03b]

Nadav Eiron and Kevin S. McCurley. Analysis of anchor text for Web search. In Proceedings of the Twenty-Sixth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '03), pages 459–460, 2003.

[Eiron and McCurley, 2004 — Eiron&McCurley04]

Nadav Eiron and Kevin S. McCurley. Link structure of hierarchical information networks. In Proceedings of the FOCS '04 Third Workshop on Algorithms and Models for the Web-Graph (WAW '04), pages 143–155, 2004.

[Elmacioglu and Lee, 2005 — Elmacioglu&Lee05]

Ergin Elmacioglu and Dongwon Lee. On six degrees of separation in DBLP-DB and more. ACM SIGMOD Record, 34(2):33–40, June 2005.

[Eneva, 2003 — Eneva03]

Elena Eneva. Detecting invalid clicks in online paid search listings: A problem description for the use of unlabeled data. In Proceedings of the ICML '03 Workshop on The Continuum from Labeled to Unlabeled Data in Machine Learning and Data Mining, 2003.

[Eppstein and Wang, 2002 — Eppstein&Wang02]

David Eppstein and Joseph Wang. A steady state model for power graph laws. Technical Report DM/0204001, Arxiv.org, 2002.

[Erdös and Rényi, 1959 — Erdos&Renyi59]

P. Erdös and A. Rényi. On random graphs. Publicationes Mathematicae Debrecen, 6:290–297, 1959.

[Erdös and Rényi, 1960 — Erdos&Renyi60]

P. Erdös and A. Rényi. On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences, 5:17–61, 1960.

[Ergun and Rodgers, 2002 — Ergun&Rodgers02]

Guler Ergun and G. J. Rodgers. Growing random networks with fitness. Physica A, 303(2):261–272, 2002.

[Ergun, 2002 — Ergun02]

Guler Ergun. Human sexual contact network as a bipartite graph. Physica A, 308(4):483–488, 2002.

[Erkan and Radev, 2004a — Erkan&Radev04]

Güne c s Erkan and Dragomir Radev. LexRank: Graph-based lexical centrality as salience in text summarization. Journal of Artificial Intelligence Research, 22:457–479, December 4, 2004.

[Erkan and Radev, 2004b — Erkan&Radev04a]

Güne c s Erkan and Dragomir Radev. The university of Michigan at duc 2004. In Document Understanding Conference (DUC), Boston, Massachusetts, May 2004.

[Erkan, 2006 — Erkan06]

Güne c s Erkan. Language model-based document clustering using random walks. In Proceedings of the 2006 Human Language Technology Conference and the North American Chapter of the Association for Computational Linguistics Annual Meeting (HLT '06/NAACL '06), 2006.

[Esler and Nelson, 1998 — Esler&Nelson98]

Sandra L. Esler and Michael L. Nelson. Evolution of scientific and technical information distribution. Journal of the American Society for Information Science, 49(1):82–91, 1998.

[Eubank et al., 2004 — Eubank&al.04]

Stephen Eubank, V. S. Anil Kumar, Madhav V. Marathe, Aravind Srinivasan, and Nan Wang. Structural and algorithmic aspects of massive social networks. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '04), pages 718–727, New Orleans, Louisiana, USA, 2004. Society for Industrial and Applied Mathematics.

[Even-Dar and Kearns, 2006 — Even-Dar&Kearns06]

Eyal Even-Dar and Michael Kearns. A small world threshold for economic network formation. In Proceedings of the Twentieth Conference on Advances in Neural Information Processing Systems (NIPS 19), 2006.

[Fabrikant et al., 2002 — Fabrikant&al.02]

Alex Fabrikant, Elias Koutsoupias, and Christos H. Papadimitriou. Heuristically optimized trade-offs: A new paradigm for power laws in the internet. In Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan Eidenbenz, and Ricardo Conejo, editors, Proceedings of the Twenty-Ninth International Colloquium on Automata, Languages and Programming (ICALP '02), volume 2380 of Lecture Notes in Computer Science, pages 110–122, Malaga, Spain, July 8-13, 2002. Springer.

[Fagin et al., 2000 — Fagin&al.00]

Ronald Fagin, Anna R. Karlin, Jon Kleinberg, Prabhakar Raghavan, Sridhar Rajagopalan, Ronitt Rubinfeld, Madhu Sudan, and Andrew Tomkins. Random walks with the back button. In Proceedings of the Thirty-Second ACM Symposium on the Theory of Computing (STOC '00), pages 484–493, 2000.

[Faloutsos et al., 1999 — Faloutsos&al.99]

Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos. On power-law relationships of the internet topology. In Proceedings of the ACM/SIGCOMM 1999 Conference of the Special Interest Group on Data Communication, pages 251–262, 1999.

[Faloutsos et al., 2002 — Faloutsos&al.02]

Christos Faloutsos, Jon Kleinberg, and Caetano Traina Junior. Panel: Research directions for fractals/power-laws/self-similarity researchers. In Proceedings of the ACM SIGKDD '02 Workshop on Fractals and Self-similarity in Data Mining: Issues and Approaches, 2002.

[Faloutsos, 2003 — Faloutsos03]

Christos Faloutsos. Finding patterns in large graphs. In Proceedings of the NIPS '03 Workshop on Robust Communication Dynamics in Complex Networks, 2003.

[Fang and Sheng, 2004 — Fang&Sheng04]

Xiao Fang and Olivia R. Liu Sheng. LinkSelector: A Web mining approach to hyperlink selection for Web portals. ACM Transactions on Internet Technology, 4(2):209–237, May 2004.

[Farkas et al., 2001 — Farkas&al.01]

Illes J. Farkas, Imre Derényi, Albert-László Barabási, and Tamas Vicsek. Spectra of ``real-world'' graphs: Beyond the semi-circle law. Physical Review E, 64(2):026504, August 2001.

[Farkas et al., 2003 — Farkas&al.02]

Illes J. Farkas, Hawoong Jeong, Tamas Vicsek, Albert-László Barabási, and Zoltan N. Oltvai. The topology of the transcription regulatory network in the yeast, Saccharomyces cerevisiae. Phsycia A, 318(4):601–612, 2003.

[Farkas et al., 2004 — Farkas&al.04]

Illés Farkas, Imre Derényi, Gergely Palla, and Tamás Vicsek. Equilibrium statistical mechanics of network structures. In Eli Ben-Naim, Hans Frauenfelder, and Zoltan Toroczkai, editors, Complex Networks, pages 163–187. Springer Berlin/Heidelberg, 2004. Lecture Notes in Physics - Volume 650.

[Feng et al., 2006 — Feng&al.06]

Guang Feng, Tie-Yan Liu, Ying Wang, Ying Bao, Zhiming Ma, Xu-Dong Zhang, and Wei-Ying Ma. AggregateRank: Bringing order to web sites. In Proceedings of the Twenty-Nineth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '06), pages 75–82, 2006.

[Fenn et al., 2005 — Fenn&al.05]

Daniel Fenn, Omer Suleman, Janet Efstathiou, and Neil F. Johnson. How does Europe Make Its Mind Up? connections, cliques, and compatibility between countries in the Eurovision Song Contest. Technical Report physics/0505071, Arxiv.org, May 10 2005.

[Fenner et al., 2006 — Fenner&al.06]

Trevor Fenner, Mark Levene, and George Loizou. The stochastic model for the evolution of the Web allowing link deletion. ACM Transactions on Internet Technology, 6(2):117–130, May 2006.

[Fern and Brodley, 2004 — Fern&Brodley04]

Xiaoli Zhang Fern and Carla E. Brodley. Solving cluster ensemble problems by bipartite graph partitioning. In Proceedings of the Twenty-First International Conference on Machine Learning (ICML '04), 2004.

[Fernandez et al., 1998 — Fernandez&al.98]

Mary F. Fernandez, Daniela Florescu, Alon Y. Levy, and Dan Suciu. Reasoning about Web-site structure. In Alexander Borgida, Vinay K. Chaudhri, and Martin Staudt, editors, Proceedings of the 5th International Workshop on Knowledge Represenation Meets Databases (KRDB '98): Innovative Application Programming and Query Interfaces, volume 10 of CEUR Workshop Proceedings, pages 10.1–10.9, Seattle, Washington, USA, May 31, 1998.

[Ferrer i Cancho and Solé, 2001a — FerreriCancho&Sole01]

Ramon Ferrer i Cancho and Ricard V. Solé. The small-world of human language. Proceedings of the Royal Society of London B, 268(1482):2261–2265, November 7 2001.

[Ferrer i Cancho and Solé, 2001b — FerreriCancho&Sole01a]

Ramon Ferrer i Cancho and Ricard V. Solé. Two regimes in the frequency of words and the origins of complex lexicons: Zipf's law revisited. Journal of Quantitative Linguistics, 8(3):165–173, December 2001.

[Ferrer i Cancho and Solé, 2003 — FerreriCancho&Sole03]

Ramon Ferrer i Cancho and Ricard V. Solé. Least effort and the origins of scaling in human language. Proceedings of the National Academy of Sciences of the United States of America, 100(3):788–791, February 4, 2003.

[Ferrer i Cancho et al., 2001 — FerreriCancho&al.01]

Ramon Ferrer i Cancho, Christiaan Janssen, and Ricard V. Solé. The topology of technology graphs: Small world patterns in electronic circuits. Physical Review E, 64(4):046119, October 2001.

[Ferrer i Cancho et al., 2003 — FerreriCancho&al.03]

Ramon Ferrer i Cancho, Ricard V. Solé, and Reinhard Köhler. Universality in syntactic dependency networks. Technical Report Santa Fe Working paper 03-06-042, Santa Fe Institute, 2003.

[Ferrer i Cancho et al., 2004 — FerreriCancho&al.04]

Ramon Ferrer i Cancho, Ricard V. Solé, and Reinhard Köhler. Patterns in syntactic dependency networks. Physical Review E, 69(5), May 26, 2004.

[Ferrer i Cancho et al., 2005 — FerreriCancho&al.05]

Ramon Ferrer i Cancho, Oliver Riordan, and Béla Bollobás. The consequences of Zipf's law for syntax and symbolic reference. Proceedings of the Royal Society of London Series B, 272:561–565, 2005.

[Ferrer i Cancho, 2004 — FerreriCancho04]

Ramon Ferrer i Cancho. Euclidean distance between syntactically linked words. Physical Review E, 70(5), November 30, 2004.

[Ferrer i Cancho, 2005 — FerreriCancho05]

Ramon Ferrer i Cancho. The structure of syntactic dependency networks: insights from recent advances in network theory. In Victor Levickij and Gabriel Altmann, editors, Problems of quantitative linguistics, pages 60–75. Ruta, 2005.

[Fetterly et al., 2002 — Fetterly&al.02]

D. Fetterly, M. Manasse, M. Najork, and J. Wiener. Crawling towards light: A large scale study of the evolution of Web pages. In Proceedings of the FOCS '02 First Workshop on Algorithms and Models for the Web-Graph (WAW '02), 2002.

[Fetterly et al., 2003 — Fetterly&al.03]

Dennis Fetterly, Mark Manasse, Marc Najork, and Janet L. Wiener. A large-scale study of the evolution of Web pages. In Proceedings of the Twelfth International Conference on the World Wide Web (WWW '03), pages 669–678, 2003.

[Fine et al., 2002 — Fine&al.02]

Shai Fine, Ran Gilad-Bachrach, and Eli Shamir. Query by committee, linear separation, and random walks. Theoretical Computer Science, 284(1):25–51, 2002.

[Fischer and Wegener, 2005 — Fischer&Wegener05]

Simon Fischer and Ingo Wegener. The one-dimensional Ising model: Mutation versus recombination. Theoretical Computer Science, 344(2-3):208–225, November 17, 2005.

[Flake et al., 2000 — Flake&al.00]

Gary William Flake, Steve Lawrence, and C. Lee Giles. Efficient identification of Web communities. In Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '00), pages 150–160, 2000.

[Flake et al., 2002a — Flake&al.02]

G. W. Flake, R. E. Tarjan, and K. Tsioutsiouliklis. Minimum cut tree clustering. In Proceedings of the FOCS '02 First Workshop on Algorithms and Models for the Web-Graph (WAW '02), 2002.

[Flake et al., 2002b — Flake&al.02a]

Gary William Flake, Steve Lawrence, C. Lee Giles, and Frans Coetzee. Self-organization and identification of Web communities. IEEE Computer Magazine, 35(3):66–71, 2002.

[Flake et al., 2002c — Flake&al.02b]

Gary William Flake, Robert E. Tarjan, and Kostas Tsioutsiouliklis. Clustering methods based on minimum-cut trees. Technical Report 2002-06, NEC, Princeton, New Jersey, 2002.

[Flake et al., 2004 — Flake&al.04]

Gary William Flake, Robert E. Tarjan, and Kostas Tsioutsiouliklis. Graph clustering and minimum cut trees. Internet Mathematics, 1(4):385–408, 2004.

[Flaxman et al., 2004 — Flaxman&al.04]

Abraham Flaxman, Alan M. Frieze, and Juan Vera. A geometric preferential attachment model of networks. In Proceedings of the FOCS '04 Third Workshop on Algorithms and Models for the Web-Graph (WAW '04), pages 44–55, 2004.

[Florescu et al., 1998 — Florescu&al.98]

Daniela Florescu, Alon Y. Levy, and Alberto O. Mendelzon. Database techniques for the world-wide Web: A survey. ACM SIGMOD Record, 27(3):59–74, 1998.

[Flory, 1976 — Flory76]

P. J. Flory. Statistical thermodynamics of random networks. Proceedings of the Royal Society of London A, 351(1666):351–378, November 19, 1976.

[Fogaras and Rácz, 2004 — Fogaras&Racz04]

Dániel Fogaras and Balázs Rácz. Towards scaling fully personalized PageRank. In Proceedings of the FOCS '04 Third Workshop on Algorithms and Models for the Web-Graph (WAW '04), pages 105–117, 2004.

[Fogaras and Rácz, 2005 — Fogaras&Racz05]

Dániel Fogaras and Balázs Rácz. Scaling link-based similarity search. In Proceedings of the Fourteenth International Conference on the World Wide Web (WWW '05), pages 641–650, 2005.

[Fortunato et al., 2005 — Fortunato&al.05]

Santo Fortunato, Alessandro Flammini, Filippo Menczer, and Alessandro Vespignani. The egalitarian effect of search engines. Technical Report cs.CY/0511005, Arxiv.org, 2005.

[Fortunato et al., 2006 — Fortunato&al.06]

Santo Fortunato, Alessandro Flammini, and Filippo Menczer. Scale-free network growth by ranking. Technical Report cond-mat/0602081, Arxiv.org, 2006.

[Frandsen and Rousseau, 2005 — Frandsen&Rousseau.05]

Tove Faber Frandsen and Ronald Rousseau. Active impact calculated over arbitrary periods. Journal of the American Society for Information Science and Technology, 56(1):129–139, January 1, 2005.

[Freeman, 1977 — Freeman77]

L. C. Freeman. A set of measures of centrality based on betweenness. Sociometry, 40(1):35–41, March 1977.

[Frey and Dueck, 2007 — Frey&Dueck07]

Brendan J. Frey and Delbert Dueck. Clustering by passing messages between data points. Science, 315(5814):972–976, February 16, 2007.

[Frisse, 1987 — Frisse88]

Mark E. Frisse. Searching for information in a hypertext medical handbook. In HYPERTEXT '87: Proceeding of the ACM conference on Hypertext, pages 57–66, Chapel Hill, North Carolina, USA, 1987. ACM Press.

[Frome et al., 2006 — Frome&al.06]

Andrea Frome, Yoram Singer, and Jitendra Malik. Image retrieval and classification using local distance functions. In Proceedings of the Twentieth Conference on Advances in Neural Information Processing Systems (NIPS 19), 2006.

[Fu et al., 2003 — Fu&al.03]

Daniel Fu, Emilio Remolina, and Jim Eilbert. A cbr approach to asymmetric plan detection. In Proceedings of the ACM SIGKDD '03 Workshop on Link Analysis for Detecting Complex Behavior (LinkKDD '03), 2003.

[Fujimura, 2005 — Fujimura05]

Ko Fujimura. The EigenRumor Algorithm for ranking blogs. In Proceedings of the WWW '05 Second Annual Workshop on the Weblogging Ecosystem: Aggregation, Analysis, and Dynamics, 2005.

[Fuks and Lawniczak, 1999 — Fuks&Lawniczak99]

Henryk Fuks and Anna T. Lawniczak. Performance of data networks with random links. Mathematics and Computers in Simulation, 51(2):101–117, December 22, 1999.

[Gaertler, 2005 — Gaertler05]

Marco Gaertler. Clustering. In Ulrik Brandes and Thomas Erlebach, editors, Network Analysis: Methodological Foundations, pages 178–215. Springer Berlin/Heidelberg, 2005. Lecture Notes in Computer Science - Volume 3418.

[Garfield, 1955 — Garfield55]

Eugene Garfield. Citation indexes for science: a new dimension in documentation through association of ideas. Science, 122(3159):108–111, 1955.

[Garfield, 1972 — Garfield72]

Eugene Garfield. Citation analysis as a tool in journal evaluation. Science, 178(4060):471–479, 1972.

[Garfield, 1979 — Garfield79]

Eugene Garfield. Citation Indexing: Its Theory and Application in Science. Wiley, New York, 1979.

[Garner, 1967 — Garner67]

Ralph Garner. A computer oriented, graph theoretic analysis of citation index structures. Drexel University Press, Philadelphia, Pennsylvania, 1967.

[Gärtner et al., 2006 — Gartner&al.06]

Thomas Gärtner, Quoc Viet Le, and Alex J. Smola. A short tour of kernel methods for graphs. Under Preparation, 2006.

[Gärtner, 2005 — Gartner05]

Thomas Gärtner. Kernel methods for graphs. In Saso Dzeroski and Hendrick Blockeel, editors, Proceedings of the ACM SIGKDD '05 Fourth Workshop on Multi-Relational Data Mining (MRDM '05), Seattle, Washington, USA, August 21, 2005.

[Gastner and Newman, 2004 — Gastner&Newman04]

Michael T. Gastner and Mark E. J. Newman. Diffusion-based method for producing density-equalizing maps. Proceedings of the National Academy of Sciences of the United States of America, 101(20):7499–7504, May 18, 2004.

[Gastner and Newman, 2006 — Gastner&Newman06]

Michael T. Gastner and Mark E. J. Newman. The spatial structure of networks. European Physical Journal B, 49:247–252, 2006.

[Gastner et al., 2005 — Gastner&al.05]

Michael T. Gastner, C. R. Shalizi, and Mark E. J. Newman. Maps and cartograms of the 2004 US presidential election results. Advances in Complex Systems, 8:117–123, 2005.

[Gastner, 2005 — Gastner05]

M. T. Gastner. Spatial Distributions: Density-Equalizing Map Projections, Facility Location, and Two-Dimensional Networks. PhD thesis, University of Michigan, 2005.

[Geerts et al., 2004 — Geerts&al.04]

Floria Geerts, Heikki Mannila, and Evimaria Terzi. Relational link-based ranking. In Proceedings of the Thirtieth International Conference on Very Large Data Bases (VLDB '04), pages 552–563, 2004.

[Gelbukh and Sidorov, 2001 — Gelbukh&Sidorov01]

Alexander Gelbukh and Grigori Sidorov. Zipf and Heaps Laws' coefficients depend on language. In Proceedings of the Second International Conference on Intelligent Text Processing and Computational Linguistics (CICLING '01), pages 332–335, 2001.

[Gelgi et al., 2005 — Gelgi&al.05]

Fatih Gelgi, Srinivas Vadrevu, and Hasan Davulcu. Improving Web data annotations with spreading activation. In Proceedings of the Sixth International Conference on Web Information Systems Engineering (WISE '05), pages 95–106, 2005.

[Getoor and Diehl, 2005a — Getoor&Diehl05]

Lise Getoor and Christopher P. Diehl. Introduction: Special issue on link mining. SIGKDD Explorations Newsletter, 7(2):1–2, 2005.

[Getoor and Diehl, 2005b — Getoor&Diehl05a]

Lise Getoor and Christopher P. Diehl. Link mining: A survey. SIGKDD Explorations Newsletter, 7(2):3–12, 2005.

[Getoor et al., 2001 — Getoor&al.01]

Lise Getoor, Eran Segal, Ben Taskar, and Daphne Koller. Probabilistic models of text and link structure for hypertext classification. In Proceedings of the IJCAI '01 Workshop on Text Learning: Beyond Supervision, 2001.

[Getoor et al., 2002 — Getoor&al.02]

Lise Getoor, Nir Friedman, Daphne Koller, and Benjamin Taskar. Learning probabilistic models of link structure. Journal of Machine Learning Research, 3:679–707, December 2002.

[Ghani, 2002 — Ghani02]

Rayid Ghani. Combining labeled and unlabeled data for multiclass text categorization. In Proceedings of the Ninteenth International Conference on Machine Learning (ICML '02), pages 187–194, 2002.

[Ghoshal and Newman, 2006 — Ghoshal&Newman06]

Gourab Ghoshal and Mark E. J. Newman. Self-organizing information networks that can be searched in constant time. Technical Report physics/0608057, Arxiv.org, August 4, 2006.

[Gibson et al., 1998 — Gibson&al.98]

David Gibson, Jon M. Kleinberg, and Prabhakar Raghavan. Inferring Web communities from link topology. In Proceedings of the Ninth ACM Conference on Hypertext and Hypermedia, pages 225–234, 1998.

[Gibson et al., 2005 — Gibson&al.05]

David Gibson, Ravi Kumar, and Andrew Tomkins. Discovering large dense subgraphs in massive graphs. In Proceedings of the Thirty-First International Conference on Very Large Data Bases (VLDB '05), pages 721–732, 2005.

[Gilbert and Levchenko, 2004 — Gilbert&Levchenko04]

Anna C. Gilbert and Kirill Levchenko. Compressing network graphs. In Proceedings of the ACM SIGKDD '04 Workshop on Link Analysis for Detecting Complex Behavior (LinkKDD '04), 2004.

[Gilbert, 1959 — Gilbert59]

E. N. Gilbert. Random graphs. Annals of Mathematical Statistics, 30(4):1141–1144, 1959.

[Gilbert, 1997 — Gilbert97]

Nigel Gilbert. A simulation of the structure of academic science. Sociological Research Online, 2(2), 1997.

[Giles and Councill, 2004 — Giles&Councill04]

C. Lee Giles and Isaac G. Councill. Who gets acknowledged: Measuring scientific contributions through automatic acknowledgment indexing. Proceedings of the National Academy of Sciences of the United States of America, 101(51):17599–17604, December 21, 2004.

[Giles et al., 1998 — Giles&al.98]

C. Lee Giles, Kurt D. Bollacker, and Steve Lawrence. CiteSeer: An automatic citation indexing system. In Proceedings of the Third ACM Conference on Digital Libraries (DL '98), pages 89–98, Pittsburgh, Pennsylvania, United States, 1998. ACM Press.

[Ginsparg, 2004 — Ginsparg04]

Paul Ginsparg. Scholarly information network. In Eli Ben-Naim, Hans Frauenfelder, and Zoltan Toroczkai, editors, Complex Networks, pages 313–336. Springer Berlin/Heidelberg, 2004. Lecture Notes in Physics - Volume 650.

[Gionis et al., 2005 — Gionis&al.05]

Aristides Gionis, Alexander Hinneburg, Spiros Papadimitriou, and Panayiotis Tsaparas. Dimension induced clustering. In Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '05), pages 51–60, 2005.

[Girolami and Kabán, 2003 — Girolami&Kaban03]

Mark Girolami and Ata Kabán. On an equivalence between PLSI and LDA. In Proceedings of the Twenty-Sixth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '03), pages 433–434, 2003.

[Girvan and Newman, 2002 — Girvan&Newman02]

M. Girvan and M. E. J. Newman. Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America, 99(12):7821–7826, June 2002.

[Gitterman, 2000 — Gitterman00]

M. Gitterman. Small-world phenomena in physics: The Ising model. Journal of Physics A: Mathematical and General, 33(47):8373–8382, December 1, 2000.

[Gkantsidis et al., 2003 — Gkantsidis&al.03]

C. Gkantsidis, M. Mihail, and E. Zegura. Spectral analysis of internet topologies. In Proceedings of the Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom '03), 2003.

[Glance et al., 2004 — Glance&al.04]

Natalie Glance, Matthew Hurst, and Takashi Tomokiyo. BlogPulse: Automated trend discovery for Weblogs. In Proceedings of the WWW '04 First Annual Workshop on Weblogging Ecosystem: Aggregation, Analysis, and Dynamics, 2004.

[Globerson and Jaakkola, 2006 — Globerson&Jaakkola06]

Amir Globerson and Tommi Jaakkola. Approximate inference using planar graph decomposition. In Proceedings of the Twentieth Conference on Advances in Neural Information Processing Systems (NIPS 19), 2006.

[Glover et al., 2001 — Glover&al.01a]

Eric J. Glover, Steve Lawrence, Michael D. Gordon, William P. Birmingham, and C. Lee Giles. Web search - your way. Communications of the ACM, 44(12):97–102, 2001.

[Glover et al., 2002 — Glover&al.02]

Eric J. Glover, Kostas Tsioutsiouliklis, Steve Lawrence, David M. Pennock, and Gary W. Flake. Using Web structure for classifying and describing Web pages. In Proceedings of the Eleventh International Conference on the World Wide Web (WWW '02), pages 562–569, 2002.

[Goethals et al., 2005 — Goethals&al.05]

Bart Goethals, Siegfried Nijssen, and Mohammed J. Zaki. Open source data mining: Workshop report. SIGKDD Explorations Newsletter, 7(2):143–144, 2005.

[Goh et al., 2001 — Goh&al.01]

Kwang-Il Goh, Byungnam Kahng, and Dong-Hee Kim. Spectra and eigenvectors of scale-free networks. Physical Review E, 64(5):051903, November 2001.

[Goh et al., 2002a — Goh&al.02a]

Kwang-Il Goh, Byungnam Kahng, and Dong-Hee Kim. Fluctuation-driven dynamics of the internet topology. Physical Review Letters, 88(10):108701, March 11, 2002.

[Goh et al., 2002b — Goh&al.02b]

Kwang-Il Goh, E. S. Oh, Hawoong Jeong, Byungnam Kahng, and Dong-Hee Kim. Classification of scale-free networks. Proceedings of the National Academy of Sciences of the United States of America, 99(20):12583–12588, October 1, 2002.

[Goh et al., 2004 — Goh&al.04]

Kwang-Il Goh, Eulsik Oh, Chul-Min Ghim, Byungnam Kahng, and Doochul Kim. Classes of the shortest pathway structures in scale free networks. In Eli Ben-Naim, Hans Frauenfelder, and Zoltan Toroczkai, editors, Complex Networks, pages 105–125. Springer Berlin/Heidelberg, 2004. Lecture Notes in Physics - Volume 650.

[Golbeck and Hendler, 2004 — Golbeck&Hendler04]

Jennifer Golbeck and James Hendler. Reputation network analysis for email filtering. In Proceedings of the First Conference on Email and Anti-Spam, 2004.

[Goldberg and Zhu, 2006 — Goldberg&Zhu06]

Andrew B. Goldberg and Jerry Zhu. Seeing stars when there aren't many stars: Graph-based semi-supervised learning for sentiment categorization. In HLT-NAACL 2006 Workshop on Textgraphs: Graph-based Algorithms for Natural Language Processing, 2006.

[Goldenberg and Moore, 2003 — Goldenberg&Moore03]

Anna Goldenberg and Andrew Moore. Empirical Bayes screening for link analysis. In Proceedings of the IJCAI '03 Workshop on Text Mining and Link Analysis (TextLink 2003), 2003.

[Goldenberg and Moore, 2005 — Goldenberg&Moore05]

Anna Goldenberg and Andrew Moore. Bayes net graphs to understand coauthorship networks?. In Proceedings of the ACM SIGKDD '05 Workshop on Link Discovery: Issues, Approaches and Applications (LinkKDD '05), 2005.

[Goldenberg et al., 2003 — Goldenberg&al.03]

Anna Goldenberg, Jeremy Kubica, and Paul Komarek. A comparison of statistical and machine learning algorithms in the task of link completion. In Proceedings of the ACM SIGKDD '03 Workshop on Link Analysis for Detecting Complex Behavior (LinkKDD '03), 2003.

[Goldman and Zhou, 2000 — Goldman&Zhou00]

Sally A. Goldman and Yan Zhou. Enhancing supervised learning with unlabeled data. In Proceedings of the Seventeenth International Conference on Machine Learning (ICML '00), pages 327–334, 2000.

[Goldstein et al., 2004 — Goldstein&al.04]

Michel L. Goldstein, Steven A. Morris, and Gary G. Yen. Problems with fitting to the power-law distribution. Technical Report cond-mat/0402322, Arxiv.org, August 13, 2004.

[Goldwater et al., 2005 — Goldwater&al.05]

Sharon Goldwater, Tom Griffiths, and Mark Johnson. Interpolating between types and tokens by estimating power-law generators. In Proceedings of the Ninteenth Conference on Advances in Neural Information Processing Systems (NIPS 18), 2005.

[Goltsev et al., 2002 — Goltsev&al.02]

A. V. Goltsev, Sergey N. Dorogovtsev, and Jos/�e Fernando F. Mendes. Critical phenomena in networks. Technical Report cond-mat/0204596, Arxiv.org, 2002.

[Gonzalez et al., 2002 — Gonzalez&al.02]

Jesus A. Gonzalez, Lawrence B. Holder, and Diane J. Cook. Graph-based relational concept learning. In Proceedings of the Ninteenth International Conference on Machine Learning (ICML '02), pages 219–226, 2002.

[Good, 1953 — Good53]

Irving J. Good. The population frequencies of species and the estimation of population parameters. Biometrika, 40(3-4):237–264, 1953.

[Goodrum et al., 2001 — Goodrum&al.01]

Abby A. Goodrum, Katherine W. McCaina, Steve Lawrence, and C. Lee Giles. Scholarly publishing in the Internet age: A citation analysis of computer science literature. Information Processing and Management, 37(6):661–675, 2001.

[Goutte et al., 2002 — Goutte&al.02]

C. Goutte, H. Déjean, E. Gaussier, N. Cancedda, and J-M. Renders. Combining labelled and unlabelled data: A case study on Fisher kernels and transductive inference for biological entity recognition. In Proc. 6th conference on Natural language learning (CoNLL), pages 1–7, 2002.

[Grady et al., 1998 — Grady&al.98]

Nancy W. Grady, Daniel R. Tufano, and Raymond E. Flanery, Jr. Immersive visualization for link analysis. In Proceedings of the AAAI '98 Fall Symposium on Artificial Intelligence and Link Analysis, pages 98–100, 1998.

[Grangier and Bengio, 2005a — Grangier&Bengio05b]

David Grangier and Samy Bengio. Exploiting hyperlinks to learn a retrieval model. In Proceedings of the NIPS '05 Workshop on Learning to Rank, pages 12–17, 2005.

[Grangier and Bengio, 2005b — Grangier&Bengio05a]

David Grangier and Samy Bengio. Inferring document similarity from hyperlinks. In Proceedings of the Fourteenth International Conference on Information and Knowledge Management (ACM CIKM '05), pages 359–360, 2005.

[Granovetter, 1973 — Granovetter73]

Mark Granovetter. The strength of weak ties. American Journal of Sociology, 78(6):1360–1380, 1973.

[Granovetter, 1978 — Granovetter78]

Mark Granovetter. Threshold models of collective behavior. American Journal of Sociology, 83:1420–1443, 1978.

[Gray, 1987 — Gray87]

Robert M. Gray. Probability, Random Processes, and Ergodic Properties. Springer, December 18, 1987. Free revised pdf version.

[Greco et al., 2004 — Greco&al.04]

Gianluigi Greco, Sergio Greco, and Ester Zumpano. Web communities: Models and algorithms. World Wide Web: Internet and Web Information Systems, 7(1):59–82, 2004.

[Griffiths and Tenenbaum, 2006 — Griffiths&Tenenbaum06]

Tom Griffiths and Joshua Tenenbaum. Statistics and the Bayesian mind. Significance, 3(3):130–133, September 2006.

[Gruhl et al., 2004 — Gruhl&al.04]

Daniel Gruhl, R. Guha, David Liben-Nowell, and Andrew Tomkins. Information diffusion through blogspace. In Proceedings of the Thirteenth International Conference on the World Wide Web (WWW '04), pages 491–501, 2004.

[Guardiola et al., 2002 — Guardiola&al.02]

X. Guardiola, Albert Díaz-Guilera, Conrad J. Perez, Alex Arenas, and Mateu Llas. Modelling diffusion of innovations in a social network. Technical Report cond-mat/0204141, Arxiv.org, 2002.

[Guclu and Korniss, 2004 — Guclu&Korniss04]

H. Guclu and Gyorgy Korniss. Extreme fluctuations in small-worlds with relaxational dynamics. Physical Review E, 69:065104(R), 2004.

[Guha et al., 2005 — Guha&al.05]

R. Guha, Ravi Kumar, D. Sivakumar, and Ravi Sundaram. Unweaving a Web of documents. In Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '05), pages 574–579, 2005.

[Guillaume and Latapy, 2003 — Guillaume&Latapy03]

Jean-Loup Guillaume and Matthieu Latapy. A realistic model for complex networks. Technical Report cond-mat/0307095, Arxiv.org, 2003.

[Guillaume and Latapy, 2004 — Guillaume&Latapy04]

Jean-Loup Guillaume and Matthieu Latapy. Bipartite graphs as models of complex networks. In Proceedings of the Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN '04), 2004.

[Guimerá et al., 2003 — Guimera&al.03]

R. Guimerá, L. Danon, A. Díaz-Guilera, F. Giralt, and A. Arenas. Self-similar community structure in organizations. Physical Review E, 68:065103, 2003.

[Gunawardena, 1996 — Gunawardena96]

Jeremy Gunawardena. Statistical mechanics and information theory. Technical Report HPL-BRIMS-96-01, HP Labs, 1996.

[Gunes and Bingol, 2007 — Gunes&Bingol07]

Ismail Gunes and Haluk Bingol. Community detection in complex networks using agents. In Proceedings of the sixth International Conference on Autonomous Agents and Multiagent Systems, 2007.

[Guo et al., 2003 — Guo&al.03b]

Lin Guo, Feng Shao, Chavdar Botev, and Jayavel Shanmugasundaram. XRANK: Ranked keyword search over XML documents. In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data (SIGMOD '03), pages 16–27, 2003.

[Guo et al., 2007 — Guo&al.07]

Fan Guo, Steve Hanneke, Wenjie Fu, and Eric P. Xing. Recovering temporally rewiring networks: A model-based approach. In Proceedings of the Twenty-fourth International Conference on Machine Learning (ICML '07), 2007.

[Gurrin and Smeaton, 2004 — Gurrin&Smeaton04]

Cathal Gurrin and Alan F. Smeaton. Replicating Web structure in small-scale test collections. Information Retrieval, 7(3-4):239–263, September 2004.

[Gyöngyi et al., 2004 — Gyongi&al.04]

Zoltán Gyöngyi, Hector Garcia-Molina, and Jan Pedersen. Combating Web spam with TrustRank. In Proceedings of the Thirtieth International Conference on Very Large Data Bases (VLDB '04), pages 576–587, 2004.

[Han and Li, 2002 — Han&Li02]

Jin Han and Wei Li. How structure affects power-law behavior. Technical Report cond-mat/0205259, Arxiv.org, 2002.

[Handcock and Jones, 2003 — Handcock&Jones03]

Mark S. Handcock and James Holland Jones. Likelihood-based inference for stochastic models of sexual network formation. Technical Report Working Paper no. 29, Center for Statistics and the Social Sciences at the University of Washington, January 2003.

[Handcock et al., 2005 — Handcock&al.05]

Mark S. Handcock, Adrian E. Raftery, and Jeremy Tantrum. Model-based clustering for social networks. Technical Report Working Paper no. 46, Center for Statistics and the Social Sciences at the University of Washington, April 2005.

[Handcock, 2003 — Handcock03]

Mark S. Handcock. Assessing degeneracy in statistical models of social networks. Technical Report Working Paper no. 39, Center for Statistics and the Social Sciences at the University of Washington, December 31, 2003.

[Hanneke and Xing, 2006 — Hanneke&Xing06]

Steve Hanneke and Eric P. Xing. Discrete temporal models of social networks. In Proceedings of the Twenty-Third International Conference on Machine Learning Workshop on Statistical Network Analysis, 2006.

[Hanneke, 2006 — Hanneke06]

Steve Hanneke. An analysis of graph cut size for transductive learning. In Proceedings of the Twenty-Third International Conference on Machine Learning (ICML '06), pages 393–399, 2006.

[Harabagiu et al., 2006 — Harabagiu&al.06]

Sanda Harabagiu, Finley Lacatusu, and Andrew Hickl. Answering complex questions with random walk models. In Proceedings of the Twenty-Nineth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '06), pages 220–227, 2006.

[Harchol-Balter et al., 1999 — Harchol-Balter&al.99]

Mor Harchol-Balter, Tom Leighton, and Daniel Lewin. Resource discovery in distributed networks. In Proceedings of the Eighteenth ACM Symposium on Principles of Distributed Computing (PODC '99), pages 229–237, Atlanta, Georgia, United States, 1999.

[Harel and Koren, 2001 — Harel&Koren01]

David Harel and Yehuda Koren. Clustering spatial data using random walks. In Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '01), pages 281–286, 2001.

[Harmandas et al., 1997 — Harmandas&al.97]

V. Harmandas, Mark Sanderson, and Mark D. Dunlop. Image retrieval by hypertext links. In Proceedings of the Twentieth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '97), pages 296–303, 1997.

[Harrington, 2002 — Harrington02]

Edward Harrington. Large margin PRank. In Proceedings of the NIPS '02 Workshop on Beyond Classification and Regression: Learning Rankings, Preferences, Equality Predicates, and Other Structures, 2002.

[Hastings and Kozma, 2004 — Hastings&Kozma04]

Matthew B. Hastings and Balázs Kozma. Critical phenomena in a small world. In Eli Ben-Naim, Hans Frauenfelder, and Zoltan Toroczkai, editors, Complex Networks, pages 277–297. Springer Berlin/Heidelberg, 2004. Lecture Notes in Physics - Volume 650.

[Haveliwala and Kamvar, 2003 — Haveliwala&Kamvar03]

Taher Haveliwala and Sepandar Kamvar. The second eigenvalue of the Google matrix. Technical report, Stanford University Technical Report, 2003.

[Haveliwala et al., 2002 — Haveliwala&al.02]

Taher H. Haveliwala, Aristades Gionis, Dan Klein, and Piotr Indyk. Evaluating strategies for similarity search on the Web. In Proceedings of the Eleventh International Conference on the World Wide Web (WWW '02), pages 432–442, 2002.

[Haveliwala et al., 2003a — Haveliwala&al.03b]

Taher Haveliwala, Sepandar Kamvar, Dan Klein, Chris Manning, and Gene Golub. Computing PageRank using power extrapolation. Technical report, Stanford University, July 16, 2003.

[Haveliwala et al., 2003b — Haveliwala&al.03a]

Taher Haveliwala, Sepander Kamvar, and Glen Jeh. An analytical comparison of approaches to personalizing PageRank. Technical Report 2003-35, Stanford University, June 20, 2003.

[Haveliwala, 2002 — Haveliwala02]

Taher H. Haveliwala. Topic sensitive PageRank. In Proceedings of the Eleventh International Conference on the World Wide Web (WWW '02), pages 517–526, 2002.

[Hawking et al., 1999a — Hawking&al.99a]

D. Hawking, N. Craswell, P. Thistlewaite, and D. Harman. Results and challenges in Web search evaluation. In Proceedings of the Eighth International Conference on the World Wide Web (WWW '99), pages 1321–1330, 1999.

[Hawking et al., 1999b — Hawking&al.99]

David Hawking, Ellen Voorhees, Nick Craswell, and Peter Bailey. Overview of the TREC8 Web track. In Proceedings of the Eighth Text REtrieval Conference (TREC '99), 1999.

[Hawking et al., 2001a — Hawking&al.01b]

D. Hawking, N. Craswell, and K. Griffiths. Which search engine is best at finding online services?. In Proceedings of the Tenth International Conference on the World Wide Web (WWW '01), 2001.

[Hawking et al., 2001b — Hawking&al.01a]

David Hawking, Nick Craswell, Peter Bailey, and Kathleen Griffihs. Measuring search engine quality. Information Retrieval, 4(1):33–59, April 2001.

[Hayes, 2000a — Hayes00a]

B. Hayes. Graph theory in practice: Part I. American Scientist, January/February 2000.

[Hayes, 2000b — Hayes00b]

B. Hayes. Graph theory in practice: Part II. American Scientist, March/April 2000.

[He et al., 2005 — He&al.05]

Jingrui He, Mingjing Li, Hong-Jiang Zhang, Hanghang Tong, and Changshui Zhang. Manifold-ranking based image retrieval. In Proceedings of the 13th annual ACM international conference on Multimedia, pages 862–871, New York, NY, USA, 2005. ACM Press.

[Hearst, 2000 — Hearst00]

Marti A. Hearst. Next generation Web search: Setting our sites. IEEE Data Engineering Bulletin, 23(3):38–48, September 2000.

[Hendrickson and Leland, 1995 — Hendrickson&Leland95]

Bruce Hendrickson and Robert Leland. A multi-level algorithm for partitioning graphs. In Proceedings of the 1995 ACM/IEEE Conference on Supercomputing, page 28, San Diego, California, USA, 1995. ACM Press.

[Henzinger et al., 1999 — Henzinger&al.99]

Monika R. Henzinger, Allan Heydon, Michael Mitzenmacher, and Marc Najork. Measuring index quality using random walks on the Web. In Proceedings of the Eighth International Conference on the World Wide Web (WWW '99), pages 1291–1303, 1999.

[Henzinger et al., 2000 — Henzinger&al.00]

Monika R. Henzinger, Allan Heydon, Michael Mitzenmacher, and Marc Najork. On near-uniform URL sampling. Journal of Computer Networks, 33(1–6):295–308, June 2000.

[Henzinger et al., 2002 — Henzinger&al.02]

Monika R. Henzinger, Rajeev Motwani, and Craig Silverstein. Challenges in Web search engines. SIGIR Forum, 36(2):11–22, 2002.

[Henzinger et al., 2003 — Henzinger&al.03]

Monika Henzinger, Bay-Wei Chang, Brian Milch, and Sergey Brin. Query-free news search. In Proceedings of the Twelfth International Conference on the World Wide Web (WWW '03), pages 1–10, 2003.

[Henzinger, 2000 — Henzinger00]

Monika R. Henzinger. Link analysis in Web information retrieval. IEEE Data Engineering Bulletin, 23(3):3–8, 2000.

[Henzinger, 2003 — Henzinger03]

Monika R. Henzinger. Algorithmic challenges in Web search engines. Internet Mathematics, 1(1):115–126, 2003.

[Henzinger, 2006 — Henzinger06]

Monika Henzinger. Finding near-duplicate web pages: A large-scale evaluation of algorithms. In Proceedings of the Twenty-Nineth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '06), pages 284–291, 2006.

[Herbster and Pontil, 2006 — Herbster&Pontil06]

Mark Herbster and Massimiliano Pontil. Prediction on a graph with a perceptron. In Proceedings of the Twentieth Conference on Advances in Neural Information Processing Systems (NIPS 19), 2006.

[Herbster et al., 2005 — Herbster&al.05]

Mark Herbster, Massimiliano Pontil, and Lisa Wainer. Online learning over graphs. In Proceedings of the Twenty-Second International Conference on Machine Learning (ICML '05), 2005.

[Herring et al., 2004 — Herring&al.04]

Susan C. Herring, Lois Ann Scheidt, Sabrina Bonus, and Elijah Wright. Bridging the gap: A genre analysis of weblogs. In Proceedings of the Thirty-Seventh Annual Hawaii International Conference on System Sciences, page 40101.2, Washington DC, USA, 2004. IEEE Computer Society.

[Hersovici et al., 1998 — Hersovici&al.98]

Michael Hersovici, Michal Jacovia, Yoelle S. Maareka, Dan Pelleg, Menachem Shtalhaima, and Sigalit Ura. The shark-search algorithm - an application: Tailored Web site mapping. In Proceedings of the Seventh International Conference on the World Wide Web (WWW '98), 1998.

[Heydon and Najork, 1999 — Heydon&Najork99]

Allan Heydon and Marc Najork. Mercator: A scalable, extensible Web crawler. World Wide Web Journal, 2(4):219–229, 1999.

[Higham, 2004 — Higham04]

Desmond J. Higham. Clustering, ordering, and random graph models for interaction networks. In Proceedings of the ISMB '04 Workshop on Bioinformatics and Statistical Physics, 2004.

[Hill and Dunbar, 2003 — Hill&Dunbar03]

R. A. Hill and R. I. M. Dunbar. Social network size in humans. Human Nature, 14(1):53–72, 2003.

[Hill et al., 2005 — Hill&al.05]

Shawndra Hill, Deepak Agarwal, Robert Bell, and Chris Volinsky. Tuning representations of dynamic network data. In Proceedings of the ACM SIGKDD '05 Workshop on Link Discovery: Issues, Approaches and Applications (LinkKDD '05), 2005.

[Hinich and Molyneux, 2003 — Hinich&Molyneux03]

Melvin J. Hinich and Robert E. Molyneux. Predicting information flows in network traffic. Journal of the American Society for Information Science and Technology, 54(2):161–168, January 15, 2003.

[Hoenkamp and Song, 2004 — Hoenkamp&Song04]

Eduard Hoenkamp and Dawei Song. The document as an ergodic Markov chain. In Proceedings of the Twenty-Seventh Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '04), pages 496–497, 2004.

[Hoff et al., 2001 — Hoff&al.01]

Peter Hoff, Adrian E. Raftery, and Mark S. Handcock. Latent space approaches to social network analysis. Technical Report Technical Report no. 399, Center for Statistics and the Social Sciences at the University of Washington, November 5, 2001.

[Hoff, 2003 — Hoff03]

Peter Hoff. Random effects models for network data. Technical Report Working Paper no. 28, Center for Statistics and the Social Sciences at the University of Washington, January 2003.

[Hofmann and Puzicha, 1998 — Hofmann&Puzicha98]

Thomas Hofmann and Jan Puzicha. Unsupervised learning from dyadic data. Technical Report TR-98-042, University of California Berkeley, Berkeley, California, USA, 1998.

[Hofmann and Puzicha, 1999 — Hofmann&Puzicha99]

Thomas Hofmann and Jan Puzicha. Latent class models for collaborative filtering. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI '99), pages 688–693, 1999.

[Hofmann et al., 1999 — Hofmann&al.99]

Thomas Hofmann, Jan Puzicha, and Michael I. Jordan. Learning from dyadic data. In Proceedings of the Thirteenth Conference on Advances in Neural Information Processing Systems (NIPS 12), pages 466–472, 1999.

[Hofmann, 1999a — Hofmann99a]

Thomas Hofmann. The cluster-abstraction model: Unsupervised learning of topic hierarchies from text data. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI '99), pages 682–687, 1999.

[Hofmann, 1999b — Hofmann99c]

Thomas Hofmann. Learning the similarity of documents: An information geometric approach to document retrieval and categorization. In Proceedings of the Thirteenth Conference on Advances in Neural Information Processing Systems (NIPS 12), pages 914–920, 1999.

[Hofmann, 1999c — Hofmann99e]

Thomas Hofmann. Probabilistic latent semantic analysis. In Proceedings of the Fifteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI '99), pages 289–296, San Francisco, California, USA, 1999. Morgan Kaufmann Publishers.

[Hofmann, 1999d — Hofmann99b]

Thomas Hofmann. Probabilistic latent semantic indexing. In Proceedings of the Twenty-Second Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '99), pages 50–57, 1999.

[Hofmann, 1999e — Hofmann99d]

Thomas Hofmann. Text categorization with labeled and unlabeled data: A generative model approach. In Proceedings of the NIPS '99 Workshop on Using Unlabeled Data for Supervised Learning, 1999.

[Hofmann, 2000 — Hofmann00]

Thomas Hofmann. Learning probabilistic models of the Web. In Proceedings of the Twenty-Third Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '00), pages 369–371, 2000.

[Hofmann, 2001a — Hofmann01c]

Thomas Hofmann. From latent semantic indexing to language models and back. In Proceedings of the 2001 Workshop on Language Modeling and Information Retrieval (LMIR '01), pages 42–46, 2001.

[Hofmann, 2001b — Hofmann01b]

Thomas Hofmann. From words to images: SVMs for multiple-instance learning with applications in content-based image retrieval. In Proceedings of the NIPS '01 Workshop on Machine Learning Methods for Text and Images, 2001.

[Hofmann, 2001c — Hofmann01a]

Thomas Hofmann. Unsupervised learning by probabilistic latent semantic analysis. Machine Learning, 42(1-2):177–196, 2001.

[Hofmann, 2004 — Hofmann04]

Thomas Hofmann. Latent semantic models for collaborative filtering. ACM Transactions on Information Systems, 22(1):89–115, January 2004.

[Holme and Newman, 2006 — Holme&Newman06]

Petter Holme and Mark E. J. Newman. Nonequilibrium phase transition in the coevolution of networks and opinions. Technical Report physics/0603023, Arxiv.org, March 9, 2006.

[Holme, 2003 — Holme03]

Petter Holme. Optimized local navigation in congested complex networks. In Proceedings of the NIPS '03 Workshop on Robust Communication Dynamics in Complex Networks, 2003.

[Hölzer et al., 2005 — Holzer&al.05]

Ralf Hölzer, Bradley Malin, and Latanya Sweeney. Email alias detection using social network analysis. In Proceedings of the ACM SIGKDD '05 Workshop on Link Discovery: Issues, Approaches and Applications (LinkKDD '05), 2005.

[Hopcroft et al., 2003 — Hopcroft&al.03]

John E. Hopcroft, Omar Khan, Brian Kulis, and Bart Selman. Natural communities in large linked networks. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '03), pages 541–546, 2003.

[Hsu and Taksa, 2005 — Hsu&Taksa05]

D. Frank Hsu and Isak Taksa. Comparing rank and score combination methods for data fusion in information retrieval. Information Retrieval, 8(3):449–480, January 2005.

[Huang et al., 2004a — Huang&al.04a]

Xiangji Huang, Fuchun Peng, Aijun An, and Dale Schuurmans. Dynamic Web log session identification with statistical language models. Journal of the American Society for Information Science and Technology, 55(14):1290–1303, December 2004.

[Huang et al., 2004b — Huang&al.04b]

Zan Huang, Wingyan Chung, and Hsinchun Chen. A graph model for E-commerce recommender systems. Journal of the American Society for Information Science and Technology, 55(3):259–274, February 1, 2004.

[Hubbell, 1965 — Hubbell65]

C. H. Hubbell. An input-output approach to clique identification. Sociometry, 28(4):377–399, December 1965.

[Huber, 1998 — Huber98]

John C. Huber. Cumulative advantage and success-breeds-success: The value of time pattern analysis. Journal of the American Society for Information Science, 49(5):471–476, 1998.

[Huber, 2002 — Huber02]

John C. Huber. A new model that generates lotka's law. Journal of the American Society for Information Science and Technology, 53(3):209–219, 2002.

[Huberman and Adamic, 1999 — Huberman&Adamic99]

Bernardo A. Huberman and Lada A. Adamic. Growth dynamics of the World Wide Web. Nature, 401(6749), September 9, 1999.

[Huberman et al., 1998 — Huberman&al.98]

Bernardo A. Huberman, Peter L. Pirolli, James E. Pitkow, and Rajan M. Lukose. Strong Regularities in World Wide Web Surfing. Science, 280(5360):95–97, 1998.

[Huberman, 2001 — Huberman01]

Bernardo A. Huberman. The Laws of the Web. MIT Press, Cambridge, MA, 2001.

[Hyland, 2003 — Hyland03]

Ken Hyland. Self-citation and self-reference: Credibility and promotion in academic publication. Journal of the American Society for Information Science and Technology, 54(3):251–259, February 1, 2003.

[i Cancho et al., 2007 — Cancho&al.07]

Ramon Ferrer i Cancho, Alexander Mehler, Olga Pustylnikov, and Albert Díaz-Guilera. Correlations in the organization of large-scale syntactic dependency networks. In TextGraphs-2: Graph-Based Algorithms for Natural Language Processing, pages 65–72, Rochester, New York, USA, 2007. Association for Computational Linguistics.

[Ino et al., 2005 — Ino&al.05]

Hidehiko Ino, Mineichi Kudo, and Atsuyoshi Nakamura. Partitioning of Web graphs by community topology. In Proceedings of the Fourteenth International Conference on the World Wide Web (WWW '05), pages 661–669, 2005.

[Inokuchi et al., 2003 — Inokuchi&al.03]

Akihiro Inokuchi, Takashi Washio, and Hiroshi Motoda. Complete mining of frequent patterns from graphs: Mining graph data. Machine Learning, 50(3):321–354, March 2003.

[Ishida, 2005 — Ishida05]

Kazunari Ishida. Extracting latent weblog communities: A partitioning algorithm for bipartite graphs. In Proceedings of the WWW '05 Second Annual Workshop on the Weblogging Ecosystem: Aggregation, Analysis, and Dynamics, 2005.

[Ito et al., 2005 — Ito&al.05]

Takahiko Ito, Masashi Shimbo, Taku Kudo, and Yuji Matsumoto. Application of kernels to link analysis. In Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '05), pages 586–592, 2005.

[Ivancheva, 2001 — Ivancheva01]

Ludmila E. Ivancheva. The non-gaussian nature of bibliometric and scientometric distributions: A new approach to interpretation. Journal of the American Society for Information Science and Technology, 52(13):1100–1105, 2001.

[Ivaneyko et al., 2006 — Ivaneyko&al.06]

D. Ivaneyko, J. Ilnytskyi, B. Berche, and Yu. Holovatch. Local and cluster critical dynamics of the 3d random-site Ising model. Technical Report cond-mat/0603521, Arxiv.org, March 20, 2006.

[Jackson and Rogers, 2006 — Jackson&Rogers06]

Matthew O. Jackson and Brian W. Rogers. Relating network structure to diffusion properties through stochastic dominance. Unpublished draft paper, October 31, 2006.

[Jain and Krishna, 2001 — Jain&Krishna01]

Sanjay Jain and Sandeep Krishna. A model for the emergence of cooperation, interdependence and structure in evolving networks. Proceedings of the National Academy of Sciences of the United States of America, 98(2):543–547, January 16, 2001.

[Jain and Wysotzki, 2004 — Jain&Wysotzki04]

Brijnesh J. Jain and Fritz Wysotzki. Central clustering of attributed graphs. Machine Learning, 56(1-3):169–207, July 2004.

[Jain et al., 1999 — Jain&al.99]

A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: A review. ACM Computing Surveys, 31(3):264–323, 1999.

[Jansen and Spink, 2006 — Jansen&Spink06]

Bernard J. Jansen and Amanda Spink. How are we searching the World Wide Web? A comparison of nine search engine transaction logs. Information Processing and Management, 42(1):248–263, January 2006.

[Jansen et al., 2005 — Jansen&al.05]

Bernard J. Jansen, Amanda Spink, and Jan Pedersen. A temporal comparison of AltaVista web searching. Journal of the American Society for Information Science and Technology, 56(6):559–570, April 2005.

[Janson et al., 1993 — Janson&al.93]

S. Janson, D. E. Knuth, T. Luczak, and B. Pittel. The birth of the giant component. Random Structures and Algorithms, 4(233–358), 1993.

[Janson et al., 2000 — Janson&al.00]

S. Janson, T. Luczak, and A. Rucinski. Random Graphs. Wiley, New York, 2000.

[Jeh and Widom, 2002 — Jeh&Widom02]

Glen Jeh and Jennifer Widom. SimRank: A measure of structural-context similarity. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '02), pages 538–543, 2002.

[Jensen, 2006 — Jensen06]

Pablo Jensen. A network-based prediction of retail stores commercial categories and optimal locations. Physical Review E, 74(3), September 2006.

[Jeong et al., 2000 — Jeong&al.00]

Hawoong Jeong, B. Tombor, Réka Albert, Zoltan N. Oltvai, and Albert-László Barabási. The large-scale organization of metabolic networks. Nature, 407(6804):651–653, October 5, 2000.

[Jeong et al., 2001 — Jeong&al.01]

Hawoong Jeong, Zoltan Néda, and Albert-László Barabási. Measuring preferential attachment for evolving networks. Technical Report cond-mat/0104131, Arxiv.org, 2001.

[Jepsen et al., 2004 — Jepsen&al.04]

Erik Thorlund Jepsen, Piet Seiden, Peter Ingwersen, Lennart Bjorneborn, and Pia Borlund. Characteristics of scientific Web publications: Preliminary data gathering and analysis. Journal of the American Society for Information Science and Technology, 55(14):1239–1249, December 2004.

[Jespersen and Blumen, 2000 — Jespersen&Blumen00]

Sune Norhoj Jespersen and Alexander Blumen. Small-world networks: Links with long-tailed distributions. Physical Review E, 62(5):6270–6274, November 2000.

[Jin et al., 2001 — Jin&al.01]

Emily M. Jin, Michelle Girvan, and Mark E. J. Newman. Structure of growing social networks. Physical Review E, 64(4):046132, October 2001.

[Joachims et al., 2001 — Joachims&al.01]

Thorsten Joachims, Nello Cristianini, and John Shawe-Taylor. Composite kernels for hypertext categorisation. In Proceedings of the Eighteenth International Conference on Machine Learning (ICML '01), pages 250–257, 2001.

[Joachims et al., 2005 — Joachims&al.05]

Thorsten Joachims, Laura A. Granka, Bing Pan, Helene Hembrooke, and Geri Gay. Accurately interpreting clickthrough data as implicit feedback. In Proceedings of the Twenty-Eighth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '05), pages 154–161, 2005.

[Joachims, 2003 — Joachims03]

Thorsten Joachims. Transductive learning via spectral graph partitioning. In Proceedings of the Twentieth International Conference on Machine Learning (ICML '03), pages 290–297, 2003.

[Joachims, 2004 — Joachims04]

Thorsten Joachims. Supervised clustering: A maximum-margin approach. In Proceedings of the NIPS '04 Workshop on Learning with Structured Outputs, 2004.

[Johnson et al., 2003 — Johnson&al.03]

Judy Johnson, Kostas Tsioutsiouliklis, and C. Lee Giles. Evolving strategies for focused Web crawling. In Proceedings of the Twentieth International Conference on Machine Learning (ICML '03), pages 298–305, 2003.

[Jones et al., 2006 — Jones&al.06]

Rosie Jones, Benjamin Rey, Omid Madani, and Wiley Greiner. Generating query substitutions. In Proceedings of the Fifteenth International Conference on the World Wide Web (WWW '06), pages 387–396, 2006.

[Jones, 2004 — Jones04]

Rosie Jones. Semisupervised learning on small worlds. In Proceedings of the ACM SIGKDD '04 Workshop on Link Analysis for Detecting Complex Behavior (LinkKDD '04), 2004.

[Jost and Joy, 2002 — Jost&Joy02]

Jürgen Jost and M. P. Joy. Evolving networks with distance preferences. Technical Report cond-mat/0202343, Arxiv.org, 2002.

[Kahng et al., 2001 — Kahng&al.01]

Byungnam Kahng, Y. Park, and Hawoong Jeong. Robustness of the in-degree exponent for the world wide Web. Technical Report cond-mat/0112358, Arxiv.org, 2001.

[Kalisky et al., 2004 — Kalisky&al.04]

Tomer Kalisky, Reuven Cohen, Daniel ben Avraham, and Shlomo Havlin. Tomography and stability of complex networks. In Eli Ben-Naim, Hans Frauenfelder, and Zoltan Toroczkai, editors, Complex Networks, pages 3–34. Springer Berlin/Heidelberg, 2004. Lecture Notes in Physics - Volume 650.

[Kammer and Täubig, 2005 — Kammer&Taubig05]

Frank Kammer and Hanjo Täubig. Connectivity. In Ulrik Brandes and Thomas Erlebach, editors, Network Analysis: Methodological Foundations, pages 143–177. Springer Berlin/Heidelberg, 2005. Lecture Notes in Computer Science - Volume 3418.

[Kamps, 2005 — Kamps05]

Jaap Kamps. Web-centric language models. In Proceedings of the Fourteenth International Conference on Information and Knowledge Management (ACM CIKM '05), pages 307–308, 2005.

[Kamvar and Haveliwala, 2003 — Kamvar&Haveliwala03]

Sepandar Kamvar and Taher Haveliwala. The condition number of the PageRank problem. Technical Report 2003-36, Stanford University, June 20, 2003.

[Kamvar et al., 2002 — Kamvar&al.02]

Sepandar D. Kamvar, Dan Klein, and Christopher D. Manning. Interpreting and extending classical agglomerative clustering algorithms using a model-based approach. In Proceedings of the Ninteenth International Conference on Machine Learning (ICML '02), pages 283–290, 2002.

[Kamvar et al., 2003a — Kamvar&al.03e]

Sepandar Kamvar, Taher Haveliwala, and Gene Golub. Adaptive methods for the computation of PageRank. Technical Report 2003-26, Stanford University, April 28, 2003.

[Kamvar et al., 2003b — Kamvar&al.03a]

Sepandar D. Kamvar, Taher H. Haveliwala, Christopher D. Manning, and Gene H. Golub. Exploiting the block structure of the Web for computing PageRank. Technical report, Stanford University, March 2003.

[Kamvar et al., 2003c — Kamvar&al.03b]

Sepandar D. Kamvar, Dan Klein, and Christopher D. Manning. Spectral learning. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI '03), pages 561–566, 2003.

[Kamvar et al., 2003d — Kamvar&al.03d]

Sepandar D. Kamvar, Mario T. Schlosser, and Hector Garcia-Molina. The EigenTrust Algorithm for reputation management in P2P networks. In Proceedings of the Twelfth International Conference on the World Wide Web (WWW '03), pages 640–651, 2003.

[Kamvar et al., 2003e — Kamvar&al.03c]

Sepander D. Kamvar, Taher H. Haveliwala, Christopher D. Manning, and Gene H. Golub. Extrapolation methods for accelerating PageRank computations. In Proceedings of the Twelfth International Conference on the World Wide Web (WWW '03), pages 261–270, 2003.

[Kappen, 2003 — Kappen03]

Bert Kappen. Validity estimates for belief propagation on random graphs. In Proceedings of the NIPS '03 Workshop on Robust Communication Dynamics in Complex Networks, 2003.

[Kardkovacs et al., 2005 — Kardkovacs&al.05]

Zsolt T. Kardkovacs, Domonkos Tikk, and Zoltán Bánsághi. The Ferrety algorithm for the KDD Cup 2005 problem. SIGKDD Explorations Newsletter, 7(2):111–116, 2005.

[Kargupta et al., 2003 — Kargupta&al.03]

Hillol Kargupta, Kun Liu, Souptik Datta, Jessica Ryan, and Krishnamoorthy Sivakumar. Link analysis, privacy preservation, and random perturbations. In Proceedings of the ACM SIGKDD '03 Workshop on Link Analysis for Detecting Complex Behavior (LinkKDD '03), 2003.

[Karp et al., 2000 — Karp&al.00]

Richard M. Karp, Christian Schindelhauer, Scott Shenker, and Berthold Vöcking. Randomized rumor spreading. In Proceedings of the Forty-First Annual Symposium on Foundations of Computer Science (FOCS '00), pages 565–574, 2000.

[Katz, 1953 — Katz53]

L. Katz. A new status index derived from sociometric analysis. Psychometrika, 18, 1953.

[Kauffman, 1995 — Kauffman95]

S. A. Kauffman. At Home in the Universe: The Search for the Laws of Self-Organization and Complexity. Oxford University Press, Oxford, 1995.

[Kempe and Kleinberg, 2002 — Kempe&Kleinberg02]

David Kempe and Jon M. Kleinberg. Protocols and impossibility results for gossip-based communication mechanisms. In Proceedings of the Forty-Third Annual Symposium on Foundations of Computer Science (FOCS '02), pages 471–480, 2002.

[Kempe et al., 2001 — Kempe&al.01]

David Kempe, Jon Kleinberg, and Alan Demers. Spatial gossip and resource location protocols. In Proceedings of the Thirty-Third ACM Symposium on the Theory of Computing (STOC '01), pages 163–172, 2001.

[Kempe et al., 2003a — Kempe&al.03b]

David Kempe, Alin Dobra, and Johannes Gehrke. Gossip-based computation of aggregate information. In Proceedings of the Forty-Fourth Annual Symposium on Foundations of Computer Science (FOCS '03), pages 482–491, 2003.

[Kempe et al., 2003b — Kempe&al.03a]

David Kempe, Jon Kleinberg, and Éva Tardos. Maximizing the spread of influence through a social network. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '03), pages 137–146, 2003.

[Kempe et al., 2005 — Kempe&al.05]

David Kempe, Jon Kleinberg, and Éva Tardos. Influential nodes in a diffusion model for social networks. In Proceedings of ICALP 2005, Lisboa, Portugal, 2005.

[Kempe, 2003 — Kempe03]

David Kempe. Epidemic models of communication in networks. In Proceedings of the NIPS '03 Workshop on Robust Communication Dynamics in Complex Networks, 2003.

[Kermack and McKendrick, 1927 — Kermack&McKendrick27]

W. O. Kermack and A.G. McKendrick. A contribution to the mathematical theory of epidemics. Proceedings of the Royal Society of London, Series A, 115(772):700–721, August 1, 1927.

[Kessler, 1963 — Kessler63]

M. M. Kessler. Bibliographic coupling between scientific papers. American Documentation, 14:10–25, 1963.

[Ketkar et al., 2005 — Ketkar&al.05]

Nikhil S. Ketkar, Lawrence B. Holder, and Diane J. Cook. Comparison of graph-based and logic-based multi-relational data mining. SIGKDD Explorations Newsletter, 7(2):64–71, 2005.

[Kiefer, 2005 — Kiefer05]

Bernd Kiefer. Redundancy-free island parsing of word graphs. In Proceedings of the Ninteenth International Joint Conference on Artificial Intelligence (IJCAI '05), pages 1079–1084, 2005.

[Killworth and Bernard, 1978 — Killworth&Bernard78]

Peter D. Killworth and H. Russell Bernard. The reversal small-world experiment. Social Networks, 1(2):159–192, 1978.

[Kim et al., 2001a — Kim&al.01a]

Beom Jun Kim, Chang No Yoon, Seugn Kee Han, and Hawoong Jeong. Path finding strategies in scale-free networks. Physical Review E, 65(2):027103, January 23, 2001.

[Kim et al., 2001b — Kim&al.01b]

Hyun-Joo Kim, Youngki Lee, In-Mook Kim, and Byungnam Kahng. Scale-free networks in financial correlations. Technical Report cond-mat/0107449, Arxiv.org, 2001.

[Kim et al., 2002 — Kim&al.02]

J. Kim, P. L. Krapivsky, Byungnam Kahng, and S. Redner. Infinite-order percolation and giant fluctuations in a protein interaction network. Technical Report cond-mat/0203167, Arxiv.org, 2002.

[Kinouchi et al., 2001 — Kinouchi&al.01]

Osame Kinouchi, Alexandre S. Martinez, Gilson F. Lima, G. M. Lourenco, and Sebastian Risau-Gusman. Deterministic walks in random networks: An application to thesaurus graphs. Technical Report cond-mat/0110217, Arxiv.org, 2001.

[Kinouchi et al., 2002 — Kinouchi&al.02]

O. Kinouchi, A.S. Martinez, G.F. Lima, G.M. Lourenço, and S. Risau-Gusman. Deterministic walks in random networks: an application to thesaurus graphs. Physica A, 315:665–676, 2002.

[Kirkpatrick, 2003 — Kirkpatrick03]

David Kirkpatrick. Going deeper than Google. Fortune, December 16, 2003.

[Klavans and Boyack, 2006 — Klavans&Boyack06]

Richard Klavans and Kevin W. Boyack. Identifying a better measure of relatedness for mapping science. Journal of the American Society for Information Science and Technology, 57(2):251–263, January 2006.

[Kleinberg and Lawrence, 2001 — Kleinberg&Lawrence01]

Jon Kleinberg and Steve Lawrence. The structure of the Web. Science, 294(5548):1849–1850, 2001.

[Kleinberg and Tardos, 1995 — Kleinberg&Tardos95]

Jon M. Kleinberg and Éva Tardos. Disjoint paths in densely embedded graphs. In Proceedings of the Thirty-Sixth Annual Symposium on Foundations of Computer Science (FOCS '95), pages 52–61, 1995.

[Kleinberg and Tardos, 1999 — Kleinberg&Tardos99]

Jon M. Kleinberg and Éva Tardos. Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields. In Proceedings of the Fortieth Annual Symposium on Foundations of Computer Science (FOCS '99), pages 14–23, 1999.

[Kleinberg et al., 1999 — Kleinberg&al.99]

Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew S. Tomkins. The Web as a graph: Measurements, models and methods. In Proceedings of the Fifth International Computing and Combinatorics Conference (COCOON '99), 1999.

[Kleinberg, 1999a — Kleinberg99]

Jon M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604–632, Septembeer 1999.

[Kleinberg, 1999b — Kleinberg99b]

Jon M. Kleinberg. Hubs, authorities, and communities. ACM Computing Surveys, 31(4es):Article No. 5, December 1999.

[Kleinberg, 2000a — Kleinberg00a]

Jon Kleinberg. The small-world phenomenon: An algorithmic perspective. In Proceedings of the Thirty-Second ACM Symposium on the Theory of Computing (STOC '00), 2000.

[Kleinberg, 2000b — Kleinberg00]

Jon M. Kleinberg. Navigation in a small world. Nature, 406(6798):845, August 24, 2000.

[Kleinberg, 2001 — Kleinberg01]

Jon Kleinberg. Small-world phenomena and the dynamics of information. In Proceedings of the Fifteenth Conference on Advances in Neural Information Processing Systems (NIPS 14), pages 431–438, 2001.

[Kleinberg, 2002 — Kleinberg02a]

Jon Kleinberg. An impossibility theorem for clustering. In Proceedings of the Sixteenth Conference on Advances in Neural Information Processing Systems (NIPS 15), pages 446–453, 2002.

[Kleinberg, 2003 — Kleinberg03]

Jon Kleinberg. Detecting a network failure. Internet Mathematics, 1(1):37–56, 2003.

[Kleinfeld, 2002 — Kleinfeld02]

Judith Kleinfeld. Could it be a big world after all? The `six degrees of separation' myth. Society, April 12, 2002.

[Klemm and Eguíluz, 2002a — Klemm&Eguiluz02b]

Konstantin Klemm and Victor M. Eguíluz. Growing scale-free networks with small-world behavior. Physical Review E, 65(5):057102, May 8, 2002.

[Klemm and Eguíluz, 2002b — Klemm&Eguiluz02a]

Konstantin Klemm and Victor M. Eguíluz. Highly clustered scale-free networks. Physical Review E, 65(3):036123, March 2002.

[Kobayashi and Takeda, 2000 — Kobayashi&Takeda00]

Mei Kobayashi and Koichi Takeda. Information retrieval on the Web. ACM Computing Surveys (CSUR), 32(2):144–173, 2000.

[Koenig and Harrell, 1995 — Koenig&Harrell95]

Michael Koenig and Toni Harrell. Lotka's law, Price's urn, and electronic publishing. Journal of the American Society for Information Science, 46(5):386–388, June 1995.

[Kolari et al., 2006 — Kolari&al.06]

Pranam Kolari, Akshay Java, and Tim Finin. Characterizing the Splogosphere. In Proceedings of the WWW '06 Third Annual Workshop on the Weblogging Ecosystem: Aggregation, Analysis, and Dynamics, 2006.

[Kondor and Lafferty, 2002 — Kondor&Lafferty02]

Risi Imre Kondor and John D. Lafferty. Diffusion kernels on graphs and other discrete input spaces. In Proceedings of the Ninteenth International Conference on Machine Learning (ICML '02), pages 315–322, 2002.

[Koren et al., 2006 — Koren&al.06]

Yehuda Koren, Stephen C. North, and Chris Volinsky. Measuring and extracting proximity in networks. In Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '06), pages 245–255, 2006.

[Korte and Milgram, 1970 — Korte&Milgram78]

Charles Korte and Stanley Milgram. Acquaintance networks between racial groups: Application of the small world method. Journal of Personality and Social Psychology, 15:101–108, 1970.

[Koschützki et al., 2005a — Koschutzki&al.05a]

Dirk Koschützki, Katharina Anna Lehmann, Leon Peeters, Stefan Richter, Dagmar Tenfelde-Podehl, and Oliver Zlotowski. Centrality indices. In Ulrik Brandes and Thomas Erlebach, editors, Network Analysis: Methodological Foundations, pages 16–61. Springer Berlin/Heidelberg, 2005. Lecture Notes in Computer Science - Volume 3418.

[Koschützki et al., 2005b — Koschutzki&al.05b]

Dirk Koschützki, Katharina Anna Lehmann, Dagmar Tenfelde-Podehl, and Oliver Zlotowski. Advanced centrality concepts. In Ulrik Brandes and Thomas Erlebach, editors, Network Analysis: Methodological Foundations, pages 83–111. Springer Berlin/Heidelberg, 2005. Lecture Notes in Computer Science - Volume 3418.

[Kosinov and Caelli, 2002 — Kosinov&Caelli02]

Serhiy Kosinov and Terry Caelli. Inexact multisubgraph matching using graph eigenspace and clustering models. In Proceedings of the Joint IAPR International Workshops on SSPR/SPR 2002, pages 133–142. Springer, 2002.

[Kossinets and Watts, 2006 — Kossinets&Watts06]

Gueorgi Kossinets and Duncan J. Watts. Empirical analysis of an evolving social network. Science, 311(5757):88–90, January 6, 2006.

[Kraft and Zien, 2004 — Kraft&Zien04]

Reiner Kraft and Jason Zien. Mining anchor text for query refinement. In Proceedings of the Thirteenth International Conference on the World Wide Web (WWW '04), pages 666–674, 2004.

[Kraft et al., 2003 — Kraft&al.03]

Reiner Kraft, Enes Hastor, and Raymie Stata. TimeLinks: Exploring the link structure of the evolving Web. In Proceedings of the WWW '03 Second Workshop on Algorithms and Models for the Web-Graph (WAW '03), 2003.

[Krapivsky and Redner, 2001 — Krapivsky&Redner01]

P. L. Krapivsky and S. Redner. Organization of growing random networks. Physical Review E, 63(6):066123, June 2001.

[Krapivsky et al., 2000 — Krapivsky&al.00]

P. L. Krapivsky, S. Redner, and F. Leyvraz. Connectivity of growing random networks. Physical Review Letters, 85(21):4629–4632, November 20, 2000.

[Krapivsky et al., 2001 — Krapivsky&al.01]

P. L. Krapivsky, G. J. Rodgers, and S. Redner. Degree distributions of growing networks. Physical Review Letters, 86(23):5401–5404, June 4, 2001.

[Krebs, 2002 — Krebs02]

Valdis Krebs. Mapping networks of terrorist cells. Connections, 24(3):43–52, 2002.

[Krishnapuram et al., 2004 — Krishnapuram&al.04]

Balaji Krishnapuram, David Williams, Ya Xue, Alexander Hartemink, Lawrence Carin, and Mario Figueiredo. On semi-supervised classification. In Proceedings of the Eighteenth Conference on Advances in Neural Information Processing Systems (NIPS 17), pages 721–728, 2004.

[Kruger et al., 2000 — Kruger&al.00]

Andries Kruger, C. Lee Giles, Frans Coetzee, Eric Glover, Gary Flake, Steve Lawrence, and Cristian Omlin. DEADLINER: Building a new niche search engine. In Proceedings of the Ninth International Conference on Information and Knowledge Management (ACM CIKM '00), pages 272–281, 2000.

[Kryssanov et al., 2006 — Kryssanov&al.06]

Victor V. Kryssanov, Frank J. Rinaldo, Evgeny L. Kuleshov, and Hitoshi Ogawa. Modeling the dynamics of social networks. Technical Report cs.CY/0605101, Arxiv.org, May 24, 2006.

[Krzywicki, 2001 — Krzywicki01]

Andre Krzywicki. Defining statistical ensembles of random graphs. Technical Report cond-mat/0110574, Arxiv.org, 2001.

[Kubica et al., 2002 — Kubica&al.02]

Jeremy Kubica, Andrew Moore, Jeff Schneider, and Yiming Yang. Stochastic link and group detection. In Proceedings of the Eighteenth National Conference on Artificial Intelligence and the Fourteenth Conference on Innovative Applications of Artificial Intelligence (AAAI '02/IAAI '02), pages 798–806, 2002.

[Kubica et al., 2003a — Kubica&al.03b]

Jeremy Kubica, Andrew Moore, David Cohn, and Jeff Schneider. cGraph: A fast graph-based method for link analysis and queries. In Proceedings of the IJCAI '03 Workshop on Text Mining and Link Analysis (TextLink 2003), 2003.

[Kubica et al., 2003b — Kubica&al.03a]

Jeremy Kubica, Andrew W. Moore, David Cohn, and Jeff G. Schneider. Finding underlying connections: A fast graph-based method for link analysis and collaboration queries. In Proceedings of the Twentieth International Conference on Machine Learning (ICML '03), pages 392–399, 2003.

[Kudo et al., 2004 — Kudo&al.04]

Taku Kudo, Eisaku Maeda, and Yuji Matsumoto. An application of boosting to graph classification. In Proceedings of the Eighteenth Conference on Advances in Neural Information Processing Systems (NIPS 17), pages 729–736, 2004.

[Kulis et al., 2005 — Kulis&al.05]

Brian Kulis, Sugato Basu, Inderjit Dhillon, and Raymond Mooney. Semi-supervised graph clustering: A kernel approach. In Proceedings of the Twenty-Second International Conference on Machine Learning (ICML '05), 2005.

[Kulkarni et al., 1999 — Kulkarni&al.99]

Rajendra V. Kulkarni, E. Almaas, and David Stroud. Evolutionary dynamics in the Bak-Sneppen model on small-world networks. Technical Report cond-mat/9905066, Arxiv.org, 1999.

[Kulkarni et al., 2000 — Kulkarni&al.00]

Rajendra V. Kulkarni, E. Almaas, and David Stroud. Exact results and scaling properties of small-world networks. Physical Review E, 61(4):4268–4271, April 2000.

[Kullmann and Kertész, 2001a — Kullmann&Kertesz01a]

L. Kullmann and Janos Kertész. Preferential growth: Exact solution of the time-dependent distributions. Physical Review E, 63(5):051112, May 2001.

[Kullmann and Kertész, 2001b — Kullmann&Kertesz01b]

L. Kullmann and Janos Kertész. Preferential growth: Solution and application to modelling stock market. Physica A, 299(1):121–126, October 1, 2001.

[Kullmann et al., 2001 — Kullmann&al.01]

L. Kullmann, Janos Kertész, and K. Kaski. Time dependent cross correlations between different stock returns: A directed network of influence. Physical Review E, 64(5):057105, November 2001.

[Kumar et al., 1998 — Kumar&al.98]

Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew Tomkins. Recommendation systems: A probabilistic analysis. In Proceedings of the Thirty-Ninth Annual Symposium on Foundations of Computer Science (FOCS '98), pages 664–673, 1998.

[Kumar et al., 1999a — Kumar&al.99a]

Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew Tomkins. Trawling the Web for emerging cyber communities. In Proceedings of the Eighth International Conference on the World Wide Web (WWW '99), 1999.

[Kumar et al., 1999b — Kumar&al.99b]

Ravi Kumar, Pradhakar Raghavan, Sridhar Rajagopalan, and Andrew Tomkins. Extracting large-scale knowledge bases from the Web. In Proceedings of the Twenty-Fifth International Conference on Very Large Data Bases (VLDB '99), pages 639–650, 1999.

[Kumar et al., 2000a — Kumar&al.00]

Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, and Eli Upfal. Random graph models for the Web graph. In Proceedings of the Forty-First Annual Symposium on Foundations of Computer Science (FOCS '00), pages 57–65, 2000.

[Kumar et al., 2000b — Kumar&al.00a]

S. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, and Eli Upfal. Stochastic models for the Web graph. In Proceedings of the Forty-First Annual Symposium on Foundations of Computer Science (FOCS '00), pages 57–65, 2000.

[Kumar et al., 2000c — Kumar&al.00b]

S. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, and Eli Upfal. The Web as a graph. In Proceedings of the Ninteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '00), pages 1–10, 2000.

[Kumar et al., 2003 — Kumar&al.03]

Ravi Kumar, Jasmine Novak, Prabhakar Ragahavan, and Andrew Tomkins. On the bursty evolution of Blogspace. In Proceedings of the Twelfth International Conference on the World Wide Web (WWW '03), pages 568–576, 2003.

[Kumar et al., 2004a — Kumar&al.04b]

Ravi Kumar, Uma Mahadevan, and D. Sivakumar. A graph-theoretic approach to extract storylines from search results. In Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '04), pages 216–225, 2004.

[Kumar et al., 2004b — Kumar&al.04a]

S. Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, and Andrew Tomkins. Structure and evolution of Blogspace. Communications of the ACM, 47(12):35–39, 2004.

[Kumar et al., 2006 — Kumar&al.06]

Ravi Kumar, Jasmine Novak, and Andrew Tomkins. Structure and evolution of online social networks. In Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '06), pages 611–617, 2006.

[Kummamuru et al., 2004 — Kummamuru&al.04]

Krishna Kummamuru, Rohit Lotlikar, Shourya Roy, Karan Singal, and Raghu Krishnapuram. A hierarchical monothetic document clustering algorithm for summarization and browsing search results. In Proceedings of the Thirteenth International Conference on the World Wide Web (WWW '04), pages 658–665, 2004.

[Kurland and Lee, 2005 — Kurland&Lee05]

Oren Kurland and Lillian Lee. PageRank without hyperlinks: Structural re-ranking using links induced by language models. In Proceedings of the Twenty-Eighth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '05), pages 306–313, 2005.

[Kurland and Lee, 2006 — Kurland&Lee06]

Oren Kurland and Lillian Lee. Respect my authority! HITS without hyperlinks, utilizing cluster-based language models. In Proceedings of the Twenty-Nineth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '06), pages 83–90, 2006.

[Lafferty and Lebanon, 2002 — Lafferty&Lebanon02]

John Lafferty and Guy Lebanon. Information diffusion kernels. In Proceedings of the Sixteenth Conference on Advances in Neural Information Processing Systems (NIPS 15), pages 375–382, 2002.

[Lafferty and Lebanon, 2005 — Lafferty&Lebanon05]

John Lafferty and Guy Lebanon. Diffusion kernels on statistical manifolds. Journal of Machine Learning Research, 6:129–163, January 2005.

[Langville and Meyer, 2003 — Langville&Meyer03]

Amy N. Langville and Carl D. Meyer. Deeper inside PageRank. Internet Mathematics, 1(3):335–380, 2003.

[Larson, 1996 — Larson96]

Ray R. Larson. Bibliometrics of the World Wide Web: An exploratory analysis of the intellectual structure of cyberspace. In Proceedings of the Annual Meeting of the American Society for Information Science '96: Global Complexity: Information, Chaos, and Control, 1996.

[Laskey and Myers, 2003 — Laskey&Myers03]

Kathryn B. Laskey and James W. Myers. Population Markov chain monte carlo. Machine Learning, 50(1-2):175–196, January 2003.

[Latora and Marchiori, 2002 — Latora&Marchiori02]

Vito Latora and Massimo Marchiori. Is the boston subway a small-world network?. Technical Report cond-mat/0202299, Arxiv.org, 2002.

[Lawrence and Giles, 1998a — Lawrence&Giles98b]

Steve Lawrence and C. Lee Giles. Context and page analysis for improved Web search. IEEE Internet Computing, 2(4):38–46, 1998.

[Lawrence and Giles, 1998b — Lawrence&Giles98a]

Steve Lawrence and C. Lee Giles. Searching the World Wide Web. Science, 280:98–100, April 1998.

[Lawrence and Giles, 1999a — Lawrence&Giles99a]

Steve Lawrence and C. Lee Giles. Accessibility of information on the Web. Nature, 400(6740):107–109, July 8 1999.

[Lawrence and Giles, 1999b — Lawrence&Giles99b]

Steve Lawrence and C. Lee Giles. Searching the Web: General and scientific information access. IEEE Communications, 37(1):116–122, 1999.

[Lawrence et al., 1999 — Lawrence&al.99]

Steve Lawrence, C. Lee Giles, and Kurt Bollacker. Digital libraries and autonomous citation indexing. IEEE Computer Magazine, 32(6):67–71, 1999.

[Lawrence, 2000 — Lawrence00]

Steve Lawrence. Context in Web search. IEEE Data Engineering Bulletin, 23(3):25–32, 2000.

[Lee, 2002 — Lee02]

Hyun Chul Lee. When the hyperlinked environment is perturbed. In Proceedings of the FOCS '02 First Workshop on Algorithms and Models for the Web-Graph (WAW '02), 2002.

[Lempel and Moran, 2000 — Lempel&Moran00]

Ronny Lempel and Shlomo Moran. The stochastic approach for link-structure analysis (SALSA) and the TKC effect. In Proceedings of the Ninth International Conference on the World Wide Web (WWW '00), pages 387–401, 2000.

[Lempel and Moran, 2001 — Lempel&Moran01a]

R. Lempel and S. Moran. SALSA: The stochastic approach for link-structure analysis. ACM Transactions on Information Systems, 19(2):131–160, April 2001.

[Lempel and Moran, 2003 — Lempel&Moran03]

Ronny Lempel and Shlomo Moran. Rank stability and rank similarity of link-based Web ranking algorithms in authority connected graphs. In Proceedings of the WWW '03 Second Workshop on Algorithms and Models for the Web-Graph (WAW '03), 2003.

[Lempel and Moran, 2005 — Lempel&Moran05]

R. Lempel and S. Moran. Rank-stability and rank-similarity of link-based Web ranking algorithms in authority-connected graphs. Information Retrieval, 8(2):245–264, April 2005.

[Lempel and Soffer, 2002 — Lempel&Soffer02]

Ronny Lempel and Aya Soffer. PicASHOW: Pictorial authority search by hyperlinks on the Web. ACM Transactions on Information Systems, 20(1):1–24, January 2002.

[Lenci, 2005 — Lenci05]

Marco Lenci. Recurrence for persistent random walks in two dimensions. Technical Report math/0507411, Arxiv.org, July 20, 2005.

[Lenski et al., 2003 — Lenski&al.03]

Richard E. Lenski, Charles Ofria, Robert Pennock, and Christoph Adami. The evolutionary origin of complex features. Nature, 423:139–144, May 8, 2003.

[Leskovec and Faloutsos, 2006 — Leskovec&Faloutsos06]

Jure Leskovec and Christos Faloutsos. Sampling from large graphs. In Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '06), pages 631–636, 2006.

[Leskovec et al., 2004 — Leskovec&al.04]

Jure Leskovec, Marko Grobelnik, and Natasa Milic-Frayling. Learning sub-structures of document semantic graphs for document summarization. In Proceedings of the ACM SIGKDD '04 Workshop on Link Analysis for Detecting Complex Behavior (LinkKDD '04), 2004.

[Leskovec et al., 2005a — Leskovec&al.05]

Jure Leskovec, Jon M. Kleinberg, and Christos Faloutsos. Graphs over time: Densification laws, shrinking diameters and possible explanations. In Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '05), pages 177–187, 2005.

[Leskovec et al., 2005b — Leskovec&al.05a]

Jure Leskovec, Natasa Milic-Frayling, and Marko Grobelnik. Impact of linguistic analysis on the semantic graph coverage and learning of document extracts. In Proceedings of the Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Aritificial Intelligence Conference (AAAI '05/IAAI '05), pages 1069–1074, 2005.

[Leslie and Kuang, 2004 — Leslie&Kuang04]

Christina Leslie and Rui Kuang. Fast string kernels using inexact matching for protein sequences. Journal of Machine Learning Research, 5:1435–1455, November 2004.

[Levene et al., 2002 — Levene&al.02]

Mark Levene, Trevor Fenner, George Loizou, and Richard Wheeldon. A stochastic model of evolution on the Web. Computer Networks, 39(3):277–287, June 21, 2002.

[Leydesdorff and Vaughan, 2006 — Leydesdorff&Vaughan06]

Loet Leydesdorff and Liwen Vaughan. Co-occurrence matrices and their applications in information science: Extending ACA to the web environment. Journal of the American Society for Information Science and Technology, 57(12):1616–1628, October 2006.

[Leydesdorff, 2005 — Leydesdorff05]

Loet Leydesdorff. Similarity measures, author cocitation analysis, and information theory. Journal of the American Society for Information Science and Technology, 56(7):769–772, May 2005.

[Leydesdorff, 2007 — Leydesdorff07]

Loet Leydesdorff. Visualization of the citation impact environment of scientific journals: An online mapping exercise. Journal of the American Society for Information Science and Technology, 58(1):25–38, 2007.

[Li and Liu, 2003 — Li&Liu03]

Xiaoli Li and Bing Liu. Learning to classify texts using positive and unlabeled data. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI '03), pages 587–594, 2003.

[Li and McCallum, 2006 — Li&McCallum06]

Wei Li and Andrew McCallum. Pachinko allocation: DAG-structured mixture models of topic correlations. In Proceedings of the Twenty-Third International Conference on Machine Learning (ICML '06), pages 577–584, 2006.

[Li and Meila, 2004 — Li&Meila04]

Qunhua Li and Marina Meila. Clustering by intersection-merging. Technical Report Technical Report no. 451, University of Washington Statistics, September 2004.

[Li et al., 2002 — Li&al.02]

Longzhuang Li, Yi Shang, and Wei Zhang. Improvement of HITS-based algorithms on Web documents. In Proceedings of the Eleventh International Conference on the World Wide Web (WWW '02), pages 527–535, 2002.

[Li et al., 2004 — Li&al.04]

Xiafeng Li, Derek Leonard, and Dmitri Loguinov. On reshaping of clustering coefficients in degree-based topology generators. In Proceedings of the FOCS '04 Third Workshop on Algorithms and Models for the Web-Graph (WAW '04), pages 68–79, 2004.

[Li et al., 2005 — Li&al.05]

Ying Li, Zijian Zheng, and Honghua (Kathy) Dai. Kdd cup-2005 report: Facing a great challenge. SIGKDD Explorations Newsletter, 7(2):91–99, 2005.

[Li, 1992 — Li92]

Wentian Li. Random texts exhibit Zipf's law-like word frequency distribution. IEEE Transaction on Information Theory, 38(6):1842–1845, November 1992.

[Li, 2002 — Li02]

Wentian Li. Zipf's law everywhere. Glottometrics, 5:14–21, 2002.

[Liben-Nowell and Kleinberg, 2003 — Liben-Nowell&Kleinberg03]

David Liben-Nowell and Jon Kleinberg. The link prediction problem for social networks. In Proceedings of the Twelfth International Conference on Information and Knowledge Management (ACM CIKM '03), pages 556–559, 2003.

[Liben-Nowell et al., 2005 — Liben-Nowell&al.05]

David Liben-Nowell, Jasmine Novak, Ravi Kumar, Prabhakar Raghavan, and Andrew Tomkins. Geographic routing in social networks. Proceedings of the National Academy of Sciences of the United States of America, 102(33):11623–11628, August 16, 2005.

[Licamele et al., 2005 — Licamele&al.05]

Louis Licamele, Mustafa Bilgic, Lise Getoor, and Nick Roussopoulos. Capital and benefit in social networks. In Proceedings of the ACM SIGKDD '05 Workshop on Link Discovery: Issues, Approaches and Applications (LinkKDD '05), 2005.

[Liddy, 2001 — Liddy01]

Elizabeth Liddy. How a search engine works. Searcher, 9(5), May 2001.

[Lieberman et al., 2005 — Lieberman&al.05]

Erez Lieberman, Christoph Hauert, and Martin A. Nowak. Evolutionary dynamics on graphs. Nature, 433:312–316, January 20, 2005.

[Liljeros et al., 2001 — Liljeros&al.01]

Fredrik Liljeros, Christofer R. Edling, Luis A. Nunes Amaral, H. Eugene Stanley, and Yvonne Aberg. The Web of human sexual contacts. Nature, 411(6840):907, June 21, 2001.

[Lima, 2006 — Lima06]

F. W. S. Lima. Potts model with q states on directed Barabasi-Albert networks. Technical Report cond-mat/0608137, Arxiv.org, August 5, 2006.

[Lin and Halavais, 2004 — Lin&Halavais04]

Jia Lin and Alex Halavais. Mapping the Blogosphere in America. In Proceedings of the WWW '04 First Annual Workshop on Weblogging Ecosystem: Aggregation, Analysis, and Dynamics, 2004.

[Lin and Kan, 2007 — Lin&Kan07]

Ziheng Lin and Min-Yen Kan. Unigram language models using diffusion smoothing over graphs. In TextGraphs-2: Graph-Based Algorithms for Natural Language Processing, pages 25–32, Rochester, New York, USA, 2007. Association for Computational Linguistics.

[Liu and Jin, 2005 — Liu&Jin05]

Yi Liu and Rong Jin. Query translation disambiguation as graph partitioning. In Proceedings of the Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Aritificial Intelligence Conference (AAAI '05/IAAI '05), pages 1424–1429, 2005.

[Liu et al., 2005 — Liu&al.05]

Xiaoming Liu, Johan Bollen, Michael L. Nelson, and Herbert Van de Sompel. Co-authorship networks in the digital library research community. Information Processing and Management, 41(6):1462–1480, December 2005.

[Lloyd and May, 2001 — Lloyd&May01]

Alun L. Lloyd and Robert M. May. How viruses spread among computers and people. Science, 292(5520):1316–1317, May 18, 2001.

[Long et al., 2006 — Long&al.06]

Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, and Philip S. Yu. Unsupervised learning on K-partite graphs. In Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '06), pages 317–326, 2006.

[Lorigo et al., 2004 — Lorigo&al.04]

Lori Lorigo, Jon Kleinberg, Richard Eaton, and Robert Constable. A graph-based approach towards discerning inherent structures in a digital library of formal mathematics. In Proceedings of the Third International Conference on Mathematical Knowledge Management (MKM '04), pages 220–235. Springer, 2004.

[Lotka, 1926 — Lotka26]

A. J. Lotka. The frequency distribution of scientific productivity. Journal of the Washington Academy of Science, 16(12):317–323, June 19, 1926.

[Louzoun et al., 2006 — Louzoun&al.06]

Yoram Louzoun, Lev Muchnik, and Sorin Solomon. Copying nodes versus editing links: the source of the difference between genetic regulatory networks and the www. Bioinformatics, 22(5):581–588, March 2006.

[Lovász and Vesztergombi, 2000 — Lovasz&Vesztergombi00]

László Lovász and Katalin Vesztergombi. Geometric representations of graphs. Technical Report MSR-TR-2000-47, Microsfot Research, May 2000.

[Lovász, 1993 — Lovasz93]

László Lovász. Random walks on graphs: A survey. Combinatorics, Paul Erdos is Eighty, 2:1–46, 1993.

[Lu and Getoor, 2003a — Lu&Getoor03a]

Qing Lu and Lise Getoor. Link-based classification using labeled and unlabeled data. In Proceedings of the ICML '03 Workshop on The Continuum from Labeled to Unlabeled Data in Machine Learning and Data Mining, 2003.

[Lu and Getoor, 2003b — Lu&Getoor03b]

Qing Lu and Lise Getoor. Link-based text classification. In Proceedings of the IJCAI '03 Workshop on Text Mining and Link Analysis (TextLink 2003), 2003.

[Lu et al., 2002 — Lu&al.02]

Wen-Hsiang Lu, Lee-Feng Chien, and Hsi-Jian Lee. Translation of Web queries using anchor text mining. ACM Transactions on Asian Language Information Processing, 1(2):159–172, 2002.

[Lu et al., 2004 — Lu&al.04]

Wen-Hsiang Lu, Lee-Feng Chien, and Hsi-Jian Lee. Anchor text mining for translation of Web queries: A transitive translation approach. ACM Transactions on Information Systems, 22(2):242–269, April 2004.

[Lukose and Adamic, 2003 — Lukose&Adamic03]

Rajan M. Lukose and Lada A. Adamic. Growing random networks under a diameter constraint. In Proceedings of the WWW '03 Second Workshop on Algorithms and Models for the Web-Graph (WAW '03), 2003.

[Lux and Marchesi, 1999 — Lux&Marchesi99]

Thomas Lux and Michele Marchesi. Scaling and criticality in a stochastic multi-agent model of a financial market. Nature, 397(6719):498–499, February 11, 1999.

[Luxenburger and Weikum, 2006 — Luxenburger&Weikum06]

Julia Luxenburger and Gerhard Weikum. Exploiting community behavior for enhanced link analysis and Web search. In Alin Deutsch, Wenfei Fan, and Dayou Zhou, editors, Proceedings of the SIGMOD '06 International Workshop on the Web and Databases (WebDB '06), Chicago, Illinois, USA, June 30, 2006.

[Lynch, 1997 — Lynch97]

Clifford Lynch. Searching the internet. Scientific American, 276(3):52–57, March 1997.

[Lyons and Peres, 2005 — Lyons&Peres05]

Russell Lyons and Yuval Peres. Probability on trees and networks, 2005. Online Book.

[Lyons and Tseytin, 1998 — Lyons&Tseytin98]

Donal Lyons and Gregory S. Tseytin. Phenomenal data mining and link analysis. In Proceedings of the AAAI '98 Fall Symposium on Artificial Intelligence and Link Analysis, pages 68–75, 1998.

[MacCluer, 2000 — MacCluer00]

C. R. MacCluer. The many proofs and applications of Perron's theorem. SIAM Review (SIREV), 42(3):487–498, 2000.

[Macskassy et al., 1998 — Macskassy&al.98]

Sofus Macskassy, Arunava Banerjee, Brian D. Davison, and Haym Hirsh. Human performance on clustering Web pages: A preliminary study. In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD '98), pages 264–268, 1998.

[Maggioni and Mahadevan, 2006 — Maggioni&Mahadevan06]

Mauro Maggioni and Sridhar Mahadevan. Fast direct policy evaluation using multiscale analysis of Markov diffusion processes. In Proceedings of the Twenty-Third International Conference on Machine Learning (ICML '06), pages 601–608, 2006.

[Mahadevan et al., 2006 — Mahadevan&al.06]

Priya Mahadevan, Dmitri Krioukov, Kevin Fall, and Amin Vahdat. Systematic topology analysis and generation using degree correlations. In SIGCOMM 2006, 2006.

[Malioutov and Barzilay, 2006 — malioutov-barzilay:2006:COLACL]

Igor Malioutov and Regina Barzilay. Minimum cut model for spoken lecture segmentation. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, pages 25–32, Sydney, Australia, July 2006.

[Mandelbrot, 1983 — Mandelbrot83]

Benoit B. Mandelbrot. The Fractal Geometry of Nature. Freeman, New York, 1983.

[Mandhani et al., 2003 — Mandhani&al.03]

Bhushan Mandhani, Krishna Kummamuru, and Sachindra Joshi. A matrix density based algorithm to hierarchically co-cluster documents and words. In Proceedings of the Twelfth International Conference on the World Wide Web (WWW '03), pages 511–518, 2003.

[Marchiori, 1997 — Marchiori97]

Massimo Marchiori. The quest for correct information on the Web: Hyper search engines. Computer Networks and ISDN Systems, 29(11):1225–1235, September 1997.

[Margineantu et al., 2005 — Margineantu&al.05]

Dragos Margineantu, Stephen Bay, Philip Chan, and Terran Lane. Data mining methods for anomaly detection kdd-2005 workshop report. SIGKDD Explorations Newsletter, 7(2):132–136, 2005.

[Maslov and Sneppen, 2002 — Maslov&Sneppen02a]

Sergei Maslov and Kim Sneppen. Specificity and Stability in Topology of Protein Networks. Science, 296(5569):910–913, 2002.

[Maslov and Zhang, 2001 — Maslov&Zhang01]

Sergei Maslov and Yi-Cheng Zhang. Extracting hidden information from knowledge networks. Physical Review Letters, 87(24):248701, December 10, 2001.

[Maslov et al., 2002 — Maslov&Sneppen02b]

Sergei Maslov, Kim Sneppen, and Alexei Zaliznyak. Pattern detection in complex networks: Correlation profile of the internet. Technical Report cond-mat/0205379, Arxiv.org, 2002.

[Masucci and Rodgers, 2006 — Masucci&Rodgers06]

A. P. Masucci and G. J. Rodgers. Network properties of written human language. Physical Review E, 74, August 2, 2006.

[Mat-Hassan and Levene, 2005 — MatHassan&Levene05]

Mazlita Mat-Hassan and Mark Levene. Associating search and navigation behavior through log analysis. Journal of the American Society for Information Science and Technology, 56(9):913–934, July 2005.

[Mathias and Gopal, 2001 — Mathias&Gopal01]

Nisha Mathias and Venkatesh Gopal. Small-worlds: How and why. Physical Review E, 63(2):021117, February 2001.

[Matia et al., 2005 — Matia&al.05]

Kaushik Matia, Luis A. Nunes Amaral, Marc Luwel, Henk F. Moed, and H. Eugene Stanley. Scaling phenomena in the growth dynamics of scientific output. Journal of the American Society for Information Science and Technology, 56(9):893–902, July 2005.

[Matsuo, 2002 — Matsuo02]

Yutaka Matsuo. Clustering using small world structure. In Proceedings of the Sixth International Conference on Knowledge-based Intelligent Information Engineering Systems and Applied Technologies (KES '02), pages 1252–1256, Crema, Italy, September 2002. IOS Press/Ohmsha.

[Maurer and Huberman, 2000 — Maurer&Huberman00]

Sebastian M. Maurer and Bernardo A. Huberman. Competitive dynamics of Web sites. Technical Report nLin.CD/0003041, Arxiv.org, 2000.

[May and Lloyd, 2001 — May&Lloyd01]

Robert M. May and Alun L. Lloyd. Infection dynamics on scale-free networks. Physical Review E, 64(6):066112, December 2001.

[McCain, 1992 — McCain92]

Katherine W. McCain. Core journal networks and cocitation maps in the marine sciences: tools and information management in interdisciplinary research. In Proceedings of the Annual Meeting of the American Society for Information Science '92: Celebrating Change : Information Management on the Move, pages 3–7, Pittsburgh, Pennsylvania, USA, 1992. American Society for Information Science.

[McCallum et al., 2005 — McCallum&al.05]

Andrew McCallum, Andrés Corrada-Emmanuel, and Xuerui Wang. Topic and role discovery in social networks. In Proceedings of the Ninteenth International Joint Conference on Artificial Intelligence (IJCAI '05), pages 786–791, 2005.

[McPherson et al., 2001 — McPherson&al.01]

Miller McPherson, Lynn Lovin-Smith, and James M. Cook. Birds of a feather: Homophily in social networks. Annual Review of Sociology, 27:415–444, 2001.

[McSherry, 2001 — McSherry01]

Frank McSherry. Spectral partitioning of random graphs. In Proceedings of the Forty-Second Annual Symposium on Foundations of Computer Science (FOCS '01), pages 529–537, 2001.

[McSherry, 2005 — McSherry05]

Frank McSherry. A uniform approach to accelerated PageRank computation. In Proceedings of the Fourteenth International Conference on the World Wide Web (WWW '05), pages 575–582, 2005.

[Mebane Jr., 2006 — Mebane06]

Walter R. Mebane Jr. Election forensics: Vote counts and Benford's law. Technical report, The Society for Political Methodology - Working Papers, July 18, 2006.

[Medina et al., 2000 — Medina&al.00]

Alberto Medina, Ibrahim Matta, and John Byers. On the origin of power laws in internet topologies. Computer Communications Review, 30(2):18–28, April 2000.

[Meeds et al., 2006 — Meeds&al.06]

Edward Meeds, Zoubin Ghahramani, Radford Neal, and Sam Roweis. Modeling dyadic data with binary latent features. In Proceedings of the Twentieth Conference on Advances in Neural Information Processing Systems (NIPS 19), 2006.

[Meghabghab, 2001 — Meghabghab01]

George Meghabghab. Google's Web page ranking applied to different topological Web graph structures. Journal of the American Society for Information Science and Technology, 52(9):736–747, 2001.

[Meghabghab, 2002 — Meghabghab02]

George Meghabghab. Discovering authorities and hubs in different topological Web graph structures. Information Processing and Management, 38(1):111–140, January 2002.

[Mehler, 2007 — Mehler07]

Alexander Mehler. Large text networks as an object of corpus linguistic studies. In Anke Lüdeling and Merja Kytö, editors, Corpus Linguistics. An International Handbook of the Science of Language and Society. de Gruyter, Berlin/New York, 2007.

[Meila and Shi, 2000 — Meila&Shi00]

Marina Meila and Jianbo Shi. Learning segmentation by random walks. In Proceedings of the Fourteenth Conference on Advances in Neural Information Processing Systems (NIPS 13), 2000.

[Meila and Shi, 2001 — Meila&Shi01]

Marina Meila and Jianbo Shi. A random walks view of spectral segmentation. In Thomas Richardson and Tommi Jaakkola, editors, Proceedings of the 8th International Workshop on Artificial Intelligence and Statistics (AISTATS '01), Key West, Florida, USA, January 4-7, 2001.

[Meila and Xu, 2004 — Meila&Xu04]

Marina Meila and Liang Xu. Multiway cuts and spectral clustering. Technical Report 442, University of Washington Statistics, September 2004.

[Meila et al., 2004 — Meila&al.04]

Marina Meila, Susan Shortreed, and Liang Xu. Regularized spectral learning. Technical Report 465, University of Washington Statistics, November 2004.

[Meila, 2002 — Meila02]

Marina Meila. Comparing clusterings. Technical Report 418, University of Washington Statistics, October 2002.

[Meila, 2004 — Meila04]

Marina Meila. The multicut lemma. Technical Report 451, University of Washington Statistics, September 2004.

[Meila, 2005 — Meila05]

Marina Meila. Comparing clusterings - an axiomatic view. In Proceedings of the Twenty-Second International Conference on Machine Learning (ICML '05), 2005.

[Memmesheimer and Timme, 2006 — Memmesheimer&Timme06]

Raoul-Martin Memmesheimer and Marc Timme. Designing complex networks. Physica D, 224(1-2):182–201, December 2006.

[Menczer, 1997 — Menczer97]

Filippo Menczer. ARACHNID: Adaptive retrieval agents choosing heuristic neighborhoods for information discovery. In Proceedings of the Fourteenth International Conference on Machine Learning (ICML '97), pages 227–235, 1997.

[Menczer, 2001 — Menczer01]

Filippo Menczer. Links tell us about lexical and semantic Web content. Technical Report cs.IR/0108004, Arxiv.org, August 2001.

[Menczer, 2002a — Menczer02b]

Filippo Menczer. Growing and navigating the small world Web. In Proceedings of the FOCS '02 First Workshop on Algorithms and Models for the Web-Graph (WAW '02), 2002.

[Menczer, 2002b — Menczer02a]

Filippo Menczer. Growing and navigating the small World Web by local content. Proceedings of the National Academy of Sciences of the United States of America, 99(22):14014–14019, October 29, 2002.

[Menczer, 2004a — Menczer04a]

Filippo Menczer. Combining link and content analysis to estimate semantic similarity. In Proceedings of the Thirteenth International Conference on the World Wide Web (WWW '04), pages 452–453, 2004.

[Menczer, 2004b — Menczer04c]

Filippo Menczer. Evolution of document networks. Proceedings of the National Academy of Sciences of the United States of America, 101(1):5261–5265, April 6, 2004.

[Menczer, 2004c — Menczer04b]

Filippo Menczer. Lexical and semantic clustering by Web links. Journal of the American Society for Information Science and Technology, 55(14):1261–1269, December 2004.

[Menczer, 2005 — Menczer05]

Filippo Menczer. Mapping the semantics of Web text and links. IEEE Internet Computing, 9(3):27–36, May/June 2005.

[Mendelzon and Rafiei, 2000 — Mendelzon&Rafiei00]

Alberto O. Mendelzon and Davood Rafiei. What do the neighbours think? Computing Web page reputations. IEEE Data Engineering Bulletin, 23(3):9–16, 2000.

[Mihail and Papadimitriou, 2002 — Mihail&Papadimitriou02]

Milena Mihail and Christos H. Papadimitriou. On the Eigenvalue power law. In Proceedings of the Sixth International Workshop on Randomization and Computation (RANDOM '02), 2002.

[Mihalcea and Tarau, 2004 — Mihalcea&Tarau04]

Rada Mihalcea and Paul Tarau. TextRank: Bringing order into texts. In Proceedings of the Ninth Conference on Empirical Methods in Natural Language Processing (EMNLP '04), 2004.

[Milgram, 1967 — Milgram67]

Stanley Milgram. The small world problem. Psychology Today, 1(1):60–67, 1967.

[Milo et al., 2002 — Milo&al.02]

Ron Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. Network motifs: Simple building blocks of complex networks. Science, 298(5594):824–827, 2002.

[Milo et al., 2004 — Milo&al.04]

Ron Milo, Shalev Itzkovitz, Nadav Kashtan, Reuven Levitt, Shai Shen-Orr, Inbal Ayzenshtat, Michal Sheffer, and Uri Alon. Superfamilies of evolved and designed networks. Science, 303(5663):1538–1542, March 5, 2004.

[Minkov et al., 2006 — Minkov&al.06]

Einat Minkov, William W. Cohen, and Andrew Y. Ng. Contextual search and name disambiguation in email using graphs. In Proceedings of the Twenty-Nineth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '06), pages 27–34, 2006.

[Mishra et al., 2002 — Mishra&al.02]

Nina Mishra, Dana Ron, and Ram Swaminathan. Large clusters of Web pages. In Proceedings of the FOCS '02 First Workshop on Algorithms and Models for the Web-Graph (WAW '02), 2002.

[Mitzenmacher, 2003a — Mitzenmacher03a]

Michael Mitzenmacher. A brief history of generative models for power law and lognormal distributions. Internet Mathematics, 1(2):226–251, 2003.

[Mitzenmacher, 2003b — Mitzenmacher03b]

Michael Mitzenmacher. Dynamic models for file sizes and double Pareto distributions. Internet Mathematics, 1(3):305–333, 2003.

[Mladenic and Grobelnik, 1999 — Mladenic&Grobelnik99b]

Dunja Mladenic and Marko Grobelnik. Predicting content from hyperlinks. In Proceedings of the ICML '99 Workshop on Machine Learning in Text Data Analysis, 1999.

[Mohan, 2005 — Mohan05]

Bharath Kumar Mohan. Searching association networks for nurturers. Computer, 38(10):54–60, October 2005.

[Molloy and Reed, 1995 — Molloy&Reed95]

M. Molloy and B. Reed. A critical point for random graphs with a given degree sequence. Random Structures and Algorithms, 6:161–180, 1995.

[Molloy and Reed, 1998 — Molloy&Reed98]

Michael Molloy and Bruce Reed. The size of the giant component of a random graph with a given degree sequence. Combinatorics, Probability, and Computing, 7(3):295–305, September 1998.

[Monasson, 2004 — Monasson04]

Rémi Monasson. On the analysis of backtrack procedures for the colouring of random graphs. In Eli Ben-Naim, Hans Frauenfelder, and Zoltan Toroczkai, editors, Complex Networks, pages 235–254. Springer Berlin/Heidelberg, 2004. Lecture Notes in Physics - Volume 650.

[Montemurro, 2001 — Montemurro01]

Marcelo A. Montemurro. Beyond the Zipf-Mandelbrot law in quantitative linguistics. Physica A, 300:567–578, November 2001.

[Montoya and Solé, 2001 — Montoya&Sole01]

Jose M. Montoya and Ricard V. Solé. Topological properties of food webs: From real data to community assembly models, 2001.

[Montoya and Solé, 2002 — Montoya&Sole02]

Jose M. Montoya and Ricard V. Solé. Small world patterns in food webs. Journal of Theoretical Biology, 214(3):405–412, February 7, 2002.

[Moore and Newman, 2000a — Moore&Newman00a]

Christopher Moore and Mark E. J. Newman. Epidemics and percolation in small-world networks. Physical Review E, 61(5):5678–5682, May 2000.

[Moore and Newman, 2000b — Moore&Newman00b]

Christopher Moore and Mark E. J. Newman. Exact solution of site and bond percolation on small-world networks. Physical Review E, 62(5):7059–7064, November 2000.

[Moore et al., 2006 — Moore&al.06]

Christopher Moore, Gourab Ghoshal, and Mark E. J. Newman. Exact solutions for models of evolving networks with addition and deletion of nodes. Technical Report cond-mat/0604069, Arxiv.org, April 4, 2006.

[Moore, 2003 — Moore03]

Cristopher Moore. Tutorial on complex networks. In Proceedings of the NIPS '03 Workshop on Robust Communication Dynamics in Complex Networks, 2003.

[Morelli, 2003 — Morelli03]

Luis G. Morelli. Simple model for directed networks. Physical Review E, 67(066107), 2003.

[Morris, 2000 — Morris00]

Stephen Morris. Contagion. Review of Economic Studies, 67:57–58, 2000.

[Morris, 2005 — Morris05]

Steven A. Morris. Manifestation of emerging specialties in journal literature: A growth model of papers, references, exemplars, bibliographic coupling, cocitation, and clustering coefficient distribution. Journal of the American Society for Information Science and Technology, 56(12):1250–1273, October 2005.

[Mossa et al., 2002 — Mossa&al.02]

Stefano Mossa, Marc Barthélémy, H. Eugene Stanley, and Luis A. Nunes Amaral. Truncation of power law behaviour in ``scale-free" network models due to information filtering. Physical Review Letters, 88(13):138701, March 14, 2002.

[Mosteller and Wallace, 1964 — Mosteller&Wallace64]

Frederick Mosteller and David L. Wallace. Inference and Disputed Authorship: The Federalist. Addison-Wesley, Massachusetts, 1964.

[Motter et al., 2002 — Motter&al.02]

Adilson E. Motter, Alessandro P. S. de Moura, Ying-Cheng Lai, and Partha Dasgupta. Topology of the conceptual network of language. Physical Review E, 65(065102), June 25, 2002.

[Motter et al., 2003 — Motter&al.03]

Adilson Enio Motter, Takashi Nishikawa, and Ying-Cheng Lai. Large-scale structural organization of social networks. Physical Review E, 68(036105), 2003.

[Mowshowitz and Kawaguchi, 2002 — Mowshowitz&Kawaguchi02]

Abbe Mowshowitz and Akira Kawaguchi. Assessing bias in search engines. Information Processing and Management, 38(1):141–156, January 2002.

[Mowshowitz and Kawaguchi, 2005 — Mowshowitz&Kawaguchi05]

Abbe Mowshowitz and Akira Kawaguchi. Measuring search engine bias. Information Processing and Management, 41(5):1193–1205, September 2005.

[Mukherjee and Holder, 2004 — Mukherjee&Holder04]

Maitrayee Mukherjee and Lawrence B. Holder. Graph-based data mining on social networks. In Proceedings of the ACM SIGKDD '04 Workshop on Link Analysis for Detecting Complex Behavior (LinkKDD '04), 2004.

[Mukherjee and Manna, 2006 — Mukherjee&Manna06]

G. Mukherjee and S. S. Manna. Weighted scale-free network with self-organizing link weight dynamics. Journal of Statistical Mechanics, page L05001, 2006.

[Murata, 2003 — Murata03]

Tsuyoshi Murata. Microscopic approaches for the discovery of Web communities. In Proceedings of the NIPS '03 Workshop on Robust Communication Dynamics in Complex Networks, 2003.

[Nabeshima and Gunji, 2004 — Nabeshima&Gunji04]

Terutaka Nabeshima and Yukio-Pegio Gunji. Zipf's law in phonograms and Weibull distribution in ideograms: Comparison of English with Japanese. Biosystems, 73(2):131–139, 2004.

[Najork and Weiner, 2001 — Najork&Weiner01]

Marc Najork and Janet L. Weiner. Breadth-first search crawling yields high-quality pages. In Proceedings of the Tenth International Conference on the World Wide Web (WWW '01), 2001.

[Nane, 2005 — Nane05]

Erkan Nane. Iterated Brownian motion in bounded domains in Rⁿ. Technical Report math/0505026, Arxiv.org, October 7, 2005.

[Narayanan et al., 2006 — Narayanan&al.06]

Hariharan Narayanan, Mikhail Belkin, and Partha Niyogi. On the relation between low density separation, spectral clustering and graph cuts. In Proceedings of the Twentieth Conference on Advances in Neural Information Processing Systems (NIPS 19), 2006.

[Nascimento et al., 2003 — Nascimento&al.03]

Mario A. Nascimento, Jörg Sander, and Jeffrey Pound. Analysis of SIGMOD's co-authorship graph. ACM SIGMOD Record, 32(3):8–10, September 2003.

[Nasraoui et al., 2004 — Nasraoui&al.04]

Olfa Nasraoui, Bamshad Mobasher, Brij Masand, and Bing Liu. WebKDD 2004 - Web mining and Web usage analysis post-workshopr eport. SIGKDD Explorations Newsletter, 6(2):147–151, 2004.

[Nasraoui et al., 2005 — Nasraoui&al.05]

Olfa Nasraoui, Osmar R. Zaiane, Myra Spiliopoulou, Bamshad Mobasher, Brij Masand, and Philip S. Yu. Webkdd 2005 - Web mining and Web usage analysis post-workshop report. SIGKDD Explorations Newsletter, 7(2):139–142, 2005.

[Navigli and Lapata, 2007 — Navigli&Lapata07]

Roberto Navigli and Mirella Lapata. Graph connectivity measures for unsupervised word sense disambiguation. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI '07), pages 1683–1688, 2007.

[Newby et al., 2003 — Newby&al.03]

Gregory B. Newby, Jane Greenberg, and Paul Jones. Open source software development and Lotka's Law: Bibliometric patterns in programming. Journal of the American Society for Information Science and Technology, 54(2):169–178, January 15, 2003. (doi:10.1002/asi.10177)

[Newman and Park, 2003 — Newman&Park03]

Mark E. J. Newman and Juyong Park. Why social networks are different from other types of networks. Physical Review E, 68(3):036122, September 2003.

[Newman and Watts, 1999a — Newman&Watts99a]

Mark E. J. Newman and Duncan J. Watts. Renormalization group analysis of the small-world network model. Physics Letters A, 263(5):341–346, December 6, 1999.

[Newman and Watts, 1999b — Newman&Watts99b]

Mark E. J. Newman and Duncan J. Watts. Scaling and percolation in the small-world network model. Physical Review E, 60(6):7332–7342, December 1999.

[Newman and Ziff, 2001 — Newman&Ziff01]

Mark E. J. Newman and R. M. Ziff. A fast Monte Carlo algorithm for site or bond percolation. Physical Review E, 64:016706, 2001.

[Newman et al., 2000 — Newman&al.00]

Mark E. J. Newman, Christopher Moore, and Duncan J. Watts. Mean-field solution of small-world networks. Physical Review Letters, 84(14):3201–3204, April 3, 2000.

[Newman et al., 2001 — Newman&al.01]

Mark E. J. Newman, Steven H. Strogatz, and Duncan J. Watts. Random graphs with arbitrary degree distributions and their applications. Physical Review E, 64(2):026118, July 24, 2001.

[Newman et al., 2002a — Newman&al.02a]

Mark E. J. Newman, Stephanie Forrest, and Justin Balthrop. Email networks and the spread of computer viruses. Physical Review E, 66(3):035101, September 2002.

[Newman et al., 2002b — Newman&al.02b]

Mark E. J. Newman, I. Jensen, and R. M. Ziff. Percolation and epidemics in a two-dimensional small world. Physical Review E, 65(2):021904, February 2002.

[Newman et al., 2002c — Newman&al.02]

Mark E. J. Newman, Duncan J. Watts, and S. H. Strogatz. Random graph models of social networks. Proceedings of the National Academy of Sciences of the United States of America, 99:2566–2572, February 2002. Suppl.1.

[Newman, 1987 — Newman87]

M. E. J. Newman. The mathematics of networks. In L. E. Blume and S. N. Durlauf, editors, The New Palgrave Encyclopedia of Economics, 2nd edition. Palgrave Macmillan, 1987.

[Newman, 2000a — Newman00b]

Mark E. J. Newman. Models of the small world. Journal of Statistical Physics, 101(3):819–841, November 2000.

[Newman, 2000b — Newman00a]

Mark E. J. Newman. Small worlds: The structure of social networks. Technical Report cond-mat/0001118, Arxiv.org, 2000.

[Newman, 2001a — Newman01b]

Mark E. J. Newman. Clustering and preferential attachment in growing networks. Physical Review E, 64(2):025102, August 2001.

[Newman, 2001b — Newman01c]

Mark E. J. Newman. Ego-centered networks and the ripple effect, or why all your friends are weird. Technical Report cond-mat/0104209, Arxiv.org, 2001.

[Newman, 2001c — Newman01d]

Mark E. J. Newman. Exact solutions of epidemic models on networks, 2001.

[Newman, 2001d — Newman01a]

Mark E. J. Newman. The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences of the United States of America, 98(2):404–409, 2001.

[Newman, 2001e — Newman01e]

Mark E. J. Newman. Who is the best connected scientist? a study of scientific coauthorship networks. part i. network construction and fundamental results. Physical Review E, 64(1):016131, July 2001.

[Newman, 2001f — Newman01f]

Mark E. J. Newman. Who is the best connected scientist? a study of scientific coauthorship networks. part ii. shortest paths, weighted networks, and centrality. Physical Review E, 64(1):016131, July 2001.

[Newman, 2002a — Newman02c]

Mark E. J. Newman. Assortative mixing in networks. Technical Report cond-mat/0205405, Arxiv.org, 2002.

[Newman, 2002b — Newman02a]

Mark E. J. Newman. Random graphs as models of networks. Technical Report cond-mat/0202208, Arxiv.org, 2002.

[Newman, 2002c — Newman02b]

Mark E. J. Newman. The spread of epidemic disease on networks. Physical Review E, 66(16):016128, July 2002.

[Newman, 2003a — Newman03b]

M. E. J. Newman. Mixing patterns in networks. Physical Review E, 67(2):026126, February 2003.

[Newman, 2003b — Newman03]

Mark E. J. Newman. A measure of betweenness centrality based on random walks. Technical Report cond-mat/0309045, Arxiv.org, 2003.

[Newman, 2003c — Newman03a]

Mark E. J. Newman. The structure and function of complex networks. SIAM Review, 45(2):167–256, 2003.

[Newman, 2004a — Newman04a]

Mark E. J. Newman. Analysis of weighted networks. Physical Review E, 70:056131, 2004.

[Newman, 2004b — Newman04]

Mark E. J. Newman. Who is the best connected scientist? a study of scientific coauthorship networks. In Eli Ben-Naim, Hans Frauenfelder, and Zoltan Toroczkai, editors, Complex Networks, pages 337–370. Springer Berlin/Heidelberg, 2004. Lecture Notes in Physics - Volume 650.

[Newman, 2005 — Newman05]

Mark E. J. Newman. Power laws, Pareto distributions and Zipf's law. Contemporary Physics, 46(5):323–351, December 2005.

[Newman, 2006a — Newman06]

Mark E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. Technical Report physics/0605087, Arxiv.org, July 23, 2006.

[Newman, 2006b — Newman06a]

Mark E. J. Newman. Modularity and community structure in networks. Proceedings of the National Academy of Sciences of the United States of America, 103(23):8577–8582, June 6, 2006.

[Ng et al., 2001a — Ng&al.01a]

Andrew Y. Ng, Michael I. Jordan, and Yair Weiss. On spectral clustering: Analysis and an algorithm. In Proceedings of the Fifteenth Conference on Advances in Neural Information Processing Systems (NIPS 14), pages 849–856, 2001.

[Ng et al., 2001b — Ng&al.01b]

Andrew Y. Ng, Alice X. Zheng, and Michael I. Jordan. Link analysis, eigenvectors and stability. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI '01), pages 903–910, 2001.

[Ng et al., 2001c — Ng&al.01c]

Andrew Y. Ng, Alice X. Zheng, and Michael I. Jordan. Stable algorithms for link analysis. In Proceedings of the Twenty-Fourth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '01), pages 258–266, 2001.

[Nie et al., 2005 — Nie&al.05]

Zaiqing Nie, Yuanzhi Zhang, Ji-Rong Wen, and Wei-Ying Ma. Object-level ranking: Bringing order to Web objects. In Proceedings of the Fourteenth International Conference on the World Wide Web (WWW '05), pages 567–574, 2005.

[Nie et al., 2006 — Nie&al.06]

Lan Nie, Brian D. Davison, and Xiaoguang Qi. Topical link analysis for web search. In Proceedings of the Twenty-Nineth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '06), pages 91–98, 2006.

[Nigam and Ghani, 2000 — Nigam&Ghani00]

Kamal Nigam and Rayid Ghani. Analyzing the effectiveness and applicability of co-training. In Proceedings of the Ninth International Conference on Information and Knowledge Management (ACM CIKM '00), pages 86–93, 2000.

[Nigam et al., 1999 — Nigam&al.99a]

Kamal Nigam, John Lafferty, and Andrew McCallum. Using maximum entropy for text classification. In Proceedings of the IJCAI '99 Workshop on Machine Learning for Information Filtering, 1999.

[Nigam et al., 2000 — Nigam&al.99b]

Kamal Nigam, Andrew Kachites McCallum, Sebastian Thrun, and Tom Mitchell. Text classification from labeled and unlabeled documents using EM. Machine Learning, 39(2-3):103–134, 2000.

[Nikiforov, 2005 — Nikiforov05]

Vladimir Nikiforov. Walks and the spectral radius of graphs. Technical Report math/0506259, Arxiv.org, June 13, 2005.

[Noble and Cook, 2003 — Noble&Cook03]

Caleb Noble and Diane Cook. Graph-based anomaly detection. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '03), pages 631–636, 2003.

[Norén and Orre, 2005 — Noren&Orre05]

G. Niklas Norén and Roland Orre. Case based imprecision estimates for Bayes classifiers with the Bayesian bootstrap. Machine Learning, 58(1):79–94, January 2005.

[Novak et al., 2004 — Novak&al.04]

Jasmine Novak, Prabhakar Raghavan, and Andrew Tomkins. Anti-aliasing on the Web. In Proceedings of the Thirteenth International Conference on the World Wide Web (WWW '04), pages 30–39, 2004.

[Nowak et al., 2000 — Nowak&al.00]

Martin A. Nowak, Joshua B. PLotkin, and Vincent A. A. Jansen. The evolution of syntactic communication. Nature, 404:495–498, March 30, 2000.

[Nowak et al., 2002 — Nowak&al.02]

Martin A. Nowak, Natalia L. Komarova, and Partha Niyogi. Computational and evolutionary aspects of language. Nature, 417:611–617, June 6, 2002.

[Ntoulas et al., 2004 — Ntoulas&al.04]

Alexandros Ntoulas, Junghoo Cho, and Christopher Olston. What's new on the Web?: The evolution of the Web from a search engine perspective. In Proceedings of the Thirteenth International Conference on the World Wide Web (WWW '04), pages 1–12, 2004.

[Odintsova and Rish, 2003 — Odintsova&Rish03]

Natalia Odintsova and Irina Rish. Fault diagnosis in random and scale-free networks. In Proceedings of the NIPS '03 Workshop on Robust Communication Dynamics in Complex Networks, 2003.

[Oliveira and Barabási, 2005 — Oliveira&Barabasi05]

João Gama Oliveira and Albert-László Barabási. Darwin and Einstein correspondance patterns. Nature, 437(27):1251–1252, October 2005.

[Oltvai and Barabási, 2002 — Oltvai&Barabasi02]

Zoltan N. Oltvai and Albert-László Barabási. SYSTEMS BIOLOGY: Life's Complexity Pyramid. Science, 298(5594):763–764, 2002.

[O'Madadhain and Smyth, 2005 — O'Madadhain&Smyth05]

Joshua O'Madadhain and Padhraic Smyth. EventRank: A framework for ranking time-varying networks. In Proceedings of the ACM SIGKDD '05 Workshop on Link Discovery: Issues, Approaches and Applications (LinkKDD '05), 2005.

[O'Madadhain et al., 2005a — O'Madadhain&al.05b]

Joshua O'Madadhain, Danyel Fisher, Tom Nelson, Jens Krefeldt, Scott White, and Yan-Biao Boey. JUNG: Java Universal Network/Graph framework, 2005.

[O'Madadhain et al., 2005b — O'Madadhain&al.05a]

Joshua O'Madadhain, Jon Hutchins, and Padhraic Smyth. Prediction and ranking algorithms for event-based network data. SIGKDD Explorations Newsletter, 7(2):23–30, 2005.

[O'Neill et al., 1997 — O'Neill&al.97]

Edward T. O'Neill, Patrick D. McClain, and Brian F. Lavoie. A methodology for sampling the world wide Web. Annual Review of OCLC Research, 1997.

[Onnela et al., 2007 — Onnela&al.07]

Jukka-Pekka Onnela, Jari Saramäki, Jörkki Hyvönen, Gábor Szabó, M. Argollo de Menezes, Kimmo Kaski, Albert-László Barabási, and János Kertész. Analysis of a large-scale weighted network of one-to-one human communication. Submitted, 2007.

[Otterbacher et al., 2005 — otterbacher-erkan-radev:2005:HLTEMNLP]

Jahna Otterbacher, Güne c s Erkan, and Dragomir Radev. Using random walks for question-focused sentence retrieval. In Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing, pages 915–922, Vancouver, British Columbia, Canada, October 2005. Association for Computational Linguistics.

[Özgür and Bingol, 2004 — Ozgur&Bingol04]

Arzucan Özgür and Haluk Bingol. Social network of co-occurrence in news articles. In Proceedings of the Nineteenth International Symposium on Computer and Information Sciences (ISCIS '04), pages 688–695, 2004.

[Ozmutlu and Çavdur, 2005 — Ozmutlu&Cavdur05]

H. Cenk Ozmutlu and Fatih Çavdur. Application of automatic topic identification on Excite Web search engine data logs. Information Processing and Management, 41(5):1243–1262, September 2005.

[Paepcke et al., 2000 — Paepcke&al.00]

Andreas Paepcke, Hector Garcia-Molina, Gerard Rodríguez-Mulá, and Junghoo Cho. Beyond document similarity: Understanding value-based search and browsing technologies. ACM SIGMOD Record, 29(1):80–92, March 2000.

[Page et al., 1998 — Page&al.98]

L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the Web. Technical report, Stanford Digital Libary Technologies Project, January 29, 1998.

[Pal and Bagchi, 2005 — Pal&Bagchi05]

Sukomal Pal and Aditya Bagchi. Association against dissociation: some pragmatic considerations for frequent itemset generation under fixed and variable thresholds. SIGKDD Explorations Newsletter, 7(2):151–159, 2005.

[Palmer et al., 2002 — Palmer&al.02]

C. Palmer, P. Gibbons, and C. Faloutsos. ANF: A fast and scalable tool for data mining in massive graphs. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '02), 2002.

[Pandurangan et al., 2002 — Pandurangan&al.02]

Gopal Pandurangan, Prabhakara Raghavan, and Eli Upfal. Using page rank to characterize Web structure. In Proceedings of the Eighth International Computing and Combinatorics Conference (COCOON '02), 2002.

[Pang and Lee, 2004 — pang-lee:2004:ACL]

Bo Pang and Lillian Lee. A sentimental education: Sentiment analysis using subjectivity summarization based on minimum cuts. In Proceedings of the 42nd Meeting of the Association for Computational Linguistics (ACL'04), Main Volume, pages 271–278, Barcelona, Spain, July 2004.

[Pant et al., 2003 — Pant&al.03]

Gautam Pant, Padmini Srinivasan, and Filippo Menczer. Crawling the Web. In M. Levene and A. Poulovassilis, editors, Web Dynamics. Springer-Verlag, 2003.

[Papa and Markov, 2006 — Papa&Markov06]

David A. Papa and Igor L. Markov. Hypergraph partitioning and clustering. In Teofilo F. Gonzalez, editor, Handbook of Approximation Algorithms and Metaheuristics, volume 10 of Computer and Information Science Series, chapter 61. Chapman & Hall/CRC Press, 2006.

[Papadimitriou et al., 2000 — Papadimitriou&al.00]

Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, and Santosh Vempala. Latent semantic indexing: A probabilistic analysis. JCSS: Journal Of Computer and System Sciences, 61(2):217–235, October 2000.

[Papineni, 2001 — Papineni01]

Kishore Papineni. Why inverse document frequency?. In Proceedings of the Seventh Conference of Applied Natural Language Processing and the Second Meeting of the North American Chapter of the Association for Computational Linguistics (ANLP '01/NAACL '01), pages 25–32, 2001.

[Pareto, 1897 — Pareto1897]

Vilfredo Pareto. Cours d'économie politique professé á l'université de Lausanne, 1897.

[Park and Newman, 2004 — Park&Newman04]

Juyong Park and Mark E. J. Newman. The statistical mechanics of networks. Physical Review E, 70:066117, 2004.

[Park and Newman, 2005 — Park&Newman05]

Juyong Park and Mark E. J. Newman. A network-based ranking system for US college football. Journal of Statistical Mechanics: Theory and Experiment, 2005.

[Park, 2003 — Park03]

Han Woo Park. Hyperlink network analysis: A new method for the study of social structure on the Web. Connections, 25(1):49–61, 2003.

[Parker, 2003 — Parker03]

Albert Parker. Phase transitions in the information distortion. In Proceedings of the NIPS '03 Workshop on Information Theory and Learning: The Bottleneck and Information Distortion Approach, 2003.

[Parthasarathy et al., 2005 — Parthasarathy&al.05]

Srinivasan Parthasarathy, Wei Wang, and Mohammed Zaki. Biokdd 2005 workshop report. SIGKDD Explorations Newsletter, 7(2):129–131, 2005.

[Pastor-Satorras and Vespignani, 2000 — Pastor-Satorras&Vespignani00]

Romualdo Pastor-Satorras and Alessandro Vespignani. Epidemic searching in scale-free networks. Physical Review Letters, 86(14):3200–3203, April 2, 2000.

[Pastor-Satorras and Vespignani, 2001 — Pastor-Satorras&Vespignani01]

Romualdo Pastor-Satorras and Alessandro Vespignani. Epidemic dynamics and endemic states in complex networks. Physical Review E, 63(6):066117, June 2001.

[Pastor-Satorras and Vespignani, 2002a — Pastor-Satorras&Vespignani02a]

Romualdo Pastor-Satorras and Alessandro Vespignani. Epidemic dynamics in finite size scale-free networks. Physical Review E, 65(3):035108, March 2002.

[Pastor-Satorras and Vespignani, 2002b — Pastor-Satorras&Vespignani02c]

Romualdo Pastor-Satorras and Alessandro Vespignani. Epidemics and immunization in scale-free networks. Technical Report cond-mat/0205260, Arxiv.org, 2002.

[Pastor-Satorras and Vespignani, 2002c — Pastor-Satorras&Vespignani02b]

Romualdo Pastor-Satorras and Alessandro Vespignani. Immunization of complex-networks. Physical Review E, 65(3):036104, March 2002.

[Pastor-Satorras et al., 2001 — Pastor-Satorras&al.01]

Romualdo Pastor-Satorras, Alexei Vázquez, and Alessandro Vespignani. Dynamical and correlation properties of the internet. Physical Review Letters, 87(25):258701, December 17, 2001.

[Pastor-Satorras et al., 2002 — Pastor-Satorras&al.02]

Romualdo Pastor-Satorras, Eric Smith, and Ricard V. Solé. Evolving protein interaction networks through gene duplication, 2002.

[Pastor-Satorras et al., 2004 — Pastor-Satorras&al.04]

Romualdo Pastor-Satorras, Alexei Vázquez, and Alessandro Vespignani. Topology, hierarchy, and correlations in Internet graphs. In Eli Ben-Naim, Hans Frauenfelder, and Zoltan Toroczkai, editors, Complex Networks, pages 425–440. Springer Berlin/Heidelberg, 2004. Lecture Notes in Physics - Volume 650.

[Patrikainen and Meila, 2005 — Patrikainen&Meila05]

Anne Patrikainen and Marina Meila. Spectral clustering for Microsoft Netscan data. Technical Report Working Paper no. 49, Center for Statistics and the Social Sciences at the University of Washington, July 2005.

[Pauly and Stergiou, 2005 — Pauly&Stergiou05]

Daniel Pauly and Konstantinos I. Stergiou. Equivalence of results from two citation analyses: Thomson ISI's citation index and Google's Scholar service. Ethics in Science and Environmental Politics, pages 33–35, December 22, 2005.

[Payne and Thelwall, 2005 — Payne&Thelwall05]

Nigel Payne and Mike Thelwall. Mathematical models for academic webs: Linear relationship or non-linear power law?. Information Processing and Management, 41(6):1495–1510, December 2005.

[Pechter, 2005 — Pechter05]

Rick Pechter. Data mining standards, services and platforms 2005 workshop report. SIGKDD Explorations Newsletter, 7(2):137–138, 2005.

[Pennock et al., 2002 — Pennock&al.02]

David M. Pennock, Gary W. Flake, Steve Lawrence, Eric J. Glover, and C. Lee Giles. Winners don't take all: Characterizing the competition for links on the Web. Proceedings of the National Academy of Sciences of the United States of America, 99(8):5207–5211, April 16, 2002.

[Pereira et al., 1993 — Pereira&al.93]

Fernando Pereira, Naftali Tishby, and Lillian Lee. Distributional clustering of English words. In Proceedings of the Thirty-First Annual Meeting of the Association for Computational Linguistics (ACL '93), pages 183–190, 1993.

[Perkowitz et al., 2004 — Perkowitz&al.04]

Mike Perkowitz, Matthai Philipose, Kenneth Fishkin, and Donald J. Patterson. Mining models of human activities from the Web. In Proceedings of the Thirteenth International Conference on the World Wide Web (WWW '04), pages 573–582, 2004.

[Perline, 1996 — Perline96]

Richard Perline. Zipf's law, the central limit theorem, and the random division of the unit interval. Physical Review E, 54(1):220–223, 1996.

[Philips et al., 1990 — Philips&al.90]

T. K. Philips, D. F. Towsley, and J. K. Wolf. On the diameter of a class of random graphs. IEEE Transaction on Information Theory, 36(2):285–288, 1990.

[Piatetsky-Shapiro, 2005 — Piatetsky-Shapiro05]

Gregory Piatetsky-Shapiro. Interview with usama fayyad, yahoo chief data officer. SIGKDD Explorations Newsletter, 7(2):84–90, 2005.

[Pimm et al., 1991 — Pimm&al.91]

Stuart L. Pimm, John Lawton, and Joel Cohen. Food Web patterns and their consequences. Nature, 350(6320):669–674, April 25, 1991.

[Pioch et al., 2004 — Pioch&al.04]

Nicholas J. Pioch, Daniel Hunter, James V. White, Amy Kao, Daniel Bostwick, and Eric K. Jones. Multi-hypothesis abductive reasoning for link discovery. In Proceedings of the ACM SIGKDD '04 Workshop on Link Analysis for Detecting Complex Behavior (LinkKDD '04), 2004.

[Plachouras and Ounis, 2004 — Plachouras&Ounis04]

Vassilis Plachouras and Iadh Ounis. Usefulness of hyperlink structure for query-biased topic distillation. In Proceedings of the Twenty-Seventh Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '04), pages 448–455, 2004.

[Popescul and Ungar, 2003 — Popescul&Ungar03]

Alexandrin Popescul and Lyle H. Ungar. Structural logistic regression for link analysis. In Proceedings of the ACM SIGKDD '03 Workshop on Multi-Relational Data Mining (MRDM '03), 2003.

[Popescul et al., 2001 — Popescul&al.01]

Alexandrin Popescul, Lyle H. Ungar, David M. Pennock, and Steve Lawrence. Probabilistic models for unified collaborative and content-based recommendation in sparse-data environments. In Proceedings of the Seventeenth Annual Conference on Uncertainty in Artificial Intelligence (UAI '01), pages 437–444. Morgan Kaufmann Publishers, 2001.

[Porter et al., 2005 — Porter&al.05]

Mason A. Porter, Peter J. Mucha, Mark E. J. Newman, and Casey M. Warmbrand. A network analysis of committees in the U. S. House of Representatives. Proceedings of the National Academy of Sciences of the United States of America, 102(20):7057–7062, 2005.

[Porter et al., 2006 — Porter&al.06]

Mason A. Porter, Peter J. Mucha, Mark E. J. Newman, and Casey M. Warmbrand. Community structure in the United States House of Representatives. Technical Report physics/0602033, Arxiv.org, February 4, 2006.

[Press, 2004 — AssociatedPress04]

The Associated Press. Better search results than Google?. CNN.com, January 5, 2004.

[Price and Thelwall, 2005 — Price&Thelwall05]

Liz Price and Mike Thelwall. The clustering power of low frequency words in academic webs. Journal of the American Society for Information Science and Technology, 56(8):883–888, June 2005.

[Prime-Claverie et al., 2004 — Prime-Claverie&al.04]

Camille Prime-Claverie, Michael Beigbeder, and Thierry Lafouge. Transposition of the cocitation method with a view to classifying Web pages. Journal of the American Society for Information Science and Technology, 55(14):1282–1289, December 2004.

[Przytycka and Yu, 2004 — Przytycka&Yu04]

Teresa Przytycka and Yi-Kuo Yu. Divergent evolutionary drift contradicts power law. In Proceedings of the Twelfth International Conference on Intelligent Systems for Molecular Biology and the Third European Conference on Computational Biology (ISMB '04/ECCB '04), 2004.

[Pumain, 2003 — Pumain03]

Denise Pumain. Scaling laws and urban systems. Technical report, Working Papers of Santa Fe Institute, 04-02-002, August 2003.

[Puniyani and Lukose, 2001 — Puniyani&Lukose01]

Amit R. Puniyani and Rajan M. Lukose. Growing random networks under constraints. Technical Report cond-mat/0107391, Arxiv.org, 2001.

[Puniyani et al., 2001 — Puniyani&al.01]

Amit R. Puniyani, Rajan M. Lukose, and Bernardo A. Huberman. Intentional walks on scale-free small worlds. Technical Report cond-mat/0107212, Arxiv.org, 2001.

[Qamra et al., 2006 — Qamra&al.06]

A. Qamra, B. Tseng, and E. Chang. Mining blog stories using community-based and temporal clustering. In Proceedings of the Fifteenth International Conference on Information and Knowledge Management (ACM CIKM '06), 2006.

[Qi and Davison, 2006 — Qi&Davison06]

X. Qi and B. Davison. Knowing a web page by the company it keeps. In Proceedings of the Fifteenth International Conference on Information and Knowledge Management (ACM CIKM '06), 2006.

[Qin et al., 2005 — Qin&al.05]

Tao Qin, Tie-Yan Liu, Xu-Dong Zhang, Zheng Chen, and Wei-Ying Ma. A study of relevance propagation for Web search. In Proceedings of the Twenty-Eighth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '05), 2005.

[Quinn et al., 2006 — Quinn&al.06]

Kevin M. Quinn, Burt L. Monroe, Michael Colaresi, Michael H. Crespin, and Dragomir R. Radev. An automated method of topic-coding legislative speech over time with application to the 105th-108th U. S. Senate. Technical report, The Society for Political Methodology - Working Papers, July 18, 2006.

[Rabbat and Nowak, 2006 — Rabbat&al.06]

Michael G. Rabbat and Mário A.T. Figueiredo Robert D. Nowak. Inferring network structure from co-occurrences. In Proceedings of the Twentieth Conference on Advances in Neural Information Processing Systems (NIPS 19), 2006.

[Radev et al., 2005 — Radev&al.05]

Dragomir Radev, Weiguo Fan, Hong Qi, Harris Wu, and Amardeep Grewal. Probabilistic question answering on the web. Journal of the American Society for Information Science and Technology, 56(6):571–583, April 2005.

[Radev, 2004 — Radev04]

Dragomir R. Radev. Weakly supervised graph-based methods for classification. UMich CSE Tech Report CSE-TR-500-04, December 2004.

[Radicchi et al., 2004 — Radicchi&al.04]

Filippo Radicchi, Claudio Castellano, Federico Cecconi, Vittorio Loreto, and Domenico Parisi. Defining and identifying communities in networks. Proceedings of the National Academy of Sciences of the United States of America, 101:2658–2663, 2004.

[Rafiei and Mendelzon, 2000 — Rafiei&Mendelzon00]

Davood Rafiei and Alberto O. Mendelzon. What is this page known for? Computing Web page reputations. Proceedings of the Ninth International Conference on the World Wide Web (WWW '00), 33(1–6):823–835, June 2000.

[Raghavan et al., 2004 — Raghavan&al.04]

Hema Raghavan, James Allan, and Andrew McCallum. An exploration of entity models, collective classification and relation description. In Proceedings of the ACM SIGKDD '04 Workshop on Link Analysis for Detecting Complex Behavior (LinkKDD '04), 2004.

[Raghavan et al., 2006 — Raghavan&al.06]

Hema Raghavan, Omid Madani, and Rosie Jones. Active learning with feedback on both features and instances. Journal of Machine Learning Research, 7:1655–1686, 2006.

[Raghavan, 2005 — Raghavan05]

Pradhakar Raghavan. Incentive networks. In Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '05), page 1, 2005.

[Rahm and Thor, 2005 — Rahm&Thor05]

Erhard Rahm and Andreas Thor. Citation analysis of database publications. ACM SIGMOD Record, 34(4):48–53, Debember 2005.

[Ramakrishnan et al., 2005 — Ramakrishnan&al.05]

Cartic Ramakrishnan, William H. Milnor, Matthew Perry, and Amit P. Sheth. Discovering informative connection subgraphs in multi-relational graphs. SIGKDD Explorations Newsletter, 7(2):56–63, 2005.

[Randall et al., 2001 — Randall&al.01]

K. Randall, R. Stata, R. Wickremesinghe, and J. Wiener. The link database: Fast access to graphs of the Web. Technical Report Research Report 175, Compaq Systems Research Center, Palo Alto, CA, 2001.

[Ranzato et al., 2006 — Ranzato&al.06]

Marc'Aurelio Ranzato, Christopher Poultney, Sumit Chopra, and Yann LeCun. Efficient learning of sparse representations with an energy-based model. In Proceedings of the Twentieth Conference on Advances in Neural Information Processing Systems (NIPS 19), 2006.

[Ratnasamy et al., 2002 — Ratnasamy&al.02]

Sylvia Ratnasamy, Scott Shenker, and Ion Stoica. Routing algorithms for dhts: Some open questions. In 1st International Workshop on Peer-to-Peer Systems (IPTPS), 2002.

[Rattigan and Jensen, 2005 — Rattigan&Jensen05]

Matthew J. Rattigan and David Jensen. The case for anomalous link discovery. SIGKDD Explorations Newsletter, 7(2):41–47, 2005.

[Rattigan et al., 2006 — Rattigan&al.06]

Matthew J. Rattigan, Marc Maier, and David Jensen. Using structure indices for efficient approximation of network properties. In Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '06), pages 357–366, 2006.

[Rattigan et al., 2007 — Rattigan&al.07]

Matthew J. Rattigan, Marc Maier, and David Jensen. Graph clustering with network structure indices. In Proceedings of the Twenty-fourth International Conference on Machine Learning (ICML '07), 2007.

[Ravasz and Barabasi, 2003 — Ravasz&Barabasi03]

Erzsebet Ravasz and Albert-Laszlo Barabasi. Hierarchical organization in complex networks. Physical Review E, 67:026112, 2003.

[Ravasz et al., 2002 — Ravasz&al.02]

E. Ravasz, A. L. Somera, D. A. Mongru, Z. N. Oltvai, and A. L. Barabási. Hierarchical organization of modularity in metabolic networks. Science, 297(5586):1551–1555, August 30, 2002.

[Redner, 1998 — Redner94]

S. Redner. How popular is your paper? An empirical study of the citation distribution. European Physical Journal B, 4(2):131–134, 1998.

[Rennie and McCallum, 1999 — Rennie&McCallum99]

Jason Rennie and Andrew K. McCallum. Using reinforcement learning to spider the Web efficiently. In Proceedings of the ICML '99 Workshop on Machine Learning in Text Data Analysis, pages 335–343, 1999.

[Resig et al., 2004 — Resig&al.04]

John Resig, Santosh Dawara, Christopher M. Homan, and Ankur Teredesai. Extracting social networks from instant messaging populations. In Proceedings of the ACM SIGKDD '04 Workshop on Link Analysis for Detecting Complex Behavior (LinkKDD '04), 2004.

[Resnick et al., 1994 — Resnick&al.94]

Paul Resnick, Neophytos Iacovou, Mitesh Suchak, Peter Bergstrom, and John Riedl. GroupLens: An open architecture for collaborative filtering of netnews. In Proceedings of the 1994 ACM Conference on Computer Supported Cooperative Work (CSCW '94), pages 175–186, 1994.

[Richardson and Domingos, 2002a — Richardson&Domingos02a]

Mathew Richardson and Pedro Domingos. The intelligent surfer: Probabilistic combination of link and content information in PageRank. In Proceedings of the Sixteenth Conference on Advances in Neural Information Processing Systems (NIPS 15), 2002.

[Richardson and Domingos, 2002b — Richardson&Domingos02b]

Matthew Richardson and Pedro Domingos. Mining knowledge-sharing sites for viral marketing. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD '02), pages 61–70, 2002.

[Richardson et al., 2006 — Richardson&al.06]

Matthew Richardson, Amit Prakash, and Eric Brill. Beyond PageRank: Machine learning for static ranking. In Proceedings of the Fifteenth International Conference on the World Wide Web (WWW '06), pages 707–715, 2006.

[Ripeanu et al., 2002 — Ripeanu&al.02]

Matei Ripeanu, Ian Foster, and Adriana Iamnitchi. Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing, 6(1):50–57, January/February 2002.

[Robins et al., 2005 — Robins&al.05]

Garry Robins, Philippa Pattison, and Jodie Woolcock. Small and other worlds: Global network structures from local processes. American Journal of Sociology, 110(4):894–936, January 2005.

[Roeck et al., 2005 — Roeck&al.05]

Anne De Roeck, Avik Sarkar, and Paul H. Garthwaite. Even very frequent function words do not distribute homogeneously. In Proceedings of the Fifth International Conference on Recent Advances in Natural Language Processing (RANLP '05), 2005.

[Roelleke, 2003 — Roelleke03]

Thomas Roelleke. A frequency-based and a Poisson-based definition of the probability of being informative. In Proceedings of the Twenty-Sixth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '03), pages 227–234, 2003.

[Rose et al., 1990 — Rose&al.90]

K. Rose, E. Gurewitz, and G. Fox. Statistical mechanics and phase transitions in clustering. Physical Review Letters, 65(8):945–848, February 15, 1990.

[Rosvall and Sneppen, 2003 — Rosvall&Sneppen03]

Martin Rosvall and Kim Sneppen. Modeling dynamics of information networks. In Proceedings of the NIPS '03 Workshop on Robust Communication Dynamics in Complex Networks, 2003.

[Rousseau and Zuccala, 2004 — Rousseau&Zuccala04]

Ronald Rousseau and Alesia Zuccala. A classification of author co-citations: Definitions and search strategies. Journal of the American Society for Information Science and Technology, 55(6):513–529, April 2004.

[Rousseau, 1994 — Rousseau94]

Ronald Rousseau. Bradford curves. Information Processing and Management, 30(2):267–277, March-April 1994.

[Ruan and Zhang, 2006 — Ruan&Zhang06]

Jianhua Ruan and Weixiong Zhang. Identification and evaluation of weak community structures in networks. In Proceedings of the Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Aritificial Intelligence Conference (AAAI '06/IAAI '06), 2006.

[Rusmevichientong et al., 2001 — Rusmevichientong&al.01]

P. Rusmevichientong, D. M. Pennock, S. Lawrence, and C. L. Giles. Methods for sampling pages uniformly from the World Wide Web. In In AAAI Fall Symposium on Using Uncertainty Within Computation, pages 121–128, 2001.

[Saerens and Fouss, 2005 — Saerens&Fouss05]

Marco Saerens and Francois Fouss. HITS is principal components analysis. In Jiming Liu, Pierre Morizet-Mahoudeaux, Andrzej Skowron, and Ning Zhong, editors, Proceedings of the 2005 IEEE/WIC/ACM Joint International Conference on Web Intelligence and Intelligent Agent Technology (WI '05/IAT '05), pages 782–785, Compiègne, France, September 19-22, 2005. IEEE Computer Society.

[Sahami and Heilman, 2006 — Sahami&Heilman06]

Mehran Sahami and Timothy D. Heilman. A web-based kernel function for measuring the similarity of short text snippets. In Proceedings of the Fifteenth International Conference on the World Wide Web (WWW '06), pages 377–386, 2006.

[Salakhutdinov et al., 2007 — Salakhutdinov&al.07]

Ruslan Salakhutdinov, Andriy Mnih, and Geoffrey Hinton. Spectral clustering and transductive learning with multiple views. In Proceedings of the Twenty-fourth International Conference on Machine Learning (ICML '07), 2007.

[Sander et al., 2003 — Sander&al.03]

L. M. Sander, C. P. Warren, and I. M. Sokolov. Epidemics, disorder, and percolation. Technical Report cond-mat/0301394, Arxiv.org, January 21, 2003.

[Sarkar and Moore, 2005 — Sarkar&Moore05]

Purnamrita Sarkar and Andrew W. Moore. Dynamic social network analysis using latent space models. SIGKDD Explorations Newsletter, 7(2):31–40, 2005.

[Sarkar et al., 2005 — Sarkar&al.05]

Avik Sarkar, Paul H Garthwaite, and Anne DeRoeck. A Bayesian mixture model for term re-occurrence and burstiness. In In The Ninth Conference on Computational Natural Language Learning (CoNLL), pages 48–55, Ann Arbor, Michigan, USA, 2005. Association for Computational Linguistics.

[Sarshar et al., 2004 — Sarshar&al.04]

Nima Sarshar, P. Oscar Boykin, and Vwani Roychowdhury. Scalable percolation search in power law networks. Technical Report cond-mat/0406152, Arxiv.org, June 7, 2004.

[Sarukkai, 2000 — Sarukkai00]

Ramesh Sarukkai. Link prediction and path analysis using Markov chains. In Proceedings of the Ninth International Conference on the World Wide Web (WWW '00), 2000.

[Schaeffer, 2003 — Schaeffer03b]

Satu Elisa Schaeffer. Stochastic online clustering for massive graphs. In Proceedings of the NIPS '03 Workshop on Robust Communication Dynamics in Complex Networks, 2003.

[Schneider, 2003 — Schneider03]

Jeff Schneider. Link detection and searching for terrorist threat activity. In Proceedings of the IJCAI '03 Workshop on Text Mining and Link Analysis (TextLink 2003), 2003.

[Scott, 1979 — Scott79]

John Scott. Social Network Analysis: A Handbook. Sage Publications, London, 1979.

[Seeley, 1949 — Seeley49]

John R. Seeley. The net of reciprocal influence. Canadian Journal of Psychology, 3(4):234–240, 1949.

[Sen and Hansen, 2003 — Sen&Hansen03]

Rituparna Sen and Mark H. Hansen. Predicting Web users' next access based on log data. Journal of Computational and Graphical Statistics, 12(1):143–155, March 2003.

[Senator, 2005 — Senator05]

Ted E. Senator. Link mining applications: Progress and challenges. SIGKDD Explorations Newsletter, 7(2):76–83, 2005.

[Senellart and Blondel, 2003 — Senellart&Blondel03]

Pierre P. Senellart and Vincent D. Blondel. Automatic discovery of similar words. In Michael W. Berry, editor, A Comprehensive Survey of Text Mining. Springer-Verlag, 2003.

[Serrano et al., 2006 — Serrano&al.06]

M. Angeles Serrano, Ana Maguitman, Marian Boguna, Santo Fortunato, and Alessandro Vespignani. Decoding the structure of the WWW: Facts versus sampling biases. Technical Report cs.NI/0511035, Arxiv.org, 2006.

[Shakery and Zhai, 2006 — Shakery&Zhai06]

A. Shakery and C. Zhai. A probabilistic relevance propagation model for hypertext retrieval. In Proceedings of the Fifteenth International Conference on Information and Knowledge Management (ACM CIKM '06), 2006.

[Shalizi, 2001 — Shalizi01]

Cosma Rohilla Shalizi. CSSS 2000-2001 math review lectures: Probability, statistics and stochastic processes. Technical report, Santa Fe Institute Complex Systems Summer School, 2001. http://www.cscs.umich.edu/ crshalizi/prob-notes/.

[Shan, 2005 — Shan05]

Shi Shan. On the generalized Zipf distribution. Part I. Information Processing and Management, 41(6):1369–1386, December 2005.

[Shaparenko et al., 2005 — Shaparenko&al.05]

Benyah Shaparenko, Rich Caruana, Johannes Gehrke, and Thorsten Joachims. Identifying temporal patterns and key players in document collections. In Proceedings of the IEEE ICDM 05' Workshop on Temporal Data Mining: Algorithms, Theory and Applications (TDM-05), pages 165–174, 2005.

[Shardanand and Maes, 1995 — Shardanand&Maes95]

Upendra Shardanand and Pattie Maes. Social information filtering: Algorithms for automating ``word of mouth". In Proceedings of the ACM/SIGCHI 1995 Conference on Human Factors in Computing Systems, pages 210–217, Denver, Colorado, United States, 1995. ACM Press/Addison-Wesley Publishing Co.

[Shen et al., 2005 — Shen&al.05]

Dou Shen, Rong Pan, Jian-Tao Sun, Jeffrey Junfeng Pan, Kangheng Wu, Jie Yin, and Qiang Yang. Q textsuperscript 2c@ust: Our winning solution to query classification in KDDCUP 2005. SIGKDD Explorations Newsletter, 7(2):100–110, 2005.

[Shen et al., 2006 — Shen&al.06a]

Dou Shen, Jian-Tao Sun, Qiang Yang, and Zheng Chen. A comparison of implicit and explicit links for web page classification. In Proceedings of the Fifteenth International Conference on the World Wide Web (WWW '06), pages 643–650, 2006.

[Shetty and Adibi, 2005 — Shetty&Adibi05]

Jitesh Shetty and Jafar Adibi. Discovering important nodes through graph entropy - the case of Enron email database. In Proceedings of the ACM SIGKDD '05 Workshop on Link Discovery: Issues, Approaches and Applications (LinkKDD '05), 2005.

[Shin and Zhang, 2000 — Shin&Zhang00]

H.-J. Shin and B.-T. Zhang. Extracting topic words and clustering documents by probabilistic graphical models. In Proceedings of the ACM SIGKDD '00 Workshop on Text Mining, 2000.

[Shore and Johnson, 1980 — Shore&Johnson80]

John E. Shore and Rodney W. Johnson. Axiomatic derivation of the principle of maximum entropy and the principle of minium cross-entropy. IEEE Transaction on Information Theory, 26(1):26–37, January 1980.

[Shrager et al., 1987 — Shrager&al.87]

Jeff Shrager, Tad Hogg, and Bernardo A. Huberman. Observation of phase transitions in spreading activation networks. Science, 236:1092–1094, May 1987.

[Sidiropoulos and Manolopoulos, 2005 — Sidiropoulos&Manolopoulos05]

Antonis Sidiropoulos and Yannis Manolopoulos. A new perspective to automatically rank scientific conferences using digital libraries. Information Processing and Management, 41(2):289–312, March 2005.

[Sigman and Cecchi, 2002 — Sigman&Cecchi02]

Mariano Sigman and Guillermo A. Cecchi. Global organization of the Wordnet lexicon. Proceedings of the National Academy of Sciences of the United States of America, 99(3):1742–1747, February 5, 2002.

[Silagadze, 1997 — Silagadze97]

Z. Silagadze. Citations and the Zipf-Mandelbrot's law. Complex Systems, 11(487–499), 1997.

[Silverstein et al., 1999 — Silverstein&al.99]

C. Silverstein, Monika Henzinger, H. Marais, and M. Moricz. Analysis of a very large AltaVista query log. SIGIR Forum, 33(1):6–12, 1999.

[Simon, 1955 — Simon55]

Herbert A. Simon. On a class of skew distribution functions. Biometrika, 42(4):425–440, December 1955.

[Simon, 1957 — Simon57]

Herbert A. Simon. Models of Man. Wiley, New York, 1957.

[Slanina and Kotrla, 2000 — Slanina&Kotrla00]

Frantisek Slanina and Miroslav Kotrla. Random networks created by biological evolution. Physical Review Letters E, 62(5):6170–6177, November 2000.

[Slonim et al., 2005 — Slonim&al.05]

Noam Slonim, Gurinder Singh Atwal, Ga u sper Tka u cik, and William Bialek. Information-based clustering. Proceedings of the National Academy of Sciences of the United States of America, 102(51):18297–18302, December 20, 2005.

[Small, 1973 — Small73]

Henry Small. Co-citation in the scientific literature: A new measure of the relationship between two documents. Journal of the American Society for Information Science, 24:265–269, 1973.

[Smucker and Allan, 2006 — Smucker&Allan06]

Mark D. Smucker and James Allan. Find-similar: Similarity browsing as a search tool. In Proceedings of the Twenty-Nineth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '06), pages 461–468, 2006.

[Smyth, 2003 — Smyth03]

Padhraic Smyth. Statistical modeling of graph and network data. In Proceedings of the IJCAI '03 Workshop on Learning Statistical Models from Relational Data, 2003.

[Soares et al., 2005 — Soares&al.05]

M. Medeiros Soares, G. Corso, and L.S. Lucena. The network of syllables in Portuguese. Physica A, 355:678–684, 2005.

[Soboroff, 2002 — Soboroff02]

Ian Soboroff.