Lars-Erik Cederman and Luc Girardin

Slides:



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

Topology and Dynamics of Complex Networks FRES1010 Complex Adaptive Systems Eileen Kraemer Fall 2005.
Complex Network Theory
Complex Networks Advanced Computer Networks: Part1.
Emergence of Scaling in Random Networks Albert-Laszlo Barabsi & Reka Albert.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Information Networks Generative processes for Power Laws and Scale-Free networks Lecture 4.
Complex network of the brain I Small world vs. scale-free networks Jaeseung Jeong, Ph.D. Department of Bio and Brain Engineering, KAIST.
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.
Complex Networks Third Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
CS728 Lecture 5 Generative Graph Models and the Web.
Emergence of Scaling in Random Networks Barabasi & Albert Science, 1999 Routing map of the internet
Network Models Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Models Why should I use network models? In may 2011, Facebook.
Scale-free networks Péter Kómár Statistical physics seminar 07/10/2008.
Small Worlds Presented by Geetha Akula For the Faculty of Department of Computer Science, CALSTATE LA. On 8 th June 07.
Small-World File-Sharing Communities Adriana Iamnitchi, Matei Ripeanu and Ian Foster,
The Barabási-Albert [BA] model (1999) ER Model Look at the distribution of degrees ER ModelWS Model actorspower grid www The probability of finding a highly.
Networks FIAS Summer School 6th August 2008 Complex Networks 1.
Central question for the sciences of complexity. How do large networks with.
1 Complex systems Made of many non-identical elements connected by diverse interactions. NETWORK New York Times Slides: thanks to A-L Barabasi.
Observing Self-Organized Criticality - an approach to evolution dynamics By Won-Min Song.
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
CS Lecture 6 Generative Graph Models Part II.
Advanced Topics in Data Mining Special focus: Social Networks.
Entropy, Order Parameters, and Complexity Incorporating the last 50 years into the statistical mechanics curriculum James P. Sethna, Cornell University,
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 May 14, 2006
On Distinguishing between Internet Power Law B Bu and Towsley Infocom 2002 Presented by.
Error and Attack Tolerance of Complex Networks Albert, Jeong, Barabási (presented by Walfredo)
Lars-Erik Cederman and Luc Girardin Center for Comparative and International Studies (CIS) Swiss Federal Institute of Technology Zurich (ETH)
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.
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.
Absorbing Phase Transitions
Emergent Structure Models: Applications to World Politics
Topic 13 Network Models Credits: C. Faloutsos and J. Leskovec Tutorial
Graph Theory in 50 minutes. This Graph has 6 nodes (also called vertices) and 7 edges (also called links)
Stefano Boccaletti Complex networks in science and society *Istituto Nazionale di Ottica Applicata - Largo E. Fermi, Florence, ITALY *CNR-Istituto.
Lars-Erik Cederman and Luc Girardin Center for Comparative and International Studies (CIS) Swiss Federal Institute of Technology Zurich (ETH)
Chaos, Communication and Consciousness Module PH19510 Lecture 16 Chaos.
Lars-Erik Cederman and Luc Girardin Center for Comparative and International Studies (CIS) Swiss Federal Institute of Technology Zurich (ETH)
Sandia National Laboratories NISAC’s core partners are Sandia National Laboratories and Los Alamos National Laboratory. Sandia is a multiprogram laboratory.
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
Prof. Dr. Lars-Erik Cederman Swiss Federal Institute of Technology (ETH) Center for Comparative and International Studies (CIS) Seilergraben 49, Room G.2.
Introduction to Computational Modeling of Social Systems Prof. Lars-Erik Cederman Center for Comparative and International Studies (CIS) Seilergraben 49,
Janine Bolliger 1, Julien C. Sprott 2, David J. Mladenoff 1 1 Department of Forest Ecology & Management, University of Wisconsin-Madison 2 Department of.
Lars-Erik Cederman and Luc Girardin Center for Comparative and International Studies (CIS) Swiss Federal Institute of Technology Zurich (ETH)
Complex Network Theory – An Introduction Niloy Ganguly.
Class 9: Barabasi-Albert Model-Part I
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
1 GEM2505M Frederick H. Willeboordse Taming Chaos.
Complex Network Theory – An Introduction Niloy Ganguly.
Most of contents are provided by the website Network Models TJTSD66: Advanced Topics in Social Media (Social.
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs Leman Akoglu, Mary McGlohon, Christos Faloutsos Carnegie Mellon University School.
Social Networking: Large scale Networks
Janine Bolliger Swiss Federal Research Institute WSL/FNP,
March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.
Strategies and Rubrics for Teaching Chaos and Complex Systems Theories as Elaborating, Self-Organizing, and Fractionating Evolutionary Systems Fichter,
Introduction to Computational Modeling of Social Systems Prof. Lars-Erik Cederman Center for Comparative and International Studies (CIS) Seilergraben 49,
Netlogo demo. Complexity and Networks Melanie Mitchell Portland State University and Santa Fe Institute.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
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.
Structures of Networks
Topics In Social Computing (67810)
Models of networks (synthetic networks or generative models): Random, Small-world, Scale-free, Configuration model and Random geometric model By: Ralucca.
Self-organized criticality of landscape patterning
Department of Computer Science University of York
Kriegsursachen im historischen Kontext Prof. Dr. Lars-Erik Cederman
Topology and Dynamics of Complex Networks
Lecture 9: Network models CS 765: Complex Networks
Presentation transcript:

Lars-Erik Cederman and Luc Girardin Advanced Computational Modeling of Social Systems Lars-Erik Cederman and Luc Girardin Center for Comparative and International Studies (CIS) Swiss Federal Institute of Technology Zurich (ETH) http://www.icr.ethz.ch/teaching/compmodels

Today‘s agenda Complexity Historical background Power laws Networks

Cybernetics Norbert Wiener (1894-1964) Science of communication and control Circularity Process and change Further development into general systems theory

General systems theory Ludwig von Bertalanffy (1901-1972)

Catastrophe theory René Thom (1923-2002) Catastrophes as discontinuities in morphogenetic landscapes

Chaos theory E. N. Lorenz Chaotic dynamics generated by deterministic processes Butterfly effect Strange attractor

Non-equilibrium physics Dissipative structures are organized arrangement in non-equilibrium systems that are dissipating energy and thereby generate entropy Ilya Priogogine Convection patterns

Self-organized criticality log f f Input Output s-a log s Complex System s Slowly driven systems that fluctuate around state of marginal stability while generating non-linear output according to a power law. Examples: sandpiles, semi-conductors, earthquakes, extinction of species, forest fires, epidemics, traffic jams, city populations, stock market fluctuations, firm size In the late 1980s, physicists discovered a large family of complex systems that generate power-law regularities. Per Bak, coined the term self-organized criticality: Paradigmatic example: sandpile. If trickle sand slowly on a sandpile ==> pile will grow, but not in an even fashion. From time to time, there will be avalanches of various sizes. More abstractly put, there is a linear input building up tensions held back by thresholds. When disturbances happen, they follow a power law. (hyperbolic curve) Sandpile differs from Newtonian physics (e.g. billiard balls) scale invariance: avalanches of all sizes possible; no typical size (fractals) history matters: path dependence, butterfly effect, but unlike chaos because output is not just random threshold effects and positive feedback (friction holding back the sand, or like pushing a piano over a rugged floor, sometimes is slides) Simple analogy: applying SOC to our puzzle Linear input: technological change building up tension Thresholds: decisions to go to war Positive feedback: avalanches through interdependent decisions ==> ABM standard approach in non-equil. theory Per Bak

Self-organized criticality Per Bak’s sand pile Power-law distributed avalanches in a rice pile

Strogatz: Exploring complex networks (Nature 2001) Problems to overcome: structural complexity network evolution connection diversity dynamic complexity node diversity meta-complication Steven H. Strogatz

Between order and randomness Watts and Strogatz’s Beta Model Short path length & high clustering Duncan Watts

The small-world experiment “Six degrees of separation” Sharon, MA Stanley Milgram Omaha, NE

Two degree distributions log p(k) log p(k) log k p(k) p(k) log k k k Normal distribution Power law

Scale-free networks Barabási and Albert’s 1999 model of the Internet: Constantly growing network Preferential attachments: p(k) = k / i ki

Cumulative war-size plot, 1820-1997 Since Richardson’s pioneering efforts to collect quantitative data about conflict processes in the 1940s, we know that war sizes are power-law distributed. Using logarithmic axes, the diagram plots cumulative war frequencies as a function of war size. A straight line in a log-log plot suggests the presence of a power law. Data Source: Correlates of War Project (COW)

Tooling RePast http://repast.sourceforge.net/ JUNG http://jung.sourceforge.net/ R SNA package http://erzuli.ss.uci.edu/R.stuff/ Pajek http://vlado.fmf.uni-lj.si/pub/networks/pajek/