Comparing Snapshots of Networks Shah Jamal Alam and Ruth Meyer Centre for Policy Modelling www.cfpm.org 28 th March, 2007 – CAVES Bi-annual Meeting, IIASA,

Slides:



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

Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα Strong and Weak Ties Chapter 3, from D. Easley and J. Kleinberg book.
Analysis and Modeling of Social Networks Foudalis Ilias.
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.
SOCI 5013: Advanced Social Research: Network Analysis Spring 2004.
CAVES Project Meeting September 2007 ● CPM1 South African Case Study Model Report Shah Jamal Alam, Ruth Meyer, Scott Moss Centre for Policy Modelling,
Putting genetic interactions in context through a global modular decomposition Jamal.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Walter Willinger AT&T Research Labs Reza Rejaie, Mojtaba Torkjazi, Masoud Valafar University of Oregon Mauro Maggioni Duke University HotMetrics’09, Seattle.
Synopsis of “Emergence of Scaling in Random Networks”* *Albert-Laszlo Barabasi and Reka Albert, Science, Vol 286, 15 October 1999 Presentation for ENGS.
Information Networks Small World Networks Lecture 5.
Advanced Topics in Data Mining Special focus: Social Networks.
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.
Trends in Object-Oriented Software Evolution: Investigating Network Properties Alexander Chatzigeorgiou George Melas University of Macedonia Thessaloniki,
Directional triadic closure and edge deletion mechanism induce asymmetry in directed edge properties.
Planning under Uncertainty
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
Distributed Cluster Repair for OceanStore Irena Nadjakova and Arindam Chakrabarti Acknowledgements: Hakim Weatherspoon John Kubiatowicz.
Physical Mechanism Underlying Opinion Spreading
Graphs and Topology Yao Zhao. Background of Graph A graph is a pair G =(V,E) –Undirected graph and directed graph –Weighted graph and unweighted graph.
Sunbelt 2009statnet Development Team ERGM introduction 1 Exponential Random Graph Models Statnet Development Team Mark Handcock (UW) Martina.
An Introduction to Social Simulation Andy Turner Presentation as part of Social Simulation Tutorial at the.
Population Ecology Population: A group of organisms that belong to the same species that live in the same place at the same time.
Constructing Individual Level Population Data for Social Simulation Models Andy Turner Presentation as part.
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
Epidemic spreading in complex networks: from populations to the Internet Maziar Nekovee, BT Research Y. Moreno, A. Paceco (U. Zaragoza) A. Vespignani (LPT-
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Self-Organizing Agents for Grid Load Balancing Junwei Cao Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04)
Sampling. Concerns 1)Representativeness of the Sample: Does the sample accurately portray the population from which it is drawn 2)Time and Change: Was.
Biological Networks Lectures 6-7 : February 02, 2010 Graph Algorithms Review Global Network Properties Local Network Properties 1.
Exploring the dynamics of social networks Aleksandar Tomašević University of Novi Sad, Faculty of Philosophy, Department of Sociology
Sampling online communities: using triplets as basis for a (semi-) automated hyperlink web crawler. Yoann VENY Université Libre de Bruxelles (ULB) - GERME.
CAVES Project Meeting March 2007 ● CPM1 South African Case Study Model Report Shah Jamal Alam, Ruth Meyer, Scott Moss Centre for Policy Modelling, MMU.
LANGUAGE NETWORKS THE SMALL WORLD OF HUMAN LANGUAGE Akilan Velmurugan Computer Networks – CS 790G.
Principles of Social Network Analysis. Definition of Social Networks “A social network is a set of actors that may have relationships with one another”
Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.
1 presentation of article: Small-World File-Sharing Communities Article: Adriana Iamnitchi, Matei Ripeanu, Ian Foster Presentation: Periklis Akritidis.
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.
A Graph-based Friend Recommendation System Using Genetic Algorithm
Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
Introduction to Spatial Microsimulation Dr Kirk Harland.
Analysis of biological networks Part III Shalev Itzkovitz Shalev Itzkovitz Uri Alon’s group Uri Alon’s group July 2005 July 2005.
Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα Networks and Surrounding Contexts Chapter 4, from D. Easley and J. Kleinberg book.
Unifying Dynamical Systems and Complex Networks Theories ~ A Proposal of “Generative Network Automata (GNA)” ~ Unifying Dynamical Systems and Complex Networks.
Algorithms for Biological Networks Prof. Tijana Milenković Computer Science and Engineering University of Notre Dame Fall 2010.
Yongqin Gao, Greg Madey Computer Science & Engineering Department University of Notre Dame © Copyright 2002~2003 by Serendip Gao, all rights reserved.
Complex Network Theory – An Introduction Niloy Ganguly.
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Studying Human Populations
Dynamic biological processes influence population density, dispersion, and demographics Chapter 53, Section 1.
Complex Network Theory – An Introduction Niloy Ganguly.
Percolation and diffusion in network models Shai Carmi, Department of Physics, Bar-Ilan University Networks Percolation Diffusion Background picture: The.
Most of contents are provided by the website Network Models TJTSD66: Advanced Topics in Social Media (Social.
341- INTRODUCTION TO BIOINFORMATICS Overview of the Course Material 1.
What Is A Network? (and why do we care?). An Introduction to Network Theory | Kyle Findlay | SAMRA 2010 | 2 “A collection of objects (nodes) connected.
Mining information from social media
CS 590 Term Project Epidemic model on Facebook
1 Finding Spread Blockers in Dynamic Networks (SNAKDD08)Habiba, Yintao Yu, Tanya Y., Berger-Wolf, Jared Saia Speaker: Hsu, Yu-wen Advisor: Dr. Koh, Jia-Ling.
© Vipin Kumar IIT Mumbai Case Study 2: Dipoles Teleconnections are recurring long distance patterns of climate anomalies. Typically, teleconnections.
Populations. Remember a population is… A group of the same species in the same area at the same time. A group of the same species in the same area at.
Selected Topics in Data Networking Explore Social Networks:
Hierarchical Organization in Complex Networks by Ravasz and Barabasi İlhan Kaya Boğaziçi University.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
Scale-free and Hierarchical Structures in Complex Networks L. Barabasi, Z. Dezso, E. Ravasz, S.H. Yook and Z. Oltvai Presented by Arzucan Özgür.
Community detection in graphs
Social Balance & Transitivity
Networks and Organizations
Network Science: A Short Introduction i3 Workshop
Presentation transcript:

Comparing Snapshots of Networks Shah Jamal Alam and Ruth Meyer Centre for Policy Modelling 28 th March, 2007 – CAVES Bi-annual Meeting, IIASA, Laxenburg, Austria

A General Problem … Consider a simulated network S (N, E) at the start of a simulation run, i.e. at time t=0. N is the set of nodes and E is the set of edges through which the nodes of the graph are connected. The network could be of any structure, e.g. unconnected (E = {Φ}), a small-world network, or a scale-free network. At every time step, x: x  (0,  ] new agents become a member of N, while y already present agents leave: y  (0, |N|].

Agent-based Social Networks (ABSN) – I The majority of social simulation models assume a fixed number of agents, usually for ‘simplicity sake’. Many agent-based social simulation models have shown that agents’ local interactions can lead to structures such as power-law and small-world networks, where the network’s configuration stabilizes after a sufficient number of simulation runs.

Agent-based Social Networks (ABSN) – II It is usually the case, there are inherent local mechanisms that bias towards such structures. For models where the agent population is constrained by social processes and not on a fixed size, this might not be the case... Even different networks with similar global properties such as clustering coefficient, can have varying local structures

Example from two Agent-based Models The first is by Jin et al. (2001): Structure of growing social networks. Phys. Rev. E. The American Physical Society 64(4) Second is based on from the South African case study concerning the impact of HIV/AIDS. The two different models are different in terms of scale, context, purpose, granularity (level of abstraction) We are looking on the network signatures from the simulation

The model for growing friendship networks by Jin et al. (2001) Assumes a fix number of agents (250) Based on three rules: –“meetings take place between pairs of individuals at a rate which is high if a pair has one or more mutual friends and low otherwise; –acquaintances between pairs of individuals who rarely meet decay over time –there is an upper limit on the number of friendships an individual can maintain.” Demonstrates the evolution of ‘small-world’ like structure from agents’ acting on the above rules.

The model for growing friendship networks by Jin et al. (2001)

Comparing the network’s snapshots … We compare network snapshots, P= {P 0, P 0+ , P 0+2 ,…}, where each element P i represents a distinct population of agents, P 0 being the population at t=0.  defines the time lag. A 2-population (independent) Kolmogorov- Smirnov (K-S) test is performed for the degree distribution each consecutive population pair (P i, P i+  ). The idea is to determine if two datasets from two population samples differ significantly.

Comparing the network’s snapshots … Y-axis: P-score of the K-S test for the degree distribution of the friendship network compared for consecutive snapshots taken at every (left) 100 th tick and (right) 25 th time step.

The agents’ network grew in the initial steps and the similarity in the network configuration continued to increase From the figures in the previous slide, we can see that the network structure stabilizes around 100th step

A Model for Impact of HIV/AIDS – I The model focuses on the behaviour of individual agents as well as that of households and thus attempts to take into account both the individual interactions and the decisions taken by the households. Agents are born and die during the simulation … the population size depends upon social processes and not based on any fixed mechanism… the mode details have been presented already

A Model for Impact of HIV/AIDS – II The simulations were initialized with 30 households at the start, with the number of adult and senior agents around 150 at the start. Every agent has an expected life … but may die due to malnutrition, AIDS… Birth of agents depends upon the marriages and the fertility of a mother infected from HIV/AIDS … In sum: The size and the network composition cannot be assumed in advance. The three rules from Jin et al. was plugged in the model for the agents’ friendship network.

First suit of simulation: Three different settings: Case – I: we removed the random removal rule from Jin et al. Case – II: incorporated all the three rules. Agents also developed friendship ties when they join the same club for the above two cases. Case – III: just the three rules from Jin et al. to make friendship ties …

First suit of simulation: Three different settings

Second suit of simulation: Three different settings Case – I: no birth of an agent was possible, while all other processes continued in the model. Case – II: Case-II was set with only the new agents joining the simulation through marriages and birth processes but no agent was set to die during the simulation run. Case – III: was when the initial population of the agents continued throughout the run and no new agents joined or existing agents died at all.

Second suit of simulation: Three different settings

Outlook – I … Without the birth and death of agents during the simulation, the agents’ friendship network shows the similar signature, in our context, the clustering coefficient as in the first model. This supports the conjecture that network signatures are affected when the agents’ population size is governed by the underlying social processes.

Outlook – II The main motivation has been to look for techniques that can help keep track of the network structure over the course of a simulation run. Global measures aggregate the network characteristics … the snapshots are compared on the output number Other techniques, such as, use of the Kolmogorov-Smirnov statistic can give us more insight about the changes in the network structure…

Outlook – III Networks sharing similar global properties can have significantly varying local structures.

‘motifs’ are subgraph structures that occur in them network far more often than in randomized network ‘complex networks’ community ‘fragments’ are the building blocks of social ties … starting from dyads to simplest forms of social networks  triads social networks community Networks sharing similar global properties can have significantly varying local structures.