Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality.
暂无分享,去创建一个
[1] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[2] Michael P. Giannetto,et al. The Man Who Loved Only Numbers , 2005 .
[3] Olle Persson,et al. Studying research collaboration using co-authorships , 1996, Scientometrics.
[4] Olle Persson,et al. Locating the network of interacting authors in scientific specialties , 1995, Scientometrics.
[5] Hildrun Kretschmer,et al. Coauthorship networks of invisible colleges and institutionalized communities , 1994, Scientometrics.
[6] D. Watts. The “New” Science of Networks , 2004 .
[7] Mark E. J. Newman,et al. The Structure and Function of Complex Networks , 2003, SIAM Rev..
[8] S. S. Manna,et al. Small-world properties of the Indian railway network. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[9] Duncan J. Watts,et al. Six Degrees: The Science of a Connected Age , 2003 .
[10] Walter Willinger,et al. The origin of power laws in Internet topologies revisited , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[11] Ian T. Foster,et al. Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design , 2002, ArXiv.
[12] Stephanie Forrest,et al. Email networks and the spread of computer viruses. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[13] S H Strogatz,et al. Random graph models of social networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.
[14] S. Bornholdt,et al. Scale-free topology of e-mail networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[15] A. Barabasi,et al. Evolution of the social network of scientific collaborations , 2001, cond-mat/0104162.
[16] H. B. O'Connell. Physicists Thriving with Paperless Publishing , 2000, physics/0007040.
[17] Joao Antonio Pereira,et al. Linked: The new science of networks , 2002 .
[18] Jerrold W. Grossman,et al. The evolution of the mathematical research collaboration graph , 2002 .
[19] J. Moody. Race, School Integration, and Friendship Segregation in America1 , 2001, American Journal of Sociology.
[20] B. Wellman. Computer Networks As Social Networks , 2001, Science.
[21] M. Newman,et al. Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.
[22] M E Newman,et al. Scientific collaboration networks. I. Network construction and fundamental results. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.
[23] K. Goh,et al. Universal behavior of load distribution in scale-free networks. , 2001, Physical review letters.
[24] U. Brandes. A faster algorithm for betweenness centrality , 2001 .
[25] M. Newman. Clustering and preferential attachment in growing networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.
[26] Lada A. Adamic,et al. Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.
[27] S. Strogatz. Exploring complex networks , 2001, Nature.
[28] S. Redner,et al. Organization of growing random networks. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.
[29] M. Newman,et al. Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.
[30] M. Newman,et al. The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.
[31] Jeffery R. Westbrook,et al. A Functional Approach to External Graph Algorithms , 1998, Algorithmica.
[32] S. N. Dorogovtsev,et al. Structure of growing networks with preferential linking. , 2000, Physical review letters.
[33] Eli Upfal,et al. Stochastic models for the Web graph , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[34] Mark Newman,et al. Models of the Small World , 2000 .
[35] A. Barabasi,et al. Error and attack tolerance of complex networks , 2000, Nature.
[36] M. Newman,et al. Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.
[37] Cohen,et al. Resilience of the internet to random breakdowns , 2000, Physical review letters.
[38] Andrei Z. Broder,et al. Graph structure in the Web , 2000, Comput. Networks.
[39] M. Newman,et al. Efficient Monte Carlo algorithm and high-precision results for percolation. , 2000, Physical review letters.
[40] S. Redner,et al. Connectivity of growing random networks. , 2000, Physical review letters.
[41] Vladimir Batagelj,et al. Some analyses of Erdős collaboration graph , 2000, Soc. Networks.
[42] L. Amaral,et al. Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.
[43] M. Newman,et al. Exact solution of site and bond percolation on small-world networks. , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.
[44] M. Newman,et al. Epidemics and percolation in small-world networks. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.
[45] M. Newman,et al. Mean-field solution of the small-world network model. , 1999, Physical review letters.
[46] Stroud,et al. Exact results and scaling properties of small-world networks , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.
[47] S. N. Dorogovtsev,et al. Exactly solvable small-world network , 1999, cond-mat/9907445.
[48] M. D. Menezes,et al. First-order transition in small-world networks , 1999, cond-mat/9903426.
[49] U. Brandes. Faster Evaluation of Shortest-Path Based Centrality Indices , 2000 .
[50] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[51] Michalis Faloutsos,et al. On power-law relationships of the Internet topology , 1999, SIGCOMM '99.
[52] A. Barabasi,et al. Mean-field theory for scale-free random networks , 1999, cond-mat/9907068.
[53] C. Moukarzel. Spreading and shortest paths in systems with sparse long-range connections. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.
[54] M. Weigt,et al. On the properties of small-world network models , 1999, cond-mat/9903411.
[55] M. Newman,et al. Renormalization Group Analysis of the Small-World Network Model , 1999, cond-mat/9903357.
[56] L. Amaral,et al. Small-World Networks: Evidence for a Crossover Picture , 1999, cond-mat/9903108.
[57] Gobinda G. Chowdhury,et al. A bibliometric analysis of collaboration in the field of Information Retrieval , 1998 .
[58] Bruce A. Reed,et al. The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.
[59] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[60] S. Redner. How popular is your paper? An empirical study of the citation distribution , 1998, cond-mat/9804163.
[61] G. Davis,et al. Corporate Elite Networks and Governance Changes in the 1980s , 1997, American Journal of Sociology.
[62] Henry Kautz,et al. Combining social networks and collaborative ?ltering , 1997 .
[63] Bruce A. Reed,et al. A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.
[64] Jerrold W. Grossman,et al. A portion of the well-known collaboration graph , 1995 .
[65] John F. Padgett,et al. Robust Action and the Rise of the Medici, 1400-1434 , 1993, American Journal of Sociology.
[66] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[67] Per O. Seglen,et al. The Skewness of Science , 1992, J. Am. Soc. Inf. Sci..
[68] P. Gács,et al. Algorithms , 1992 .
[69] Jean Tague-Sutcliffe,et al. An Introduction to Informetrics , 1992, Inf. Process. Manag..
[70] John Scott. Social Network Analysis , 1988 .
[71] P. Killworth,et al. Studying social relations cross-culturally , 1988 .
[72] Miranda Lee Pao,et al. An empirical examination of Lotka's Law , 1986, J. Am. Soc. Inf. Sci..
[73] P. Erdos,et al. On the evolution of random graphs , 1984 .
[74] Béla Bollobás,et al. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..
[75] J. Galaskiewicz,et al. Interorganizational resource networks: Formal patterns of overlap , 1978 .
[76] M. Kochen,et al. Contacts and influence , 1978 .
[77] Leonard M. Freeman,et al. A set of measures of centrality based upon betweenness , 1977 .
[78] Mark Kac,et al. The ideal Bose-Einstein gas, revisited , 1977 .
[79] Henry Voos. Lotka and information science , 1974, J. Am. Soc. Inf. Sci..
[80] Sharon L. Milgram,et al. The Small World Problem , 1967 .
[81] R. Keith,et al. A Handbook , 2006 .
[82] D J PRICE,et al. NETWORKS OF SCIENTIFIC PAPERS. , 1965, Science.
[83] Thomas J. Fararo,et al. A study of a biased friendship net , 1964 .
[84] A RAPOPORT,et al. A study of a large sociogram. , 2007 .
[85] P. Erdös,et al. The Gaussian Law of Errors in the Theory of Additive Number Theoretic Functions , 1940 .
[86] Alfred J. Lotka,et al. The frequency distribution of scientific productivity , 1926 .