1370 references, last updated Wed May 7 22:09:45 2008

[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, 2003a — adamic&Eytan03]
Lada Adamic and Eytan Adar. Friends and neighbors on the web. Social Networks, 25(3):211–230, 2003.
[Adamic and Adar, 2003b — 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 et al., 2007 — Ladamic&al.07]
Lada A Adamic, K Suresh, and Xiaolin Shi. Scatter networks: a new approach for analysing information scatter. New Journal of Physics, 9(231), 2007.
[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 et al., 2005 — Adar&al.05]
Eytan Adar, Li Zhang, Lada Adamic, and Rajan M. Lukose. Implicit structure in the dynamics of the blogsphere. In WWW 2005: 2nd Annual Workshop on the Weblogging Ecosystem, 2005.
[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.
[Adar, 2007 — Adar07]
Eytan Adar. User 4xxxxx9: Anonymizing query logs. In Einat Amitay, Craig G. Murray, and Jaime Teevan, editors, Query Log Analysis: Social And Technological Challenges. A workshop at the 16th International World Wide Web Conference (WWW 2007), May 2007.
[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.
[Ali-Hasan and Adamic, 2007 — Ali-Hasan&Adamic07]
Noor Ali-Hasan and Lada Adamic. Expressing social relationships on the blog through links and comments. In International Conference on Weblogs and Social Media, Boulder, Colorado, USA, 2007.
[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 and Barabasi, 2004 — Almaas&Barabasi04]
E. Almaas and A. L. Barabasi. Power laws in biological networks, 2004.
[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.
[An et al., 2004 — An&al.04]
Yuan An, Jeannette Janssen, and Evangelos E. Milios. Characterizing and mining the citation graph of the computer science literature. Knowl. Inf. Syst., 6(6):664–678, 2004. (doi:10.1007/s10115-003-0128-3)
[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.
[Andersen et al., 2007a — Andersen&al.07a]
Reid Andersen, Christian Borgs, Jennifer Chayes, John Hopcroft, Vahab Mirrokni, and Shanghua Teng. Local computation of pagerank contributions. In Workshop On Algorithms And Models For The Web-Graph (WAW2007), 2007.
[Andersen et al., 2007b — Andersen&al.07b]
Reid Andersen, Fan Chung Graham, and Kevin Lang. Local partitioning for directed graphs using pagerank. In Workshop On Algorithms And Models For The Web-Graph (WAW2007), 2007.
[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.
[Antonakis and Lalive, 2008 — Antonakis&Lalive08]
John Antonakis and Rafael Lalive. Quantifying scholarly impact: Iqp versus the hirsch h. J. Am. Soc. Inf. Sci. Technol., 59(6):956–969, 2008.
[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., 2001 — Arasu&al.01]
Arvind Arasu, Junghoo Cho, Hector Garcia-Molina, Andreas Paepcke, and Sriram Raghavan. Searching the web. ACM Trans. Inter. Tech., 1(1):2–43, 2001.
[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.
[Arcaute et al., 2007 — Arcaute&al.07]
Esteban Arcaute, Ning Chen, Ravi Kumar, David Liben-Nowell, Mohammad Mahdian, Hamid Nazerzadeh, and Ying Xu. Deterministic decentralized search in random graphs. In Workshop On Algorithms And Models For The Web-Graph (WAW2007), 2007.
[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.
[Avrachenkov et al., 2007 — Avrachenkov&al.07]
Konstantin Avrachenkov, Nelly Litvak, and Kim Son Pham. Distribution of pagerank mass among principle components of the web. In Workshop On Algorithms And Models For The Web-Graph (WAW2007), 2007.
[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.
[Backstrom et al., 2008 — Backstrom&al.08]
L. Backstrom, J. Kleinberg, R. Kumar, and J. Novak. Spatial variation in search engine queries. In Proc. 17th Intl. World Wide Web Conference, 2008.
[Bader et al., 2007 — Bader&al.07]
David A. Bader, Shiva Kintali, Kamesh Madduri, and Milena Mihail. Approximating betweenness centrality. In Workshop On Algorithms And Models For The Web-Graph (WAW2007), 2007.
[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.
[Baeza-Yates et al., 2007 — Baeza-Yates&al.07]
Ricardo Baeza-Yates, Carlos Hurtado, and Marcelo Mendoza. Improving search engines by query clustering. Journal of the American Society for Information Science and Technology, 58(12):1793–1804, 2007.
[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, 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.
[Bales and Johnson, 2006 — Bales&Johnson06]
Michael E. Bales and Stephen B. Johnson. Graph theoretic modeling of large-scale semantic networks. J. of Biomedical Informatics, 39(4):451–464, 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.
[Banerjee et al., 2004 — Banerjee&al.04]
Arindam Banerjee, Inderjit Dhillon, Joydeep Ghosh, Srujana Merugu, and Dharmendra S. Modha. A generalized maximum entropy approach to bregman co-clustering and matrix approximation. In KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 509–514, New York, NY, USA, 2004. ACM.
[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 and Bonabeau, 2003 — Barbarasi&Bonabeau03]
A. L. Barabási and E. Bonabeau. Scale-free networks. Sci Am, 288(5):60–69, May 2003.
[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, 2005a — 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.
[Barabási, 2005b — Barabasi05a]
Albert-László Barabási. Network theory-the emergence of the creative enterprise. SCIENCE, 308(2):639–641, April 2005.
[Barab'asi, 2005c — Barbarasi05]
Albert-L'aszl&o Barab'asi. The origin of bursts and heavy tails in human dynamics, May 2005.
[Barbour and Reinert, 2001 — Barbour&Reinert01]
A. D. Barbour and Gesine Reinert. Small worlds. Random Structures and Algorithms, 19(1):54–74, 2001.
[Barjak et al., 2007 — Barjak&al.07]
Franz Barjak, Xuemei Li, and Mike Thelwall. Which factors explain the web impact of scientists' personal homepages?. J. Am. Soc. Inf. Sci. Technol., 58(2):200–211, 2007. (doi:10.1002/asi.v58:2)
[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., 2006a — Becchetti&al.06a]
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.
[Becchetti et al., 2006b — Becchetti&al.06b]
Luca Becchetti, Carlos Castillo, Debora Donato Ricardo Baeza-Yates, and Stefano Leonardi. Link analysis for web spam detection. In Workshop On Algorithms And Models For The Web-Graph (WAW2006), page 5, 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., 2004 — Belkin&al.04b]
Mikhail Belkin, Irina Matveeva, and Partha Niyogi. Regularization and semi-supervised learning on large graphs. In COLT2004, 2004.
[Belkin et al., 2006a — 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.
[Belkin et al., 2006b — Belkin&al]
Mikhail Belkin, Partha Niyogi, and Vikas Sindhwani. Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. J. Mach. Learn. Res., 7:2399–2434, 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.
[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.
[Bernat Corominas-Murtra and Solé, 2007 — Corominas-Murtra&al.07]
Sergi Valverde Bernat Corominas-Murtra and Ricard V. Solé. The ontogeny of scale-free syntax networks through language acquisition. Technical report, Santa Fe Institute, 2007.
[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.
[Biemann, 2006a — 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.
[Biemann, 2006b — biemann:2006:SRW]
Chris Biemann. Unsupervised part-of-speech tagging employing efficient graph clustering. In Proceedings of the COLING/ACL 2006 Student Research Workshop, pages 7–12, Sydney, Australia, July 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.
[Blanchard and Krueger, 2003 — Blanchard&Krueger03]
Ph Blanchard and T. Krueger. The "cameo principle" and the origin of scale-free graphs in social networks, 2003.
[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.
[Borgs et al., 2007 — Borgs&al07]
Christian Borgs, Jennifer Chayes, Constantinos Daskalakis, and Sebastien Roch. First to market is not everything: an analysis of preferential attachment with fitness. In STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 135–144, New York, NY, USA, 2007. ACM. (doi:10.1145/1250790.1250812)
[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.
[Bornmann et al., 2008 — Bornmann&al.08]
Lutz Bornmann, Rüdiger Mutz, and Hans-Dieter Daniel. Are there better indices for evaluation purposes than the h index? a comparison of nine different variants of the h index using data from biomedicine. J. Am. Soc. Inf. Sci. Technol., 59(5):830–837, 2008.
[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.
[Bradonjic et al., 2007 — Bradonjic&al.07]
Milan Bradonjic, Aric Hagberg, and Allon Percus. Giant component and connectivity in geographical threshold graphs. In Workshop On Algorithms And Models For The Web-Graph (WAW2007), 2007.
[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.
[Brooks and Montanez, 2006 — Brooks&Montanez06]
Christopher H. Brooks and Nancy Montanez. Improved annotation of the blogosphere via autotagging and hierarchical clustering. In WWW '06: Proceedings of the 15th international conference on World Wide Web, pages 625–632, New York, NY, USA, 2006. ACM Press.
[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.
<