Transport Properties of Fractal and Non-Fractal Scale-Free Networks

Slides:

Advertisements

Similar presentations

Peer-to-Peer and Social Networks Power law graphs Small world graphs.

Advertisements

Synchronization and Connectivity of Discrete Complex Systems Michael Holroyd.

Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.

Scale Free Networks.

It’s a Small World by Jamie Luo. Introduction Small World Networks and their place in Network Theory An application of a 1D small world network to model.

报告人：林苑指导老师：章忠志副教授复旦大学  Introduction about random walks  Concepts  Applications  Our works  Fixed-trap problem  Multi-trap problem.

RESILIENCE NOTIONS FOR SCALE-FREE NETWORKS GUNES ERCAL JOHN MATTA 1.

School of Information University of Michigan Network resilience Lecture 20.

Relationship Mining Network Analysis Week 5 Video 5.

VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.

Daniel ben -AvrahamClarkson University Boston Universtiy Reuven Cohen Tomer Kalisky Alex Rozenfeld Bar-Ilan University Eugene Stanley Lidia Braunstein.

Information Networks Generative processes for Power Laws and Scale-Free networks Lecture 4.

Information Networks Small World Networks Lecture 5.

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.

Cascading failures in interdependent networks and financial systems -- Departmental Seminar Xuqing Huang Advisor: Prof. H. Eugene Stanley Collaborators:

4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.

Emergence of Scaling in Random Networks Barabasi & Albert Science, 1999 Routing map of the internet

Scale Free Networks Robin Coope April Abert-László Barabási, Linked (Perseus, Cambridge, 2002). Réka Albert and AL Barabási,Statistical Mechanics.

Identifying Patterns in Road Networks Topographic Data and Maps Henri Lahtinen Arto Majoinen.

Degree correlations in complex networks Lazaros K. Gallos Chaoming Song Hernan A. Makse Levich Institute, City College of New York.

Network Statistics Gesine Reinert. Yeast protein interactions.

Zhenhua Wu Advisor: H. E. StanleyBoston University Co-advisor: Lidia A. BraunsteinUniversidad Nacional de Mar del Plata Collaborators: Shlomo HavlinBar-Ilan.

Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏

Common Properties of Real Networks. Erdős-Rényi Random Graphs.

Physical Mechanism Underlying Opinion Spreading Jia Shao Advisor: H. Eugene Stanley J. Shao, S. Havlin, and H. E. Stanley, Phys. Rev. Lett. 103,

Physical Mechanism Underlying Opinion Spreading

Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.

Peer-to-Peer and Social Networks Random Graphs. Random graphs E RDÖS -R ENYI MODEL One of several models … Presents a theory of how social webs are formed.

Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.

Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.

(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.

九大数理集中講義 Comparison, Analysis, and Control of Biological Networks (3) Domain-Based Mathematical Models for Protein Evolution Tatsuya Akutsu Bioinformatics.

Soon-Hyung Yook, Sungmin Lee, Yup Kim Kyung Hee University NSPCS 08 Unified centrality measure of complex networks.

DYNAMICS OF COMPLEX SYSTEMS Self-similar phenomena and Networks Guido Caldarelli CNR-INFM Istituto dei Sistemi Complessi

Optimal serverless networks attacks, complexity and some approximate algorithms Carlos Aguirre Maeso Escuela Politécnica Superior Universidad Autónoma.

Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.

MEDUSA – New Model of Internet Topology Using k-shell Decomposition Shai Carmi Shlomo Havlin Bloomington 05/24/2005.

Self-Similarity of Complex Networks Maksim Kitsak Advisor: H. Eugene Stanley Collaborators: Shlomo Havlin Gerald Paul Zhenhua Wu Yiping Chen Guanliang.

Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU

Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.

Analysis of biological networks Part III Shalev Itzkovitz Shalev Itzkovitz Uri Alon’s group Uri Alon’s group July 2005 July 2005.

Soon-Hyung Yook, Sungmin Lee, Yup Kim Kyung Hee University NSPCS 08 Unified centrality measure of complex networks: a dynamical approach to a topological.

8 Sampling Distribution of the Mean Chapter8 p Sampling Distributions Population mean and standard deviation,  and   unknown Maximal Likelihood.

3. SMALL WORLDS The Watts-Strogatz model. Watts-Strogatz, Nature 1998 Small world: the average shortest path length in a real network is small Six degrees.

Networks Igor Segota Statistical physics presentation.

Physics of Flow in Random Media Publications/Collaborators: 1) “Postbreakthrough behavior in flow through porous media” E. López, S. V. Buldyrev, N. V.

Efficient Labeling Scheme for Scale-Free Networks The scheme in detailsPerformance of the scheme First we fix the number of hubs (to O(log(N))) and show.

Alexander Ossipov School of Mathematical Sciences, University of Nottingham, UK TexPoint fonts used in EMF. Read the TexPoint manual before you delete.

Robustness and Structure of Complex Networks Shuai Shao Boston University, Physics Department A dvisor: Prof. Gene Stanley Co-advisor: Prof. Shlomo Havlin.

Percolation and diffusion in network models Shai Carmi, Department of Physics, Bar-Ilan University Networks Percolation Diffusion Background picture: The.

An Effective Method to Improve the Resistance to Frangibility in Scale-free Networks Kaihua Xu HuaZhong Normal University.

Social Networking: Large scale Networks

1 CIS 4930/6930 – Recent Advances in Bioinformatics Spring 2014 Network models Tamer Kahveci.

March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.

Mix networks with restricted routes PET 2003 Mix Networks with Restricted Routes George Danezis University of Cambridge Computer Laboratory Privacy Enhancing.

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.

Abstract Networks. WWW (2000) Scientific Collaboration Girvan & Newman (2002)

Hierarchical Organization in Complex Networks by Ravasz and Barabasi İlhan Kaya Boğaziçi University.

Netlogo demo. Complexity and Networks Melanie Mitchell Portland State University and Santa Fe Institute.

Fractal Networks: Structures, Modeling, and Dynamics 章忠志复旦大学计算机科学技术学院 Homepage:

Response network emerging from simple perturbation Seung-Woo Son Complex System and Statistical Physics Lab., Dept. Physics, KAIST, Daejeon , Korea.

Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.

Weighted Networks IST402 – Network Science Acknowledgement: Roberta Sinatra Laszlo Barabasi.

Daniel ben - Avraham Clarkson University Boston Universtiy Reuven Cohen Tomer Kalisky Alex Rozenfeld Bar-Ilan University Eugene Stanley Lidia Braunstein.

Xiaowei Ying, Kai Pan, Xintao Wu, Ling Guo Univ. of North Carolina at Charlotte SNA-KDD June 28, 2009, Paris, France Comparisons of Randomization and K-degree.

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

Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.

Enhancing Attack Robustness of Scale-free Networks by Camouflage

Peer-to-Peer and Social Networks

Presentation transcript:

Transport Properties of Fractal and Non-Fractal Scale-Free Networks M. Kitsak, S. Havlin, G. Paul, M. Riccaboni, F. Pammolli and H.E. Stanley M. Kitsak et al, Phys Rev E, (in press), 2007. http://arxiv.org/abs/physics/0702001

Betweenness Centrality C Motivation and Objectives Most of the transport on the network flows along the shortest paths. Central nodes/edges are critical: if they are blocked – transport becomes inefficient. It’s important to identify and “improve” central nodes/edges. How do we identify central nodes? Betweenness Centrality C L.C. Freeman, 1979 (Approximately equal to the number of paths passing specific node) Do nodes of high centrality have large degree? (in scale – free networks) What is an appropriate measure of correlation between centrality and degree?

Why Fractal Networks? Many real networks are scale-free (SF) fractals. (WWW, Biological… ) The key principle of SF fractal networks is “Repulsion Between Hubs”: Large degree nodes in SF fractal networks tend to connect to small degree nodes and not to each other. C. Song et al, Nature Physics 2, 275, (2006) Non-fractal (hubs connect directly) Fractal (hubs connect to small degree nodes) Small degree nodes in fractal network may have large centrality!!!

The network can be compared to its random counterpart ! Centrality vs Degree Correlation One can’t compare centralities of networks directly due to uniqueness of real networks. The network can be compared to its random counterpart ! Rewire many times Preserve degrees Rewired network has degree distribution identical to the original network. Repulsion between hubs is broken by random rewiring. The random network is always non-fractal.

Centrality vs Degree Correlation Weak centrality vs degree correlation results in high variance of centrality values attributed to nodes of given degree Centrality vs degree correlation of small degree nodes in non-fractal scale-free networks is much stronger than that in scale-free fractal networks.

Dispersion Correlation Coefficient Weak centrality vs degree correlation results in high variance of centrality values attributed to nodes of given degree Dispersion Correlation Coefficient: Fractal SF networks Non-Fractal SF networks

Summary and Conclusions 1. Centrality vs degree correlation is much weaker in fractal networks than in non-fractal. Fractal networks should be more stable to intentional attacks. Immunization/Attack strategies should be optimized for fractal networks. Dispersion Correlation Coefficient R allows to distinguish between fractal and non-fractal networks. Power-law centrality distribution Centralities of nodes are larger in fractal scale-free networks. Fractal networks have transport properties different from non-fractal. 4. Transition from fractal to non-fractal networks occurs upon adding random edges to a fractal network. A crossover is observed from fractal to non-fractal networks. Relatively small percent of edges is needed to turn fractal network into non-fractal. 3. and 4. were not discussed