Burstyness, localization and Griffiths effects in network models

Slides:



Advertisements
Similar presentations
Paper Structure.
Advertisements

Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
Algorithmic and Economic Aspects of Networks Nicole Immorlica.
Modelling and Identification of dynamical gene interactions Ronald Westra, Ralf Peeters Systems Theory Group Department of Mathematics Maastricht University.
Theory of the pairbreaking superconductor-metal transition in nanowires Talk online: sachdev.physics.harvard.edu Talk online: sachdev.physics.harvard.edu.
DYNAMICS OF RANDOM BOOLEAN NETWORKS James F. Lynch Clarkson University.
Power Laws By Cameron Megaw 3/11/2013. What is a Power Law?
Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.
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.
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.
Farnoush Banaei-Kashani and Cyrus Shahabi Criticality-based Analysis and Design of Unstructured P2P Networks as “ Complex Systems ” Mohammad Al-Rifai.
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
1 Epidemic Spreading in Real Networks: an Eigenvalue Viewpoint Yang Wang Deepayan Chakrabarti Chenxi Wang Christos Faloutsos.
Coupled Dark Energy and Dark Matter from dilatation symmetry.
STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.
Spectral analysis and slow dynamics on quenched complex networks Géza Ódor MTA-TTK-MFA Budapest 19/09/2013 „Infocommunication technologies and the society.
The Erdös-Rényi models
Absorbing Phase Transitions
2 Introduction: phase transition phenomena Phase transition: qualitative change as a parameter crosses threshold Matter temperature magnetism demagnetism.
Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL ACCESS Distinguished Lecture Series, Stockholm, May 28,
Shai Carmi Bar-Ilan, BU Together with: Shlomo Havlin, Chaoming Song, Kun Wang, and Hernan Makse.
Condensation of Networks and Pair Exclusion Process Jae Dong Noh 노 재 동 盧 載 東 University of Seoul ( 서울市立大學校 ) Interdisciplinary Applications of Statistical.
Critical Phenomena in Random and Complex Systems Capri September 9-12, 2014 Spin Glass Dynamics at the Mesoscale Samaresh Guchhait* and Raymond L. Orbach**
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
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.
International Workshop on Complex Networks, Seoul (23-24 June 2005) Vertex Correlations, Self-Avoiding Walks and Critical Phenomena on the Static Model.
Analysis of biological networks Part III Shalev Itzkovitz Shalev Itzkovitz Uri Alon’s group Uri Alon’s group July 2005 July 2005.
Stochastic Growth in a Small World and Applications to Scalable Parallel Discrete-Event Simulations H. Guclu 1, B. Kozma 1, G. Korniss 1, M.A. Novotny.
Physics of Flow in Random Media Publications/Collaborators: 1) “Postbreakthrough behavior in flow through porous media” E. López, S. V. Buldyrev, N. V.
Detecting the Long-Range Dependence in the Internet Traffic with Packet Trains Péter Hága, Gábor Vattay Department Of Physics of Complex Systems Eötvös.
Percolation Processes Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization WorkshopPercolation Processes1.
Lassú, villanásos dinamika komplex hálózatokon Géza Ódor MTA-TTK-MFA Budapest 11/04/2014 „Infocommunication technologies and the society of future (FuturICT.hu)”
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.
KPS 2007 (April 19, 2007) On spectral density of scale-free networks Doochul Kim (Department of Physics and Astronomy, Seoul National University) Collaborators:
Application of statistical physics to random graph models of networks Sameet Sreenivasan Advisor: H. Eugene Stanley.
Complex brain networks: graph theoretical analysis of structural and functional systems.
1 Synchronization in large networks of coupled heterogeneous oscillators Edward Ott University of Maryland.
Slow, bursty dynamics on complex networks Géza Ódor MTA-TTK-MFA Budapest 05/06/2014 „Infocommunication technologies and the society of future (FuturICT.hu)”
Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.
Ginzburg-Landau theory of second-order phase transitions Vitaly L. Ginzburg Lev Landau Second order= no latent heat (ferromagnetism, superfluidity, superconductivity).
Computational Physics (Lecture 10) PHY4370. Simulation Details To simulate Ising models First step is to choose a lattice. For example, we can us SC,
ICTP School and Workshop on Structure and Function of complex Networks (16-28 May 2005) Structural correlations and critical phenomena of random scale-free.
Dynamic Network Analysis Case study of PageRank-based Rewiring Narjès Bellamine-BenSaoud Galen Wilkerson 2 nd Second Annual French Complex Systems Summer.
Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL Network Science Workshop Hong Kong July
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
Structures of Networks
Performance Evaluation
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
New Results of the Color Diversity Problem Jack Raymond (英偉文) and K. Y
Computational Physics (Lecture 10)
Statistical-Mechanical Approach to Probabilistic Image Processing -- Loopy Belief Propagation and Advanced Mean-Field Method -- Kazuyuki Tanaka and Noriko.
Abrupt Epidemic Spreading
Sequential Algorithms for Generating Random Graphs
Topics In Social Computing (67810)
Strong Disorder Renormalization Group
What Stops Social Epidemics?
Coarsening dynamics Harry Cheung 2 Nov 2017.
Mixed order phase transitions
CASE − Cognitive Agents for Social Environments
Topology and Dynamics of Complex Networks
Statistics of Extreme Fluctuations in Task Completion Landscapes
Biointelligence Laboratory, Seoul National University
Sparsely Synchronized Brain Rhythm in A Small-World Neural Network
Network Models Michael Goodrich Some slides adapted from:
Advanced Topics in Data Mining Special focus: Social Networks
Presentation transcript:

Burstyness, localization and Griffiths effects in network models Géza Ódor, MTA-EK-MFA Budapest Ronald Dickman, UFMG Brazil Silvio Da Costa Ferreira, Wesley Cota UFV Brazil 13/07/2016 Project supported by OTKA, CNPq, CAPES, and FAPEMIG (Brazil) 1

Power-laws & critical slow dynamics in networks Brain : PL size distribution of neural avalanches G. Werner : Biosystems, 90 (2007) 496, How can we explain power-law dynamics in network models ? Correlation length (x) diverges Haimovici et al PRL (2013) : Brain complexity born out of criticality.

Burstyness observed in nature Brain : PL inter-event time distribution of neuron firing sequences & Autocorrelations Y. Ikegaya et al.: Science, 304 (2004) 559, N. Takahashi et al.: Neurosci. Res. 58 (2007) 219 Internet: Email sequences: And many more …. Models exist to explain internal non-Markovian behavior of agents (Karsai et al.: Sci. Rep. 2 (2012) 397) Can this occur by the collective behavior of Markovian agents ? Mobile call: Inter-event times and Autocorrelations Karsai et al. PRE 83 (2013) 025102 : Small but slow world ... J. Eckmann et al.: PNAS 101 (2004) 14333

Spreading models show fast dynamics on small-world networks Small world networks: Expectation: mean-field type behavior with fast dynamics Prototype: Contact Process or Susceptible-Infected-Susceptible (SIS) two-state model: For SIS : Infections attempted for all nn Order parameter : density of active ( ) sites Regular, Euclidean lattice: DP critical point : lc > 0 between inactive and active phases Infect: l / (1+l) Heal: 1 / (1+l)

Rare region effects in networks ? Rare active regions belowc with: (A)~ eA → slow dynamics (Griffiths Phase) ? Slow, bursty critical dynamics, diverging susceptibility in extended control parameter space ? M. A. Munoz, R. Juhász, C. Castellano and G. Ódor, PRL 105, 128701 (2010) 1. Inherent disorder in couplings 2. Disorder induced by topology Optimal fluctuation theory + simulations: YES In Erdős-Rényi networks below the percolation threshold In generalized small-world networks with finite graph dimension Are there any Griffiths effects in models on graphs with D , like in scale-free networks ? Does SIS exhibit localization on Power Law ( P(k) ~ k - ) networks ? 5

Localization of SIS in scale-free nets <I> → finite as N → , Localization for: 

SIS in scale-free networks Uncorrelated Configuration model with degree distribution: P(k) ~ k - Density decay simulations of SIS a near the critical point Logarithmically slow decay: in case of cutoff-free networks Quenched Mean-Field approx: star size: lifetime: 7

SIS in scale-free networks Non-universal power-law decay in case of hard-cutoff: networks 8

Sample-to-sample fluctuations

Optimal fluctuation theory Saddle point approximation: Nonuniversal power-laws in finite disordered systems due to the smeared c

Finite size analysis   1 FSS : 1 → 0 as N →   and Griffiths effects disappear In finite networks smeared transition + slow dynamics

Hierarchical Modular Network topology motivated by connectomes A: HMN2d: Exponentially decaying connection probabilities with the levels l : pl µ á kñ (½) s l related to networks with long edge probabilities: p(R) ~ á kñ R -s where GP-s are present (Juhasz et al PRE 2012) B: Hierarchical trees : Connectedness + finite dimension

Dynamic simulations of the Contact Process on asymmetric HMN2d Density decay from fully active initial state: Network size (l= 8, 9, 10) independent power-laws for 2.45 < l < 2.53 Local slopes of the curves: Logarithmic corrections (GP) At lc = 2.53(1) : aeff → 1 Above this l the aeff curves of larger systems veer up as t → ¥ Mean-field critical point instead of activated scaling Similar results for s = 4 and s = 3 at the percolation threshold For symmetric HMN2d-s power-laws with size dependency

Burstyness of CP in the Griffiths Phase Density decay and seed simulations of CP on HMN2d with s = 6 Power-law inter-event time distribution among subsequent interaction attempts l dependent slopes + log. periodic oscillations due to the modularity The tail distribution decays as the auto-correlation function ® Physical aging ! Bustyness around the critical point in an extended Griffiths Phase

Conclusions Heterogeneities in network models can cause slow (PL) dynamics in extended control parameter regions: a working memory mechanism in brain Rare-regions → Griffiths Phases → even without tuning or self-organization mechanism ! GP-s arise in case of purely topological disorder, in finite topological dimensions, and in finite graphs if we average over many independent network realizations → time dependent nets, modules of weakly coupled modules, ... Heterogeneities in the interaction strengths improves GP effects and localization Bursty behavior in extended GP-s Complexity induces non-Markovian behavior of the individual nodes Géza Ódor, Ron Dickman, Gergely Ódor,, Sci. Rep. 5 (2015) 14451 Géza Ódor, Phys. Rev E 90 (2014) 032110 Wesley Cota, Silvio C. Ferreira, Phys. Rev. E 93 (2016) 032322 Support from: OTKA, FuturICT.hu, CNPq, CAPES, FAPEMIG

Network metrics Topological dimension : N(r) ~ r d Effective dimension: Breadth-first search results, in agreement with the 2d networks with power-law ranged, long edges: For s = 4 : <k> dependent continuously changing dimension. Similar to the MM HMN1 construction For s < 4 small-world networks, similar to KH For s > 4 finite dim., fast decaying long links inducing quenched disorder A: We study this (s = 6) in more detail + 2d lattice connectedness (l = 1) B: Hierarchical, random trees: d » 0.72 Kaiser et al Cerb. Cort. 2009: Axon length distribution: Initial large peak + exponential tail

Rare Region theory for quench disordered CP Act. Fixed (quenched) disorder/impurity changes the local birth rate  l c > lc0 Locally active, but arbitrarily large Rare Regions in the inactive phase due to the inhomogeneities Probability of RR of size LR: w(LR ) ~ exp (-c LR ) contribute to the density: r(t) ~ ∫ dLR LR w(LR ) exp [-t /t (LR)] For l < lc0 : conventional (exponentially fast) decay At lc0 the characteristic time scales as: t (LR) ~ LR Z  saddle point analysis: ln r(t) ~ t d / ( d + Z) stretched exponential For lc0 < l < lc : t (LR) ~ exp(b LR): Griffiths Phase r(t) ~ t - c / b continuously changing exponents At lc : b may diverge ® r(t) ~ ln(t) -a Infinite randomness fixed point scaling In case of correlated RR-s with dimension > d - : smeared transition lc „dirty critical point” GP lc0 „clean critical point” Abs.

Quenched Mean-Field (QMF) theory for SIS 1818 Quenched Mean-Field (QMF) theory for SIS Rate equation of SIS for occupancy prob. at site i: Weighted (real symmetric) Adjacency matrix: Express ri on orthonormal eigenvector ( fi (L) ) basis: Mean-field critical point estimate Total infection density vanishes near lc as :

Dynamic simulations of threshold models on HMN2d-s More realistic neuron model: k A →(k+1)A with: k > 1 Proposed by KH and LSA found First order transition (no GP) is expected, however due to disorder rounding of transition (see P.V.Martin et al JSTAT 2015 P01003) Stochastic CA simulations Size independent (l=8,9) power-law decays for: k = 2,3 Simple connectedness is not enough to provide infinite activity propagation

Dynamic simulations of the CP on random hierarchical trees (RHT) Density decay from fully active initial state: For single tree: no GP ! If we average over many independent network realizations: Power-laws for: 2.6 < l < 2.75 GP in case of a modular networks composed of loosely coupled RHT-s ? Or time dependent networks, where we average over runs of many RHT-s ?

Localization of SIS in HMN2d-s Weakly coupled case <k> = 4 In small world case (s=3/2) KH no localization For s=3, s=4 signs of localization For <k> = 50 and s=3,4 localization goes away For weighted links (uniform distributed quenched diso.) localization can be see again