A two minute introduction to: Exponential random graph (p*)models for social networks SNAC Workshop, Illinois, November 2005 Garry Robins, University of.

Slides:



Advertisements
Similar presentations
CS188: Computational Models of Human Behavior
Advertisements

An introduction to exponential random graph models (ERGM)
A Tutorial on Learning with Bayesian Networks
Where we are Node level metrics Group level metrics Visualization
The Statistical Analysis of the Dynamics of Networks and Behaviour. An Introduction to the Actor-based Approach. Christian Steglich and Tom Snijders ——————
Introduction to Markov Random Fields and Graph Cuts Simon Prince
Exact Inference in Bayes Nets
METHODS FOR HAPLOTYPE RECONSTRUCTION
Dynamic Bayesian Networks (DBNs)
Pip Pattison University of Melbourne UKSNA, University of Greenwich, June 2013 A hierarchy of exponential random graph models for the analysis of social.
Introduction of Probabilistic Reasoning and Bayesian Networks
Statistical inference for epidemics on networks PD O’Neill, T Kypraios (Mathematical Sciences, University of Nottingham) Sep 2011 ICMS, Edinburgh.
From: Probabilistic Methods for Bioinformatics - With an Introduction to Bayesian Networks By: Rich Neapolitan.
Chapter 8-3 Markov Random Fields 1. Topics 1. Introduction 1. Undirected Graphical Models 2. Terminology 2. Conditional Independence 3. Factorization.
Exponential random graph (p*) models for social networks Workshop Harvard University February 2002 Philippa Pattison Garry Robins Department of Psychology.
Bayesian Networks Chapter 2 (Duda et al.) – Section 2.11
1 Graphical Models in Data Assimilation Problems Alexander Ihler UC Irvine Collaborators: Sergey Kirshner Andrew Robertson Padhraic Smyth.
The formation of coalitions in a new market: The case of Socially Responsible Investments Elise Penalva Icher, University of Lille Filip Agneessens, Ghent.
Network Statistics Gesine Reinert. Yeast protein interactions.
Reduction Techniques Restriction Local Replacement Component Design Examples.
Joint social selection and social influence models for networks: The interplay of ties and attributes. Garry Robins Michael Johnston University of Melbourne,
Belief Propagation, Junction Trees, and Factor Graphs
Maximum-Likelihood estimation Consider as usual a random sample x = x 1, …, x n from a distribution with p.d.f. f (x;  ) (and c.d.f. F(x;  ) ) The maximum.
Today Introduction to MCMC Particle filters and MCMC
5/25/2005EE562 EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS Lecture 16, 6/1/2005 University of Washington, Department of Electrical Engineering Spring 2005.
Exponential Random Graph Models (ERGM) Michael Beckman PAD777 April 9, 2010.
Sunbelt 2009statnet Development Team ERGM introduction 1 Exponential Random Graph Models Statnet Development Team Mark Handcock (UW) Martina.
6. Experimental Analysis Visible Boltzmann machine with higher-order potentials: Conditional random field (CRF): Exponential random graph model (ERGM):
Composition of environmental decision-making networks – a case study in Helsinki, Finland M.Soc.Sc. Arho Toikka HERC Seminar Series Department.
Social Network Analysis and Complex Systems Science
Bayesian Networks What is the likelihood of X given evidence E? i.e. P(X|E) = ?
2 Syntax of Bayesian networks Semantics of Bayesian networks Efficient representation of conditional distributions Exact inference by enumeration Exact.
MGS3100_01.ppt/Aug 25, 2015/Page 1 Georgia State University - Confidential MGS 3100 Business Analysis Introduction - Why Business Analysis Aug 25 and 26,
Markov Random Fields Probabilistic Models for Images
Chapter 3. Community Detection and Evaluation May 2013 Youn-Hee Han
8 Sampling Distribution of the Mean Chapter8 p Sampling Distributions Population mean and standard deviation,  and   unknown Maximal Likelihood.
Neighbourhood-based models for social networks: model specification issues Pip Pattison, University of Melbourne [with Garry Robins, University of Melbourne.
Ch 8. Graphical Models Pattern Recognition and Machine Learning, C. M. Bishop, Revised by M.-O. Heo Summarized by J.W. Nam Biointelligence Laboratory,
Maximum a posteriori sequence estimation using Monte Carlo particle filters S. J. Godsill, A. Doucet, and M. West Annals of the Institute of Statistical.
Slides for “Data Mining” by I. H. Witten and E. Frank.
The famous “sprinkler” example (J. Pearl, Probabilistic Reasoning in Intelligent Systems, 1988)
Markov Chain Monte Carlo for LDA C. Andrieu, N. D. Freitas, and A. Doucet, An Introduction to MCMC for Machine Learning, R. M. Neal, Probabilistic.
Introduction to Statistical Models for longitudinal network data Stochastic actor-based models Kayo Fujimoto, Ph.D.
Exact Inference in Bayes Nets. Notation U: set of nodes in a graph X i : random variable associated with node i π i : parents of node i Joint probability:
Graduate School of Information Sciences, Tohoku University
Bayesian Optimization Algorithm, Decision Graphs, and Occam’s Razor Martin Pelikan, David E. Goldberg, and Kumara Sastry IlliGAL Report No May.
04/21/2005 CS673 1 Being Bayesian About Network Structure A Bayesian Approach to Structure Discovery in Bayesian Networks Nir Friedman and Daphne Koller.
Network Science K. Borner A.Vespignani S. Wasserman.
Anonymous communication over social networks Shishir Nagaraja and Ross Anderson Security Group Computer Laboratory.
Belief Networks Kostas Kontogiannis E&CE 457. Belief Networks A belief network is a graph in which the following holds: –A set of random variables makes.
Introduction to ERGM/p* model Kayo Fujimoto, Ph.D. Based on presentation slides by Nosh Contractor and Mengxiao Zhu.
Overwiew of Various System Reliability Analysis Methods Kim Hyoung Ju 1.
A fault tree – Based Bayesian network construction for the failure rate assessment of a complex system 46th ESReDA Seminar May 29-30, 2014, Politecnico.
Monte Carlo Sampling to Inverse Problems Wojciech Dębski Inst. Geophys. Polish Acad. Sci. 1 st Orfeus workshop: Waveform inversion.
Canadian Bioinformatics Workshops
Bayesian Networks Chapter 2 (Duda et al.) – Section 2.11 CS479/679 Pattern Recognition Dr. George Bebis.
The Monte Carlo Method/ Markov Chains/ Metropolitan Algorithm from sec in “Adaptive Cooperative Systems” -summarized by Jinsan Yang.
Exponential random graph models for multilevel networks
A p* primer: logit models for social networks
Markov Networks.
Hidden Markov Autoregressive Models
CSCI 5822 Probabilistic Models of Human and Machine Learning
CAP 5636 – Advanced Artificial Intelligence
Markov Random Fields Presented by: Vladan Radosavljevic.
Class #19 – Tuesday, November 3
CS 188: Artificial Intelligence
Markov Networks.
Chapter 14 February 26, 2004.
Introduction to Decision Sciences
Longitudinal Social Network Data
Presentation transcript:

A two minute introduction to: Exponential random graph (p*)models for social networks SNAC Workshop, Illinois, November 2005 Garry Robins, University of Melbourne, Australia Collaborators: Pip Pattison, Tom Snijders, Mark Handcock, Stanley Wasserman (among others)

Statistical modeling of endogenous network processes Guiding principles: Network ties are the outcome of (unobserved) social processes that tend to be local and interactive There are both regularities and irregularities in these local interactive processes We hence construct statistical models in which: local interactivity is permitted and assumptions about form of “local interactions” are explicit regularities are represented by model parameters and estimated from data consequences of local regularities for global network properties can be understood and can also provide an exacting approach to model evaluation

Network topologies: what are the forms of local interactivity? Two tie variables are neighbours if: they share an actorMarkov model (Frank & Strauss, 1986) they share connections realisation-dependent model with two existing ties (Pattison & Robins, 2002; (completing a social circuit)Snijders, Pattison, Robins & Handcock, 2005) There are other possibilities, but these two get us a long way

Exponential random graph models P(X = x) = (1/c) exp{  Q  Q z Q (x)} normalizing quantity parameter network statistic the summation is over all neighbourhoods Q Estimation of parameters: Markov Chain Monte Carlo Maximum Likelihood Models with nodal attributes are also possible: social selection; social influence

Neighbourhoods depend on proximity assumptions Assumptions: two ties are neighbours: if they share an actor Markov if they complete a 4-cycle realisation-dependent* Configurations for neighbourhoods edge 2-star 3-star 4-star …triangle cycle2-triangle and others

New specifications (Snijders, Pattison, Robins & Handcock, 2005) k nodes 2-independent 3-independent … k-independent … 2-path 2-path 2-path k nodes triangle 2-triangle 3-triangle … k-triangle …

Some current issues Work in progress: Further work on model specification: directed networks; multiple networks; bipartite graphs Incorporation of actor attributes Efficiency of estimation Longer term goals: Extend modeling to large-scale social systems, including cross-level interactions Model estimation from sample data Extend capacity to model network evolution, including new specifications Co-evolution of psychological states and network structures