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

Slides:



Advertisements
Similar presentations
Open problems How can I acquire desired RT data? How can I discover/access desired RT data? How can I share/integrate the data? Can I integrate dynamically?
Advertisements

The Basics Vision: New synthesis of statistical sciences and applied mathematical sciences with disciplinary science to confront data- and model-driven.
Juan-Antonio CorderoPhilippe JacquetEmmanuel Baccelli Orlando, FL -- March 29 th, 2012 Impact of Jitter-based Techniques on Flooding over Wireless Ad hoc.
Topology and Dynamics of Complex Networks FRES1010 Complex Adaptive Systems Eileen Kraemer Fall 2005.
Transport and Percolation in Complex Networks Guanliang Li Advisor: H. Eugene Stanley Collaborators: Shlomo Havlin, Lidia A. Braunstein, Sergey V. Buldyrev.
Complex Cooperative Networks from Evolutionary Preferential Attachment Complex Cooperative Networks from Evolutionary Preferential Attachment Jesús Gómez.
Cartography of complex networks: From organizations to the metabolism Cartography of complex networks: From organizations to the metabolism Roger Guimerà.
Complex Networks: Complex Networks: Structures and Dynamics Changsong Zhou AGNLD, Institute für Physik Universität Potsdam.
Complex Networks Advanced Computer Networks: Part1.
ETC Trento Workshop Spectral properties of complex networks
The Universal Laws of Structural Dynamics in Large Graphs Dmitri Krioukov UCSD/CAIDA David Meyer & David Rideout UCSD/Math M. Boguñá, M. Á. Serrano, F.
Scale Free Networks.
Albert-László Barabási
Network biology Wang Jie Shanghai Institutes of Biological Sciences.
The Architecture of Complexity: Structure and Modularity in Cellular Networks Albert-László Barabási University of Notre Dame title.
报告人: 林 苑 指导老师:章忠志 副教授 复旦大学  Introduction about random walks  Concepts  Applications  Our works  Fixed-trap problem  Multi-trap problem.
Leaders and clusters in social space Janusz Hołyst Faculty of Physics and Center of Excellence for Complex Systems Research (CSR), Warsaw University of.
Finite-size scaling in complex networks Meesoon Ha (KIAS) in collaboration with Hyunsuk Hong (Chonbuk Nat’l Univ.) and Hyunggyu Park (KIAS) Korea Institute.
Daniel ben -AvrahamClarkson University Boston Universtiy Reuven Cohen Tomer Kalisky Alex Rozenfeld Bar-Ilan University Eugene Stanley Lidia Braunstein.
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
Introduction to complex networks Part II: Models Ginestra Bianconi Physics Department,Northeastern University, Boston,USA NetSci 2010 Boston, May
From Complex Networks to Human Travel Patterns Albert-László Barabási Center for Complex Networks Research Northeastern University Department of Medicine.
Alon Arad Alon Arad Hurst Exponent of Complex Networks.
Global topological properties of biological networks.
Random Field Ising Model on Small-World Networks Seung Woo Son, Hawoong Jeong 1 and Jae Dong Noh 2 1 Dept. Physics, Korea Advanced Institute Science and.
STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
The Erdös-Rényi models
Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.
Information Networks Power Laws and Network Models Lecture 3.
Complex networks A. Barrat, LPT, Université Paris-Sud, France I. Alvarez-Hamelin (LPT, Orsay, France) M. Barthélemy (CEA, France) L. Dall’Asta (LPT, Orsay,
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.
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.
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
Complex Networks First Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
Average Consensus Distributed Algorithms for Multi-Agent Networks Instructor: K. Sinan YILDIRIM.
International Workshop on Complex Networks, Seoul (23-24 June 2005) Vertex Correlations, Self-Avoiding Walks and Critical Phenomena on the Static Model.
Soon-Hyung Yook, Sungmin Lee, Yup Kim Kyung Hee University NSPCS 08 Unified centrality measure of complex networks: a dynamical approach to a topological.
Networks Igor Segota Statistical physics presentation.
Outline 1.Critical short-time dynamics ― hot start & cold start ― 2. Application to lattice gauge theory ― extract critical exponents ― 3. Summary Short-Time.
Synchronization in complex network topologies
Janine Bolliger 1, Julien C. Sprott 2, David J. Mladenoff 1 1 Department of Forest Ecology & Management, University of Wisconsin-Madison 2 Department of.
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.
Experimental access to the density of Lee-Yang zeros from magnetization data of a 2d Ising-ferromagnet (L.J. de Jongh, A.R. Miedema Adv. Phys. 23 (1974))
KPS 2007 (April 19, 2007) On spectral density of scale-free networks Doochul Kim (Department of Physics and Astronomy, Seoul National University) Collaborators:
Brief Announcement : Measuring Robustness of Superpeer Topologies Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.
Condensation in/of Networks Jae Dong Noh NSPCS08, 1-4 July, 2008, KIAS.
Effects of the underlying topologies on Coupled Oscillators Soon-Hyung Yook.
Phase Transitions of Complex Networks and related Xiaosong Chen Institute of Theoretical Physics Chinese Academy of Sciences CPOD-2011, Wuhan.
Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”
Fractal Networks: Structures, Modeling, and Dynamics 章 忠 志 复旦大学计算机科学技术学院 Homepage:
ICTP School and Workshop on Structure and Function of complex Networks (16-28 May 2005) Structural correlations and critical phenomena of random scale-free.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
Epidemic spreading on preferred degree adaptive networks Shivakumar Jolad, Wenjia Liu, R. K. P. Zia and Beate Schmittmann Department of Physics, Virginia.
The intimate relationship between networks' structure and dynamics
Structures of Networks
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Condensation phenomena in stochastic systems Bath 2016 Quantum Statistics and Condensation Transitions in Networks and Simplicial Complexes Ginestra.
Epidemic spreading in complex networks with degree correlations
Research Scopes in Complex Network
Department of Computer Science University of York
Topology and Dynamics of Complex Networks
Statistics of Extreme Fluctuations in Task Completion Landscapes
Properties and applications of spectra for networks
Introducing complex networks into quantum regime
第八届全国复杂网络学术会议 Spectra of transition matrix for networks: Computation and applications 章 忠 志 复旦大学计算机科学技术学院 Homepage:
2nd TERANET 2011 International Workshop co-located with DISC 2011
Presentation transcript:

Dynamics of Social Interactions at Short Timescales G. Bianconi Department of Physics, Northeastern University SAMSI Workshop: Dynamics of networks SAMSI, January 10-12, 2011

Complex networks describe the underlying structure of interacting complex Biological, Social and Technological systems.

Dynamics on networks Scale-free degree distribution change the critical behavior of the Ising model, Percolation, disease spreading Spectral properties of the Laplacian matrix change the synchronization properties of networks with complex topologies Nishikawa et al.PRL 2003

How do critical phenomena on complex networks change if we include the spatial interactions?

Annealed uncorrelated complex networks In annealed uncorrelated complex networks, we assign to each node an expected degree Each link is present with probability p ij The degree k i a node i is a Poisson variable with mean i Boguna, Pastor-Satorras PRE 2003

Ising model in annealed complex networks The Ising model on annealed complex networks has Hamiltonian given by The critical temperature is given by The magnetization is non-homogeneous G. Bianconi 2002,S.N. Dorogovtsev et al. 2002, Leone et al. 2002, Goltsev et al. 2003,Lee et al. 2009

Critical exponents of the Ising model on complex topologies M C(T<T c ) >5 |T c -T| 1/2 Jump at T c |T c -T| -1 =5 |T-T c | 1/2 /(|ln|T c T||) 1/2 1/ln|T c -T||T c -T| -1 3< <5 |T c -T| 1/( |T c -T| |T c -T| -1 =3 e -2T/ T 2 e -4T/ T -1 2< <3 T T T -1 But the critical fluctuations still remain mean-field !

Ensembles of spatial complex networks The function J(d) can be measured in real spatial networks The maximally entropic network with spatial structure has link probability given by Airport Network Bianconi et al. PNAS 2009 J(d)

Annealead Ising model in spatial complex networks The linking probability of spatial complex networks is chosen to be The Ising model on spatial annealed complex networks has Hamiltonian given by We want to study the critical fluctuations in this model as a function of the typical range of the interactions

Stability of the mean-field approximation The partition function is given by The magnetization in the mean field approximation is given by The susceptibility is then evaluated by stationary phase approximation

Dynamics on spatial networks: the Ising model We assume that the spectrum is given by is the spectral gap and c the spectral edge. Anomalous critical fluctuations sets in only if the gap vanish in the thermodynamic limit, and S <1 For regular lattice S =(d-2)/2 S <1 only if d<4 The effective dimension of complex networks is d eff =2 S +2 c (S. Bradde, F. Caccioli, L. DallAsta and G. Bianconi PRL 2010)

Dynamics of networks At any given time dynamical networks looks disconnected Protein complexes during the cell cycle of yeast Social networks (phone calls, small gathering of people) De Lichtenberg et al.2005 Barrat et al.2008

Human social interaction are characterized by networks at different level of organization FriendshipsCitiesPolitical parties

Human social interactions are organized at different time scales From long lasting friendships and collaborations To the duration of a single phone-call or the duration of a small gathering during the coffee break of a conference

Bursty human activities Einstein and Darwin correspondence Olivera and Barabasi Nature (2005) Human dynamics is not described by Poisson processes

Inter-event time of human activities Vazquez et al. PRE (2006)

Queuing model for bursty human activities Priorities and random activities Queuing model (Barabasi Nature 2005,Vazquez PRL 2005) Only priorities

New data: face-to-face interactions Bluetooth sensors (Infocom 2005 conference)IMOTE data set -Temporal resolution 120s MIT experiment 100 students for 9 months -Time resolution 300s Radio Frequence Identification Devices (RFID) -face-to face interactions at a distance of 1-2 meters - temporal resolution of 20s

Distribution of contact lifetimes and intercontact duration Infocom 2005 conference 41 sensor for 3 days Sampling period 120s 100 MIT students for 9 months Sampling period 300s Chaintreaux et al Eagle and Pentland Reality Mining 2006 Contact Intercontact IMOTE MIT

Duration of contacts A.Barrat, C. Cattuto, V. Colizza, J.F. Pinton,W. Van den Broeck, A. Vespignani Arxiv:

Weighted social network A.Barrat, C. Cattuto, V. Colizza, J.F. Pinton,W. Van den Broeck, A. Vespignani Arxiv:

Cognitive Hebbian mechanisms Reinforcement dynamics in social interactions For the interacting individual The longer an individual interacts with a group the less is likely to leave the group For the isolated individual The longer and individual is isolated the less is likely to interact with a group

Stochastic processes with reinforcement Polya urns Reinforced random walk Hebbian Learning Replicator Dynamics Chinese restaurant processes Preferential attachment in networks

The ingredients of the dynamical pairwise model The individual i is associated to a state n i =0,1 indicating if he/she is isolated or interacting to a time t i which is the last time it has changed his state Reinforcement dynamics The more an individual is in a state the less likely it that he/she change his/her state Transition rates Only between

The dynamical paiwise model Choose one random agent If n=0 with probability p 0 (t,t i ) he connects to another isolated agent chosen with probability p 0 (t,t i ) If n=1, with probability p 1 (t,t i ) there is a transition and he/she disconnects from his/her group

Choice of p n (t,t i ) Absence of reinforcement Presence of reinforcement

The dynamical equations with reinforcement The dynamical equations for the number of individuals N 0,1 (t,t i ) that at time t are in state 0,1 since time t i are given by

Structure of the dynamical solution Where the transition rates are given in terms of N 0,1 (t,t)

Self-consistent assumption and phase diagram Stationary phase (white) Non-stationary phase

Transition rates: simulation vs. analytical results Green Stationary region Red b Blue b 0 <0.5, b 1 <0.5

Contact and inter-contact time distributions Stationary region Non-stationary region (b 1 <0.5 b 0 <0.5)

The dynamical model with groups of any size The individual i is associated to a state n i =0,1,2… indicating the number of other individual in his/her group to a time t i which is the last time it has changed his state Reinforcement dynamics The more an individual is in a state the less likely it that he/she change his/her state Transition rates Only between n n+1 or n n-1 An individual in a group which is changing state can either detach himself/herself from his/her group with rate or introduce an insolated individual to its group with rate 1-

The dynamical model Choose one random agent If n=0 with probability p 0 (t,t i ) he connects to another isolated agent chosen with probability p 0 (t,t i ) If n>0, with probability p n (t,t i ) there is a transition -with probability he/she connects to an insolated agent chosen with probability p 0 (t,t i ) -with probability 1- he/she disconnects from his/her group

Choice of p n (t,t i ) In presence of reinforcement

The dynamical equations with reinforcement The dynamical equations for the number of individuals N n (t,t i ) that at time t are in state n since time t i are given by with (t) given by

Phase diagram of the model (I) Stationary region (II) Non-stationary region (III) Self-consistent assumption breaks-down

Lifetime of a group of size n+1 Langer groups are more unstable (J. Stehle, A. Barrat and G. Bianconi PRE 2010)

Real data versus model The model well capture the distribution of lifetime of different group sizes of small human gatherings (Sociopatterns,data from Berlin conference )

Instability for the formation of a large group in region I The model present an instability for the formation of a large group of the order of magnitude of N

Strong finite size effects in region III

Features of the nodes In complex networks nodes are generally heterogeneous and they are characterized by specific features In Social networks nodes have specific features: age, gender, type of jobs, drinking and smoking habits, nationality Specific feature might affects the social inclination of different people, therefore a natural first generalization of the model would describe heterogeneous social behavior

Heterogeneous model The agents are assigned a parameter i drawn from a uniform distribution in (0,1) that describe their social behavior and we call sociability The larger is the more social is the agent behavior

Pairwise heterogeneous model: The duration of contacts of agents with sociability

Self-consistent solution

Aggregated data for the pairwise heterogeneous model: simulations versus analytical results

Heterogeneous model with groups of any size

Conclusions Human social interaction on a fast timescales are characterized by a dynamics with reinforcement that is able to predict both power- law distribution of durations of contacts and inter-contact times. The model show a rich phase diagram with the power-law lifetime of groups persisting also in the non-stationary region The model can be easily generalized to include for heterogeneous sociability of the agents The model is a perfect platform to perform simulation of social behavior on the fast time scale

Many thanks go to my collaborators Kun Zhao (Northeastern University, USA) Alain Barrat, Juliette Stehle (Universite de Marseille, France,SOCIOPATTERNS) Ciro Cattuto, Wouter Van den Broeck, Jean-Francois Pinton (ISI Foudation,Tourin, SOCIOPATTERNS)