Stationary efficiency of co-evolutionary networks: an inverse voter model Chen-Ping Zhu 12 , Hui Kong 1 , Li Li 3 , Zhi-Ming Gu 1 , Shi-Jie Xiong 4.

Slides:



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

Network biology Wang Jie Shanghai Institutes of Biological Sciences.
Traffic-driven model of the World-Wide-Web Graph A. Barrat, LPT, Orsay, France M. Barthélemy, CEA, France A. Vespignani, LPT, Orsay, France.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.
Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.
School of Information University of Michigan Network resilience Lecture 20.
Spontaneous recovery in dynamic networks Advisor: H. E. Stanley Collaborators: B. Podobnik S. Havlin S. V. Buldyrev D. Kenett Antonio Majdandzic Boston.
CONNECTIVITY “The connectivity of a network may be defined as the degree of completeness of the links between nodes” (Robinson and Bamford, 1978).
Farnoush Banaei-Kashani and Cyrus Shahabi Criticality-based Analysis and Design of Unstructured P2P Networks as “ Complex Systems ” Mohammad Al-Rifai.
Scale-free networks Péter Kómár Statistical physics seminar 07/10/2008.
1 Epidemic Spreading in Real Networks: an Eigenvalue Viewpoint Yang Wang Deepayan Chakrabarti Chenxi Wang Christos Faloutsos.
Network Statistics Gesine Reinert. Yeast protein interactions.
Simple Linear Regression
1 TCOM 501: Networking Theory & Fundamentals Lecture 7 February 25, 2003 Prof. Yannis A. Korilis.
1 Simple Linear Regression Chapter Introduction In this chapter we examine the relationship among interval variables via a mathematical equation.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.
Author: M.E.J. Newman Presenter: Guoliang Liu Date:5/4/2012.
Claudio Castellano CNR-INFM Statistical Mechanics and Complexity and
Lecture 11: Ising model Outline: equilibrium theory d = 1
The importance of enzymes and their occurrences: from the perspective of a network W.C. Liu 1, W.H. Lin 1, S.T. Yang 1, F. Jordan 2 and A.J. Davis 3, M.J.
Percolation in self-similar networks Dmitri Krioukov CAIDA/UCSD M. Á. Serrano, M. Boguñá UNT, March 2011.
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
Random-Graph Theory The Erdos-Renyi model. G={P,E}, PNP 1,P 2,...,P N E In mathematical terms a network is represented by a graph. A graph is a pair of.
Using Graph Theory to Study Neural Networks (Watrous, Tandon, Conner, Pieters & Ekstrom, 2012)
Chapter 1 Introduction to Statistics. Statistical Methods Were developed to serve a purpose Were developed to serve a purpose The purpose for each statistical.
Self-Similarity of Complex Networks Maksim Kitsak Advisor: H. Eugene Stanley Collaborators: Shlomo Havlin Gerald Paul Zhenhua Wu Yiping Chen Guanliang.
Two Temperature Non-equilibrium Ising Model in 1D Nick Borchers.
Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU
Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006 How Much Independent Should Individual Contacts.
Selfishness, Altruism and Message Spreading in Mobile Social Networks September 2012 In-Seok Kang
ICOM 6115: Computer Systems Performance Measurement and Evaluation August 11, 2006.
自旋玻璃与消息传递算法 Spin Glass and Message-Passing Algorithms 周海军 中国科学院理论物理研究所.
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.
Nordic Process Control Workshop, Porsgrunn, Norway Application of the Enhanced Dynamic Causal Digraph Method on a Three-layer Board Machine Cheng.
Spatial Analysis & Geostatistics Methods of Interpolation Linear interpolation using an equation to compute z at any point on a triangle.
Percolation Processes Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization WorkshopPercolation Processes1.
Modeling Neural Networks Christopher Krycho Advisor: Dr. Eric Abraham May 14, 2009.
Animating Tessellations of the Plane with Statistic Models Ben McCabe Advisor: Rolfe Petschek Department of Physics, Case Western Reserve University Artists,
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.
Class 9: Barabasi-Albert Model-Part I
KPS 2007 (April 19, 2007) On spectral density of scale-free networks Doochul Kim (Department of Physics and Astronomy, Seoul National University) Collaborators:
MA354 An Introduction to Math Models (more or less corresponding to 1.0 in your book)
Spontaneous Formation of Dynamical Groups in an Adaptive Networked System Li Menghui, Guan Shuguang, Lai Choy-Heng Temasek Laboratories National University.
Complex brain networks: graph theoretical analysis of structural and functional systems.
Sampling and estimation Petter Mostad
Entrainment of randomly coupled oscillator networks Hiroshi KORI Fritz Haber Institute of Max Planck Society, Berlin With: A. S. Mikhailov 
Neural Networks Presented by M. Abbasi Course lecturer: Dr.Tohidkhah.
An Effective Method to Improve the Resistance to Frangibility in Scale-free Networks Kaihua Xu HuaZhong Normal University.
1 Friends and Neighbors on the Web Presentation for Web Information Retrieval Bruno Lepri.
March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.
Informatics tools in network science
Urban Traffic Simulated From A Dual Perspective Hu Mao-Bin University of Science and Technology of China Hefei, P.R. China
Network Science K. Borner A.Vespignani S. Wasserman.
An Improved Acquaintance Immunization Strategy for Complex Network.
Facilitation and inhibition of network percolation by distance-dependent strategy on a two- dimensional plane Chen-Ping Zhu 1,2,3, Long Tao Jia 1, 1.Nanjing.
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.
Dynamic Network Analysis Case study of PageRank-based Rewiring Narjès Bellamine-BenSaoud Galen Wilkerson 2 nd Second Annual French Complex Systems Summer.
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.
Random Walk for Similarity Testing in Complex Networks
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
QUANTUM TRANSITIONS WITHIN THE FUNCTIONAL INTEGRATION REAL FUNCTIONAL
Intermittency and clustering in a system of self-driven particles
Presented by Rhee, Je-Keun
Clustering Coefficients
Presentation transcript:

Stationary efficiency of co-evolutionary networks: an inverse voter model Chen-Ping Zhu 12 , Hui Kong 1 , Li Li 3 , Zhi-Ming Gu 1 , Shi-Jie Xiong 4

Outline 1. Motivations of our work 2. Inverse voter model (IVM) for co-evolutionary networks 3. Analytic and numerical results 4. Discussion and Conclusions

Motivations (1) A sort of real networks composed of nodes with binary states : (a)SIS epidemic networks: susceptible/infected (b)Stock market: buyers /sellers (c)Neural networks abstracted with firing and quiescent nodes (d)Communication networks with transmitters and receivers. Generalized information-flow yields between linked pairs of nodes in two opposite states. The function of such networks is to produce generalized information flow. So we call them flow networks. Only links between the nodes in the opposite states are effective for the function of a specific network.

Motivations (1)An edge linking two nodes: correlation/interaction between them. Effective/ineffective for realizing the function of a network? In a co-evolutionary network, node states vary with time, it changes the efficacy of links between them, even cause links to rewire correspondingly. Two actions feed back with each other. We advocate : Global efficiency should be the ratio of income/pay-off. It should refers to the density of effective links among all Links which may be time-dependent and arrives at dynamic equilibrium by co-evolution.

The primitive definition of global efficiency for a complex network It is irrelevant to either the function of a network or to the state of any node, which is abnormal from the viewpoint of statistical physics

Motivations (3) Most practically existing networks are sparse: Rarely could I find papers interpreting sparseness 。

3. Inverse voter model (IVM) Flow of generalized message, and coevolution Flow networks: SIS epidemics, stock markets, MANET, and neural networks. Nodes with binary states( ) Effective links: The flow-producing efficiency of dynamic networks with binary node states:

3. Inverse voter model

3. Inverse voter model (IVM)

dual meanings of parameter : probabilistic modifying factor to decide flipping/rewiring; Random factor describing effects caused by non-deterministic factors other nearest interactions, i.e., normalized inverse-temperature, =1/(T+1)

3. Inverse voter model (IVM)

Mean-field approximation

3. Inverse voter model(IVM) Stationary solution to master equation. Let in formula (2).

4.Results and physical meanings Continuous phase transition is verified by numerical simulation. (keeping and ) Compared with W-S solution to Ising model (anti- ferromagnetic) We define Long-range order(LRO): Short-rang order(SRO): Both relies on two independent variables(, )

4.Results for random graphs

Scaling relation of SRO, coevolution from initial random graph with the mechanism of IVM. (5)

4.Results for small world networks

(6) Scaling relation of SRO, coevolution from initial small-world with the mechanism of IVM.

4.Results and physical meanings

For the case of , another scaling relation is found for the coevolution from initial SW (7) where , c= -0.5 is a constant, , and is the critical average degree, h(x) is universal function. It reflects the correlation between evolution processes starting from different initial rewiring probability which related to effective dimension of SWNs. It is impossible to see E=1 no matter coevolution starting from RG or SW when.

4.Results and physical meanings Simulation results demonstrate that global efficiency of coevolutionary network with binary node states is enhanced with the flipping and rewiring mechanism of IVM. -dependent critical degree exists, below which global efficiency arrive at unity. Sparsity of practically existing networks can be explained as a result of co-evolution mechanism of IVM.

Calculation of Eglob based on SPLs in the the same coevolution process gives drastically opposite results with the stationary efficiency. which can not be correct since it violates the sparsity of real systems.

Actually, the other solution got from eq(3) can behave as

The definition of global efficiency of networks should no longer be applied to co- evolutionary networks since it merely describes topological connectivity of static graphs. Efficiency of a network should be relevant to its function, and to its node states. It should be the ratio of successful interactions between individuals. 5.Discussion and conclusions

A physical inverse voter model is presented to describe flow networks with binary node states. Different from previous models, we have found out new absorbing state of network evolution, continuous phase transition and scaling relations corresponding to it. We have explained possible origin of sparsity of real networks based on IVM. Small average degree of a network could be accounted as the result of co-evolution into high efficient state.

Acknowledgement Nation natural science foundation , , , Project : 2006CB705500

Thanks for your attention!

Outline 1.Motivations 2.A coevolutionary voter model 3.Our inverse voter model (IVM) 4.Results and their physical meanings 5.Possible applications 6.Discussion and Conclusions

2.A coevolutionary voter model F. Vazquez et al. PRL 100,108701(2008)

2. A coevolutionary Voter model

Motivations 1. Most of colleagues in physical community get used to describing complex networks with graphic variables. The number of parameters is increasing. However, we could not tell out, which ones are independent with each other, while which ones overlap with others even unnecessary. In particular, thinking about global efficiency pertaining to any network, it is always calculated by counting inverse shortest path lengths (SPLs) between all possible pairs of nodes. It is irrelevant to either the function of a network nor to the state of any node, which is abnormal from the viewpoint of statistical physics.

Motivations 2.The definition of above mentioned global efficiency E glob is not applicable to many coevolutionary dynamic networks. Examples: (1) SIR epidemics with an immune node on a SPL (2) nodes inside the transition circle of a speaking node in a MANET with MAC mechanism; /alternative working mechanism for energy-saving in a MANET. (3) neural networks with synaptic plasticity and refractory period of neurons. Connections along SPLs works intermittently due to state flipping of binary nodes. They could be changed even by rewired from a node due to coevolution with its dynamic states. E glob based on SPLs is a measure of connectivity of a static network, It should not be misused to dynamic networks.

Motivations 3. An edge linking two nodes: correlation/interaction between them. Effective/ineffective for realization of function? Variation of node states efficacy of links, even rewires, correspondingly. Global efficiency should be the ratio of income/pay-off. It should refers to the density of effective ones among all links, which may be time-dependent and arrives at dynamic equilibrium by coevolution.

Motivations 4. A sort of real networks consisting of nodes with binary states : (a)SIS epidemic networks (b)Stock market with buyers and sellers (c)Neural networks abstracted with firing and quiescent nodes (d)Communication networks with transmitting and receiving nodes. Generalized message-flow yields between possible pairs of nodes in the opposite states. The function of flow networks: producing flow Only links between the nodes in the opposite states are effective for the function of a specific network.

2.A coevolutionary voter model F. Vazquez et al. PRL 100,108701(2008)

2.A coevolutionary Voter model

3.Our inverse voter model(IVM) Flow of generalized message Flow networks: SIS epidemics, stock markets, MANET Nodes with binary states( ) Effective links: The flow-producing efficiency of dynamic networks with binary node states:

3.Our inverse voter model (IVM)

dual meanings of parameter : probabilistic modifying factor to nearest neighbor interactions, randomness. Normalized inverse-temperature, =1/(T+1)

3.Our inverse voter model (IVM)

Mean-field approximation

3.Our inverse voter model(IVM) Stationary solution to master equation. Let in formula (2).

3.Our inverse voter model (IVM) Distinct states as the analytic result of coevolution of a network, efficiency Continuous phase transition represented by order parameter ( ) is the absorbing state of coevolution.

4.Results and physical meanings Continuous phase transition is verified by numerical simulation. (keeping and ) Compared with Ising model (anti-ferromagnetic) We define Long-range order(LRO): Short-rang order(SRO ): Both relies on two independent variables(, )

4.Results and physical meanings

Scaling relation of SRO, coevolution from initial random graph with the mechanism of IVM. (5)

4.Results and physical meanings

(6) Scaling relation of SRO, coevolution from initial small-world with the mechanism of IVM.

4.Results and physical meanings Simulation results demonstrate that global efficiency of coevolutionary network with binary node states is enhanced with the flipping and rewiring mechanism of IVM. -dependent critical degree exists, below which global efficiency arrive at unity.,. is independent of only when. Sparsity of practically existing networks can be thought as a result of coevolution mechanism.

4.Results and physical meanings

For the case of , another scaling relation is found for the coevolution from initial SW (7) where , c= -0.5 is a constant, , and is the critical average degree, h(x) is universal function. It reflects the correlation between evolution processes starting from different initial rewiring probability which related to effective dimension of small world networks. It is impossible to see E=1 no matter coevolution starting from RG or SW when.

4.Results and physical meanings Calculation of E glob based on SPLs in the the same coevolution process gives drastically opposite results with the efficiency which can not be correct since it violates the sparsity of real systems. At least, it provides us with a reversal evidence that we need to measure global efficiency in a different way.

5.Possible applications In principle, both VM and IVM could be modified to describe various systems consisting of nodes with binary states, such as epidemics, stock market, MANET, sensor networks, neural networks, evolutionary games and possibly some problems in systems biology.

5.Possible applications An example: friction in social networks. Combining SRO with LRO in IVM, we can measure direct friction and indirect friction in socioeconomic systems quantitatively:

5.Discussion and conclusions Popularly misused definition of global efficiency of networks should no longer be applied to co-evolutionary networks since it merely describe topological connectivity of static graphs. Efficiency of a network should be relevant to its function, and to its node states. It should be the ratio of successful interactions between individuals. A physical inverse voter model is presented to describe flow networks with binary node states. We defined long-range-order and short-range-order, respectively. Different from previous models, we have found out new absorbing state of network evolution, continuous phase transition and scaling relations corresponding to it. Explained possible origin of sparsity of real networks based on IVM. Small average degree of a network could be accounted as the result of co-evolution into high efficient state. In addition, we may define ground state of a network by our parameter SRO=0,. The efficiency E=1for ground state, while in exciting states E<1.

Acknowledgement Nation natural science foundation : , , , Project : 2006CB705500

Thanks for your patience!