KPS 2007 (April 19, 2007) On spectral density of scale-free networks Doochul Kim (Department of Physics and Astronomy, Seoul National University) Collaborators:

Slides:



Advertisements
Similar presentations
Dynamics of Social Interactions at Short Timescales G. Bianconi Department of Physics, Northeastern University SAMSI Workshop: Dynamics of networks SAMSI,
Advertisements

ETC Trento Workshop Spectral properties of complex networks
School of Information University of Michigan Network resilience Lecture 20.
Dynamic Bayesian Networks (DBNs)
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Information Networks Generative processes for Power Laws and Scale-Free networks Lecture 4.
Advanced Topics in Data Mining Special focus: Social Networks.
Fractality vs self-similarity in scale-free networks The 2 nd KIAS Conference on Stat. Phys., 07/03-06/06 Jin S. Kim, K.-I. Goh, G. Salvi, E. Oh and D.
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
Hierarchy in networks Peter Náther, Mária Markošová, Boris Rudolf Vyjde : Physica A, dec
Scale-free networks Péter Kómár Statistical physics seminar 07/10/2008.
The structure of the Internet. How are routers connected? Why should we care? –While communication protocols will work correctly on ANY topology –….they.
Alon Arad Alon Arad Hurst Exponent of Complex Networks.
Discover a Network by Walking on it! Andrea Asztalos & Zoltán Toroczkai Department of Physics University of Notre Dame Department of Physics University.
ONR MURI: NexGeNetSci From Consensus to Social Learning in Complex Networks Ali Jadbabaie Skirkanich Associate Professor of innovation Electrical & Systems.
Complex networks and random matrices. Geoff Rodgers School of Information Systems, Computing and Mathematics.
Advanced Topics in Data Mining Special focus: Social Networks.
The structure of the Internet. How are routers connected? Why should we care? –While communication protocols will work correctly on ANY topology –….they.
The structure of the Internet. The Internet as a graph Remember: the Internet is a collection of networks called autonomous systems (ASs) The Internet.
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
The Erdös-Rényi models
Information Networks Power Laws and Network Models Lecture 3.
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
GRAPH Learning Outcomes Students should be able to:
Traceroute-like exploration of unknown networks: a statistical analysis A. Barrat, LPT, Université Paris-Sud, France I. Alvarez-Hamelin (LPT, France) L.
Soon-Hyung Yook, Sungmin Lee, Yup Kim Kyung Hee University NSPCS 08 Unified centrality measure of complex networks.
Popularity versus Similarity in Growing Networks Fragiskos Papadopoulos Cyprus University of Technology M. Kitsak, M. Á. Serrano, M. Boguñá, and Dmitri.
Graph Theoretic Concepts. What is a graph? A set of vertices (or nodes) linked by edges Mathematically, we often write G = (V,E)  V: set of vertices,
Percolation in self-similar networks Dmitri Krioukov CAIDA/UCSD M. Á. Serrano, M. Boguñá UNT, March 2011.
GRAPHS CSE, POSTECH. Chapter 16 covers the following topics Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component,
TCP Traffic and Congestion Control in ATM Networks
Expanders via Random Spanning Trees R 許榮財 R 黃佳婷 R 黃怡嘉.
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
1 CE 530 Molecular Simulation Lecture 6 David A. Kofke Department of Chemical Engineering SUNY Buffalo
Average Consensus Distributed Algorithms for Multi-Agent Networks Instructor: K. Sinan YILDIRIM.
A Graph-based Friend Recommendation System Using Genetic Algorithm
International Workshop on Complex Networks, Seoul (23-24 June 2005) Vertex Correlations, Self-Avoiding Walks and Critical Phenomena on the Static Model.
Part 1: Biological Networks 1.Protein-protein interaction networks 2.Regulatory networks 3.Expression networks 4.Metabolic networks 5.… more biological.
October Large networks: a new language for science László Lovász Eötvös Loránd University, Budapest
自旋玻璃与消息传递算法 Spin Glass and Message-Passing Algorithms 周海军 中国科学院理论物理研究所.
Soon-Hyung Yook, Sungmin Lee, Yup Kim Kyung Hee University NSPCS 08 Unified centrality measure of complex networks: a dynamical approach to a topological.
Physics of Flow in Random Media Publications/Collaborators: 1) “Postbreakthrough behavior in flow through porous media” E. López, S. V. Buldyrev, N. V.
Markov Cluster (MCL) algorithm Stijn van Dongen.
Andreas Papadopoulos - [DEXA 2015] Clustering Attributed Multi-graphs with Information Ranking 26th International.
Workshop on Optimization in Complex Networks, CNLS, LANL (19-22 June 2006) Application of replica method to scale-free networks: Spectral density and spin-glass.
Percolation and diffusion in network models Shai Carmi, Department of Physics, Bar-Ilan University Networks Percolation Diffusion Background picture: The.
The generalization of Bayes for continuous densities is that we have some density f(y|  ) where y and  are vectors of data and parameters with  being.
Percolation in self-similar networks PRL 106:048701, 2011
GRAPHS. Graph Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component, spanning tree Types of graphs: undirected,
Equilibrium statistical mechanics of network structures Physica A 334, 583 (2004); PRE 69, (2004); cond-mat ; cond-mat Thanks to:
Properties of Growing Networks Geoff Rodgers School of Information Systems, Computing and Mathematics.
Condensation in/of Networks Jae Dong Noh NSPCS08, 1-4 July, 2008, KIAS.
Transport in weighted networks: optimal path and superhighways Collaborators: Z. Wu, Y. Chen, E. Lopez, S. Carmi, L.A. Braunstein, S. Buldyrev, H. E. Stanley.
Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”
Network Science K. Borner A.Vespignani S. Wasserman.
Statistical Mechanics and Multi-Scale Simulation Methods ChBE
Chapter 6: Basic Methods & Results of Statistical Mechanics
1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.
Response network emerging from simple perturbation Seung-Woo Son Complex System and Statistical Physics Lab., Dept. Physics, KAIST, Daejeon , Korea.
ICTP School and Workshop on Structure and Function of complex Networks (16-28 May 2005) Structural correlations and critical phenomena of random scale-free.
Weighted Networks IST402 – Network Science Acknowledgement: Roberta Sinatra Laszlo Barabasi.
Networks interacting with matter Bartlomiej Waclaw Jagellonian University, Poland and Universität Leipzig, Germany.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
Network (graph) Models
Random Walk for Similarity Testing in Complex Networks
Shan Lu, Jieqi Kang, Weibo Gong, Don Towsley UMASS Amherst
Random walks on complex networks
3.3 Network-Centric Community Detection
Shan Lu, Jieqi Kang, Weibo Gong, Don Towsley UMASS Amherst
Presentation transcript:

KPS 2007 (April 19, 2007) On spectral density of scale-free networks Doochul Kim (Department of Physics and Astronomy, Seoul National University) Collaborators: Byungnam Kahng (SNU), Geoff. J. Rodgers (Brunel, UK)

KPS 2007 (April 19, 2007) Outline I. I.Introduction II. II.Matrices of Interest III. III.An Equilibrium Ensemble of Scale-Free Graphs – The Static Model IV. IV.Replica Method: General formalism V. V.Spectral Densities in the Dense Graph Limit VI. VI.Summary and Discussion

KPS 2007 (April 19, 2007) I.Introduction introduction Many real world networks are scale-free…

KPS 2007 (April 19, 2007) Internet is a network Nodes: Routers for IR network, Autonomous Systems for AS network Links: physical lines introduction

KPS 2007 (April 19, 2007) introduction Internet is scale-free Evolution of degree distribution of AS

KPS 2007 (April 19, 2007) introduction Internet is scale-free Load (or Betweenness Centrality) distribution of AS, AS+ and IR networks Load (or Betweenness Centrality) distribution of AS, AS+ and IR networks

KPS 2007 (April 19, 2007) There are many more examples that are scale-free approximately….. Information networks (WWW) Biological networks (Protein interaction network) Social network (Collaboration Network) introduction

KPS 2007 (April 19, 2007) introduction We consider sparse, undirected, simple graphs (no self-loops, no multiple bonds) with N nodes and L links (2L/N=p). Degree of a vertex i: SF degree distribution: = adjacency matrix with element 1 if connected and 0 otherwise introduction

KPS 2007 (April 19, 2007) introduction Spectral properties of matrices defined on such scale-free networks are of interest. For theoretical treatment, one needs to take averages of dynamic quantities over an ensemble of graphs. One can apply the replica method to obtain the spectral density of a class of scale-free networks, in the dense graph limit after the thermodynamic limit.

KPS 2007 (April 19, 2007) II.Matrices of Interest matrices of interest We consider 5 types of matrices associated with a graph G.

KPS 2007 (April 19, 2007) matrices of interest

KPS 2007 (April 19, 2007) matrices of interest

KPS 2007 (April 19, 2007) III.An Equilibrium Ensemble of Scale- Free Graphs – The Static model static model The static model is an efficient way of generating the scale-free network with arbitrary expected degree sequences.

KPS 2007 (April 19, 2007) static model - -Static model [Goh et al PRL (2001)] is a simple realization of a grand-canonical ensemble of graphs with a fixed number of nodes including Erdos-Renyi (ER) classical random graph as a special case. - -Practically the same as the Chung-Lu model (2002) - -Closely related to the “hidden variable” models [Caldarelli et al PRL (2002), Boguna and Pastor- Satorras PRE (2003), Park-Newman (2003)]

KPS 2007 (April 19, 2007) static model 1. Each site is given a weight (“fitness”) 2. Select one vertex i with prob. P i and another vertex j with prob. P j. 3. If i=j or A ij =1 already, do nothing (fermionic constraint). Otherwise add a link, i.e., set A ij =1. 4. Repeat steps 2,3 Np/2 times ( =Np/2, p= fugacity for links).   Construction of the static model

KPS 2007 (April 19, 2007) static model   Such algorithm realizes a “grandcanonical ensemble” of graphs Each link is attached independently but with inhomegeous probability f i,j.

KPS 2007 (April 19, 2007) static model - Degree distribution - Percolation Transition

KPS 2007 (April 19, 2007) - c.f. Chung-Lu model: static model - Erdos-Renyi model :

KPS 2007 (April 19, 2007) IV. Replica method: General formalism Replica method: General formalism The replica method may be applied to perform the graph ensemble averages in the thermodynamic limit.

KPS 2007 (April 19, 2007) Replica method: General formalism - Consider a hamiltonian of the form (defined on G) - One wants to calculate the ensemble average of ln Z(G) - Introduce n replicas to do the graph ensemble average first

KPS 2007 (April 19, 2007) Replica method: General formalism The effective hamiltonian after the ensemble average is - Since each bond is independently occupied, one can perform the graph ensemble average

KPS 2007 (April 19, 2007) Replica method: General formalism - Under the sum over {i,j},in most cases. - So, write the second term of the effective hamiltonian as - One can prove rigorously that the remainder R/N is small in the thermodynamic limit for the equilibrium ensembles mentioned. E.g., for the static model, (PRE 2005)

KPS 2007 (April 19, 2007) Replica method: General formalism - The nonlinear interaction term is of the form - So, the effective hamiltonian takes the form - Linearize each quadratic term by introducing conjugate variables Q R and employ the saddle point method

KPS 2007 (April 19, 2007) - The single site partition function is - The effective “mean-field energy” function inside is determined via the non-linear functional equation: Replica method: General formalism

KPS 2007 (April 19, 2007) - The conjugate variables takes the meaning of the order parameters - How one can proceed from here on depends on specific problems at hand. - We apply this formalism to the spectral density problem. Replica method: General formalism

KPS 2007 (April 19, 2007) V.Spectral Densities in the Dense Graph Limit Spectral density Formal expressions of the spectral density (the density of states) are obtained for various matrices. Explicit analytical results are obtained in the large p limit.

KPS 2007 (April 19, 2007) with eigenvalues is the ensemble average of density of states for real symmetric N by N matrix Q. It can be calculated from the formula Spectral density

KPS 2007 (April 19, 2007) Spectral density - Apply the previous formalism to the adjacency matrix - Analytic treatment is possible in the dense graph limit:

KPS 2007 (April 19, 2007) Spectral density

KPS 2007 (April 19, 2007) Spectral density

KPS 2007 (April 19, 2007) Spectral densitySimilarly…

KPS 2007 (April 19, 2007)

Spectral density

KPS 2007 (April 19, 2007)

Spectral density

KPS 2007 (April 19, 2007)

Spectral density

KPS 2007 (April 19, 2007)

VI. Summary and Discussion The replica method is formulated for a class of scale- free graph ensembles where each link is attached independently. General formula for the spectral densities of adjacency, Laplacian, random walk, weighted adjacency and weighted Laplacian matrices are obtained for sparse graphs (p=2L/N finite) in the thermodynamic limit. The spectral densities are obtained analytically in the large p limit. These results are expected to be a good approximation for 1 << p << N

KPS 2007 (April 19, 2007) The spectral densities at finite p, and/or finite N are unsolved problems except for special cases. The so-called eigenratio R for the weighted Laplacian can be estimated as ln R = |1-beta| ln N /(lambda-1). The Laplacian of the weighted network is a different problem that cannot be applied here. But several steps of approximations lead it to the weighted Laplacian treated in this work.