An extraordinary transition in a minimal adaptive network of introverts and extroverts R.K.P. Zia Department of Physics, Virginia Tech, Blacksburg, Virginia.

Slides:



Advertisements
Similar presentations
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.
Advertisements

Leaders and clusters in social space Janusz Hołyst Faculty of Physics and Center of Excellence for Complex Systems Research (CSR), Warsaw University of.
Stats for Engineers Lecture 6 Answers for Question sheet 1 are now online Answers for Question sheet 2 should be.
Spontaneous recovery in dynamic networks Advisor: H. E. Stanley Collaborators: B. Podobnik S. Havlin S. V. Buldyrev D. Kenett Antonio Majdandzic Boston.
Lecture 14: Spin glasses Outline: the EA and SK models heuristic theory dynamics I: using random matrices dynamics II: using MSR.
1 Chiral Symmetry Breaking and Restoration in QCD Da Huang Institute of Theoretical Physics, Chinese Academy of
1 MBG-60 Happy birthday, Michael!. 2 Degania, Israel (1910)
1 Epidemic Spreading in Real Networks: an Eigenvalue Viewpoint Yang Wang Deepayan Chakrabarti Chenxi Wang Christos Faloutsos.
Image processing. Image operations Operations on an image –Linear filtering –Non-linear filtering –Transformations –Noise removal –Segmentation.
The Markov property Discrete time: A time symmetric version: A more general version: Let A be a set of indices >k, B a set of indices
Cluster Analysis.  What is Cluster Analysis?  Types of Data in Cluster Analysis  A Categorization of Major Clustering Methods  Partitioning Methods.
Polymers PART.2 Soft Condensed Matter Physics Dept. Phys., Tunghai Univ. C. T. Shih.
1 A. Derivation of GL equations macroscopic magnetic field Several standard definitions: -Field of “external” currents -magnetization -free energy II.
Monte Carlo Simulation of Ising Model and Phase Transition Studies
Chap.3 A Tour through Critical Phenomena Youjin Deng
Physics 114: Lecture 15 Probability Tests & Linear Fitting Dale E. Gary NJIT Physics Department.
The Erdös-Rényi models
Presentation in course Advanced Solid State Physics By Michael Heß
Monte Carlo Simulation of Ising Model and Phase Transition Studies By Gelman Evgenii.
Absorbing Phase Transitions
Relating computational and physical complexity Computational complexity: How the number of computational steps needed to solve a problem scales with problem.
Entropy localization and distribution in the Hawking radiation Horacio Casini CONICET-Intituto Balseiro – Centro Atómico Bariloche.
Free energies and phase transitions. Condition for phase coexistence in a one-component system:
Lecture 11: Ising model Outline: equilibrium theory d = 1
Estimation of Statistical Parameters
Percolation in self-similar networks Dmitri Krioukov CAIDA/UCSD M. Á. Serrano, M. Boguñá UNT, March 2011.
Condensation of Networks and Pair Exclusion Process Jae Dong Noh 노 재 동 盧 載 東 University of Seoul ( 서울市立大學校 ) Interdisciplinary Applications of Statistical.
V5 Epidemics on networks
Dynamical Replica Theory for Dilute Spin Systems Jon Hatchett RIKEN BSI In collaboration with I. Pérez Castillo, A. C. C. Coolen & N. S. Skantzos.
1 Worm Algorithms Jian-Sheng Wang National University of Singapore.
Thermodynamics and dynamics of systems with long range interactions David Mukamel S. Ruffo, J. Barre, A. Campa, A. Giansanti, N. Schreiber, P. de Buyl,
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.
Monte Carlo Methods in Statistical Mechanics Aziz Abdellahi CEDER group Materials Basics Lecture : 08/18/
Introduction to Lattice Simulations. Cellular Automata What are Cellular Automata or CA? A cellular automata is a discrete model used to study a range.
The Ising Model Mathematical Biology Lecture 5 James A. Glazier (Partially Based on Koonin and Meredith, Computational Physics, Chapter 8)
Aemen Lodhi (Georgia Tech) Amogh Dhamdhere (CAIDA)
Daniel Ariosa Ecole Polytechnique Fédérale de Lausanne (EPFL) Institut de Physique de la Matière Complexe CH-1015 Lausanne, Switzerland and Hugo Fort Instituto.
Two Temperature Non-equilibrium Ising Model in 1D Nick Borchers.
8. Selected Applications. Applications of Monte Carlo Method Structural and thermodynamic properties of matter [gas, liquid, solid, polymers, (bio)-macro-
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.
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Landau Theory Before we consider Landau’s expansion of the Helmholtz free Energy, F, in terms of an order parameter, let’s consider F derived from the.
KPS 2007 (April 19, 2007) On spectral density of scale-free networks Doochul Kim (Department of Physics and Astronomy, Seoul National University) Collaborators:
Percolation and diffusion in network models Shai Carmi, Department of Physics, Bar-Ilan University Networks Percolation Diffusion Background picture: The.
13. Extended Ensemble Methods. Slow Dynamics at First- Order Phase Transition At first-order phase transition, the longest time scale is controlled by.
Week 6. Statistics etc. GRS LX 865 Topics in Linguistics.
Javier Junquera Importance sampling Monte Carlo. Cambridge University Press, Cambridge, 2002 ISBN Bibliography.
Some physical properties of disorder Blume-Emery-Griffiths model S.L. Yan, H.P Dong Department of Physics Suzhou University CCAST
Kensuke Homma / Hiroshima Univ. from PHENIX collaboration
Network Science K. Borner A.Vespignani S. Wasserman.
Ginzburg-Landau theory of second-order phase transitions Vitaly L. Ginzburg Lev Landau Second order= no latent heat (ferromagnetism, superfluidity, superconductivity).
Monte Carlo Simulation of Canonical Distribution The idea is to generate states i,j,… by a stochastic process such that the probability  (i) of state.
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.
Epidemic spreading on preferred degree adaptive networks Shivakumar Jolad, Wenjia Liu, R. K. P. Zia and Beate Schmittmann Department of Physics, Virginia.
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.
Bayesian Neural Networks
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Computational Physics (Lecture 10)
Heuristic Optimization Methods
A simple model for studying interacting networks
ID1050– Quantitative & Qualitative Reasoning
all Cooper pairs must behave in the same way
Boltzmann Machine (BM) (§6.4)
Hysteresis Curves from 11 dimensions
Adaptive Cooperative Systems Chapter 3 Coperative Lattice Systems
Biointelligence Laboratory, Seoul National University
Presentation transcript:

An extraordinary transition in a minimal adaptive network of introverts and extroverts R.K.P. Zia Department of Physics, Virginia Tech, Blacksburg, Virginia Department of Physics and Astronomy, Iowa State University, Ames, Iowa CSP-Workshop, ii-12 Thanks to NSF-DMR Materials Theory Shivakumar Jolad Beate Schmittmann Wenjia Liu Thierry Platini Kevin Bassler Zoltan Toroczkai

Outline Motivation Model Specifications Simulation & Analytic Results Summary and Outlook Two communities of extreme introverts and extroverts the “XIE” model

Motivation Statistical physics: Many interacting d.o.f. Network of nodes, linked together Active nodes, static links  Ising, Potts, … spin glass, … real spins/glass  MD (particle  node, interaction  link, in a sense)  Models of forest fires, epidemics, opinions… Static nodes, active links (a baseline study) Active nodes, active links  annealed random bonds, … real gases/liquids (in a sense)  networks in real life: biological, social, infrastructure, … 

Static/active nodes, active links … is semantics! Just increase the configuration space!! Nevertheless, it is useful to think in these terms. Motivation

Static/active nodes, active links … especially in the setting of… Social Networks. Make new friends, break old ties Establish/cut contacts (just joined LinkedIn) …according to some preference (link activity ≠ in growing networks) Preferences can be dynamic! (epidemics) Motivation

For simplicity, think about epidemics: –SIS or SIRS (susceptible, infected, recovered) –Many studies of phase transitions –but nearly all are on static networks (e.g., square lattice) Yet, if you hear an epidemic is raging, you are likely to do something! (as opposed to a tree, in a forest fire) Most models “rewire” connections, but… …I am more likely to just cut ties!!! (you too?!) Motivation

Outline Motivation Model Specifications Simulation & Analytic Results Summary and Outlook

Model Specs N nodes have preferred degree(s): κ Links are dynamic, controlled by κ Single homogeneous (one κ) community Dynamics of two communities Overlay node variables (health, wealth, opinion, …) Feedback & coupling of nodes + links active nodes active links static nodes active links Focus of this talk! Two communities of eXtreme Introverts and Extroverts

1 MCS = N attempts Single homogeneous community One Attempt Connection k w ± (k) Rate function w + (k) sets preferred degree κ interpolates between 0 and 1 k κ cut add Choose, for simplicity, the rate for cutting a link: w - (k) = 1-w + (k) Tolerant Easy going Rigid Inflexible Nodes Links N N(N-1)/2 What quantities are of interest? …in the steady state… Degree distribution ρ (k) average number of nodes with k links surely around κ ; Gaussian? or not? Average diameter of network Clustering properties 

Two communities Many possible ways… to have two different groups and to couple them together !! different sizes: N 1 ≠ N 2 different w + ’s, e.g., same form, with κ 1 ≠ κ 2 various ways to introduce cross-links, e.g., … Our society consists of 75% extroverts and 25% introverts.

Two communities k w ± (k) One Attempt Pick a partner inside or outside? …with probability S or 1-S obviously, can have S 1 ≠ S 2 What else is interesting? Degree distributions same? or changed? “Internal” vs. “external” degree distributions Total number of cross-links How to measure “frustration”? 

Outline Motivation Model Specifications Simulation & Analytic Results Summary and Outlook

Degree distribution ρ (k) depends on w + (k). Single homogeneous community N =1000, κ =250 Double exponential cut add Gaussian → exponential tails a.k.a. Laplacian

Single homogeneous community An approximate argument leads to a prediction for the following stationary degree distribution: N=1000, κ =250 Black lines from “theory”

Two communities Our simple argument for ….degree distributions in a single network, generalized to include S 1 and S 2 : also works well here N 1 = N 2 = 1000 Κ 1 κ 1 =150, κ 2 =250 Rigid w’s S 1 = S 2 = 0.5

Two communities But, there are puzzles !! N 1 = N 2 = 1000 Κ 1 κ 1 =150, κ 2 =250 Rigid w’s S 1 = S 2 = 0.5 Degree distribution of “internal” links ρ 22 ρ 11 Degree distribution of cross links ρ 12 ρ 21 For introverts, the split seems to be about 100 (cross) + 50… For extroverts, the split is closer to 100 (cross) Why? frustration? How to predict 100? Why Gaussians? Why different widths? …

Two communities But, there are puzzles, even for the symmetric case !! N 1 = N 2 = 1000 Κ 1 κ 1 = κ 2 = 250 Rigid w’s S 1 = S 2 = 0.5 ρ 12 ρ 21 No surprises here, BUT …

Two communities But, there are puzzles, even for the symmetric case !! N 1 = N 2 = 1000 Κ 1 κ 1 = κ 2 = 250 Rigid w’s S 1 = S 2 = 0.5 The whole distribution wanders, at very long time scales! For simplicity, study behavior of X, the total number of cross-links. Note: With N 1 = N 2 = 1000, if every node has exactly 1 κ = 250 links, X lies in [0, 250K].

Two communities But, there are puzzles, even for the symmetric case !! N 1 = N 2 = 1000 Κ 1 κ 1 = κ 2 = 250 Rigid w’s S 1 = S 2 = 0.5 X (in 10 3 ) t (in 10 6 MCS) Many issues poorly understood … Dynamics violates detailed balance Stationary distribution is not known If X does pure RW, t ~ | X | 2 ~ 10 8 MCS Hoping to gain some insight, we consider the simplest possible case: the “XIE” model X lies in [0, 250K].

I’s always cut:  = 0 E’s always add:  =  Adjacency matrix reduces to rectangle: N I  N E just Ising model with spin-flip dynamics! … with only two control parameters : N I, N E Detailed balance restored!! Exact P * ({a ij }) obtained analytically. Problem is “equilibrium” like… “Hamiltonian” is just  ln P * … but so far, nothing can be computed exactly. Two communities of eXtreme I ’s & E ’s Only cross links: are active! Minimal model, but Maximal “frustration”!

I’s always cut:  = 0 E’s always add:  =  Adjacency matrix reduces to rectangle: N I  N E just Ising model with spin-flip dynamics! … with only two control parameters : N I, N E Unexpected bonuses:  Detailed balance restored!!  Exact P * ({a ij }) obtained analytically.  Problem is “equilibrium” like…  “Hamiltonian” is just  ln P * … but so far, nothing can be computed exactly. Two communities of eXtreme I ’s & E ’s Extraordinary phase transition !! from MC simulations with N I + N E = 200 degree: k  [0,199]

N I + N E = 200 Extroverts’ degree  49 ! Very few crosslinks! Two communities of eXtreme I ’s & E ’s ρ(k)ρ(k) ρ(k)ρ(k) k An Introvert can have up to 50 links

Two communities of eXtreme I ’s & E ’s

An Introvert can have up to 99 links But the average is only about 14 Two communities of eXtreme I ’s & E ’s

Extroverts Introverts approximate theory provides tolerable fits/predictions; except for (100,100)!

Extraordinary transition when 2 I’s “change sides” (101,99)  (99,101)

Two communities of eXtreme I ’s & E ’s Introverts Extroverts Particle -Hole Symmetry Exact symmetry of dynamics and so, in various stationary distributions Presence of a link for introverts is just as intolerable as Absence of a link for extroverts approximate theory provides reasonable fits/predictions… for N I < N E also.

Extraordinary critical point: (100,100) Giant fluctuations, very slow dynamics N  N Ising with spin-flip dynamics and … a “Hamiltonian” with long range, multi-spin interactions! The degree distributions did not stabilize, even after 10 7 MCS! … critical slowing down, with unknown z As before, study X instead, but unlike before, X does reach the boundaries (in 10 6 MCS with N=100)

0 1 2 t (in 10 6 MCS) X (in 10 3 ) Time traces of X for (I,E) being (101,99) (100,100) (99,101) (1000,1000)

P(X) near & at criticality ln P (arbitrary units) X Flat distribution  pure Random Walk? How to find location and width of the “soft walls”? Looks so simple, why is this so hard? …especially since the stationary distribution is known exactly! Power spectrum “thinks so”: ~ 1/f 2 up to the “walls”

Using the Ising magnetic language,  X maps into M:  N E  N I corresponds to H, an external magnetic field: Naïve expectation is just m = h

m h …like this: … but the system doesn’t think so! (125,75) (115,85) (110,90) (105,95) (101,99) (100,100) …

Reminds us of m(h) in ferromagnetism below criticality… is it that simple? Lots of issues with this picture…  How does this m(h) scale with N? (thermodynamic limit???)  What’s “temperature” here?  Zero field P(M) has two sharp peaks, not a plateau, as in P(X)!  …i.e., M(t) hovers for (exponentially) long times around  M spontaneous with short excursions in between, not RW between the extremes. Looks so simple, why is this so hard? …especially since the stationary distribution is known exactly!

Adjacency Matrix for XIE model Degrees of nodes i, j & extroverts’ “holes” Exact stationary distribution: “partition function” …exactly like a N I  N E Ising model

“Hamiltonian” has long range, multi-spin interactions but peculiarly anisotropic: …involves all spins within its row and column!! clearly “much worse” than usual Ising! Our P(X) is precisely Ising’s P(M). exact, analytic forms not known! BTW, analogue of  (k) in usual Ising model (almost) never studied

W. Kob: “How about trying Mean Field Theory?” Start with and replace so that

Meanwhile, so that A better perspective is to define a “Landau free energy”

Leading order is linear !! “Restoring forces” down by O(1/NlnN) !! Mostly flat for the “critical” case! So, typical (“off critical”) minima are very close to the boundaries! Meets qualitative expectations. Provides insight into this “extraordinary transition.” Need FSS analysis for details! … yet a surprising fit, with NO adjustable parameters:

Recall… m h (125,75) (115,85) (110,90) (105,95) (101,99) (100,100) … Not bad, for a first try… Obvious room for improvement, esp. in the critical region Mean Field Approach

Summary and Outlook Many systems in real life involve networks with active links Dynamics from intrinsic preferences, adaptation, etc. Remarkable behavior, even in a minimal model Some aspects understood, many puzzles remain Exact P * ({a ij }) found! Didn’t talk about other aspects, e.g., SIS on these networks Obvious questions, about XIE as well as more typical two communities interacting. Generalizations to more realistic systems. –Populations with many κ’s, not just two distinct groups –Links can be stronger or weaker (close friend vs. acquaintance) –Interaction of networks with very different characteristics (e.g., social, internet, power-grid, transportation…) –How does failure of one affect another? 