Analysis of weighted networks.

The connections in many networks are not merely binary entities, either present or not, but have associated weights that record their strengths relative to one another. Recent studies of networks have, by and large, steered clear of such weighted networks, which are often perceived as being harder to analyze than their unweighted counterparts. Here we point out that weighted networks can in many cases be analyzed using a simple mapping from a weighted network to an unweighted multigraph, allowing us to apply standard techniques for unweighted graphs to weighted ones as well. We give a number of examples of the method, including an algorithm for detecting community structure in weighted networks and a simple proof of the maximum-flow-minimum-cut theorem.

[1]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[2]  K. Menger Zur allgemeinen Kurventheorie , 1927 .

[3]  D J PRICE,et al.  NETWORKS OF SCIENTIFIC PAPERS. , 1965, Science.

[4]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[5]  D. Sade,et al.  Sociometrics of Macaca mulatta. I. Linkages and cliques in grooming matrices. , 1972, Folia primatologica; international journal of primatology.

[6]  P. Bonacich Factoring and weighting approaches to status scores and clique identification , 1972 .

[7]  M. Fiedler Algebraic connectivity of graphs , 1973 .

[8]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[9]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[10]  P. Bonacich Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

[11]  阿部 浩一,et al.  Fundamenta Mathematicae私抄 : 退任の辞に代えて , 1987 .

[12]  John Scott What is social network analysis , 2010 .

[13]  Noah E. Friedkin,et al.  Theoretical Foundations for Centrality Measures , 1991, American Journal of Sociology.

[14]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[15]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[16]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[17]  S. Redner How popular is your paper? An empirical study of the citation distribution , 1998, cond-mat/9804163.

[18]  M. KleinbergJon Authoritative sources in a hyperlinked environment , 1999 .

[19]  A. Barabasi,et al.  Weighted evolving networks. , 2001, Physical review letters.

[20]  S N Dorogovtsev,et al.  Language as an evolving word web , 2001, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[21]  S. Strogatz Exploring complex networks , 2001, Nature.

[22]  Ramon Ferrer i Cancho,et al.  The small world of human language , 2001, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[23]  Andrew G. Glen,et al.  APPL , 2001 .

[24]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[25]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[27]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[28]  Partha Dasgupta,et al.  Topology of the conceptual network of language. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  Heiko Rieger,et al.  Stability of shortest paths in complex networks with random edge weights. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  D. Mason,et al.  Compartments revealed in food-web structure , 2003, Nature.

[31]  B. Tadić Exploring Complex Graphs by Random Walks , 2003, cond-mat/0310014.

[32]  Fang Wu,et al.  Finding communities in linear time: a physics approach , 2003, ArXiv.

[33]  Karl Johan Åström,et al.  Modeling of Complex Systems , 2003 .

[34]  E Almaas,et al.  Scaling properties of random walks on small-world networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[35]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[36]  Alessandro Vespignani,et al.  Weighted evolving networks: coupling topology and weight dynamics. , 2004, Physical review letters.

[37]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[38]  M. A. Muñoz,et al.  Journal of Statistical Mechanics: An IOP and SISSA journal Theory and Experiment Detecting network communities: a new systematic and efficient algorithm , 2004 .

[39]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[40]  Steven R. Corman,et al.  Dynamic analysis of news streams: institutional versus environmental effects. , 2004, Nonlinear dynamics, psychology, and life sciences.

[41]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

[42]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[43]  A. Vespignani,et al.  The architecture of complex weighted networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[44]  Pekka Orponen,et al.  Efficient Algorithms for Sampling and Clustering of Large Nonuniform Networks , 2004 .

[45]  G. Caldarelli,et al.  Detecting communities in large networks , 2004, cond-mat/0402499.

[46]  Andrei Z. Broder,et al.  Workshop on Algorithms and Models for the Web Graph , 2007, WAW.