Introduction to Statistical Models for longitudinal network data Stochastic actor-based models Kayo Fujimoto, Ph.D.

Slides:



Advertisements
Similar presentations
Statistical Social Network Analysis - Stochastic Actor Oriented Models Johan Koskinen The Social Statistics Discipline Area, School of Social Sciences.
Advertisements

An introduction to exponential random graph models (ERGM)
Where we are Node level metrics Group level metrics Visualization
Rutgers CS440, Fall 2003 Review session. Rutgers CS440, Fall 2003 Topics Final will cover the following topics (after midterm): 1.Uncertainty & introduction.
The Statistical Analysis of the Dynamics of Networks and Behaviour. An Introduction to the Actor-based Approach. Christian Steglich and Tom Snijders ——————
1 How to make a selection table like the one below from SIENA output. The table shows contributions to the objective function for highest / lowest possible.
Ch 11. Sampling Models Pattern Recognition and Machine Learning, C. M. Bishop, Summarized by I.-H. Lee Biointelligence Laboratory, Seoul National.
Gibbs Sampling Qianji Zheng Oct. 5th, 2010.
Using Probabilistic Methods for Localization in Wireless Networks Presented by Adam Kariv May, 2005.
CHAPTER 16 MARKOV CHAIN MONTE CARLO
Hidden Markov Models Fundamentals and applications to bioinformatics.
Planning under Uncertainty
Some results from Scottish data The Statistical Analysis of the Dynamics of Networks and Behaviour: An Application to Smoking and Drinking Behaviour among.
FRIENDSHIP AND DELINQUENCY OF ADOLESCENTS FRIENDSHIP AND DELINQUENCY OF ADOLESCENTS First results of a four wave study on adolescent’s behavior and relations.
HMM-BASED PATTERN DETECTION. Outline  Markov Process  Hidden Markov Models Elements Basic Problems Evaluation Optimization Training Implementation 2-D.
0 Network Effects in Coordination Games Satellite symposium “Dynamics of Networks and Behavior” Vincent Buskens Jeroen Weesie ICS / Utrecht University.
Co-evolution of Members’ Attachment to the Team and Team Interpersonal Networks Chunke Su Noshir Contractor University of Illinois at Urbana-Champaign.
Bayesian Reinforcement Learning with Gaussian Processes Huanren Zhang Electrical and Computer Engineering Purdue University.
Optimal Tuning of Continual Online Exploration in Reinforcement Learning Youssef Achbany, Francois Fouss, Luh Yen, Alain Pirotte & Marco Saerens Information.
1 Hybrid Agent-Based Modeling: Architectures,Analyses and Applications (Stage One) Li, Hailin.
Efficient Methodologies for Reliability Based Design Optimization
Efficient Estimation of Emission Probabilities in profile HMM By Virpi Ahola et al Reviewed By Alok Datar.
Exponential Random Graph Models (ERGM) Michael Beckman PAD777 April 9, 2010.
Planning operation start times for the manufacture of capital products with uncertain processing times and resource constraints D.P. Song, Dr. C.Hicks.
Visual Recognition Tutorial
Sunbelt 2009statnet Development Team ERGM introduction 1 Exponential Random Graph Models Statnet Development Team Mark Handcock (UW) Martina.
Visual Recognition Tutorial1 Markov models Hidden Markov models Forward/Backward algorithm Viterbi algorithm Baum-Welch estimation algorithm Hidden.
MDP Reinforcement Learning. Markov Decision Process “Should you give money to charity?” “Would you contribute?” “Should you give money to charity?” $
CHAPTER 15 S IMULATION - B ASED O PTIMIZATION II : S TOCHASTIC G RADIENT AND S AMPLE P ATH M ETHODS Organization of chapter in ISSO –Introduction to gradient.
Case 1: Optimum inspection and maintenance rates (wind turbine is available during inspection) Case 2: Optimum inspection and maintenance rates (wind turbine.
MAKING COMPLEX DEClSlONS
Exploring the dynamics of social networks Aleksandar Tomašević University of Novi Sad, Faculty of Philosophy, Department of Sociology
Composition of environmental decision-making networks – a case study in Helsinki, Finland M.Soc.Sc. Arho Toikka HERC Seminar Series Department.
Fundamentals of Hidden Markov Model Mehmet Yunus Dönmez.
Stochastic DAG Scheduling using Monte Carlo Approach Heterogeneous Computing Workshop (at IPDPS) 2012 Extended version: Elsevier JPDC (accepted July 2013,
Simulated Annealing.
MEGN 537 – Probabilistic Biomechanics Ch.5 – Determining Distributions and Parameters from Observed Data Anthony J Petrella, PhD.
CS 782 – Machine Learning Lecture 4 Linear Models for Classification  Probabilistic generative models  Probabilistic discriminative models.
APPENDIX D R ANDOM N UMBER G ENERATION Organization of chapter in ISSO* – General description and linear congruential generators Criteria for “good” random.
CHAPTER 5 S TOCHASTIC G RADIENT F ORM OF S TOCHASTIC A PROXIMATION Organization of chapter in ISSO –Stochastic gradient Core algorithm Basic principles.
Suppressing Random Walks in Markov Chain Monte Carlo Using Ordered Overrelaxation Radford M. Neal 발표자 : 장 정 호.
Presentation of the Groningen group plan Marijtje van Duijn ECRP Meeting Ljubljana, Feb. 2, 2012.
Processing Sequential Sensor Data The “John Krumm perspective” Thomas Plötz November 29 th, 2011.
Silesian University of Technology in Gliwice Inverse approach for identification of the shrinkage gap thermal resistance in continuous casting of metals.
A two minute introduction to: Exponential random graph (p*)models for social networks SNAC Workshop, Illinois, November 2005 Garry Robins, University of.
ECE-7000: Nonlinear Dynamical Systems Overfitting and model costs Overfitting  The more free parameters a model has, the better it can be adapted.
CHAPTER 17 O PTIMAL D ESIGN FOR E XPERIMENTAL I NPUTS Organization of chapter in ISSO –Background Motivation Finite sample and asymptotic (continuous)
The final exam solutions. Part I, #1, Central limit theorem Let X1,X2, …, Xn be a sequence of i.i.d. random variables each having mean μ and variance.
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.
1 Chapter 17 2 nd Part Making Complex Decisions --- Decision-theoretic Agent Design Xin Lu 11/04/2002.
1 Chapter 8: Model Inference and Averaging Presented by Hui Fang.
The Unscented Particle Filter 2000/09/29 이 시은. Introduction Filtering –estimate the states(parameters or hidden variable) as a set of observations becomes.
Network Science K. Borner A.Vespignani S. Wasserman.
Lecture 18, CS5671 Multidimensional space “The Last Frontier” Optimization Expectation Exhaustive search Random sampling “Probabilistic random” sampling.
Introduction to ERGM/p* model Kayo Fujimoto, Ph.D. Based on presentation slides by Nosh Contractor and Mengxiao Zhu.
MEGN 537 – Probabilistic Biomechanics Ch.5 – Determining Distributions and Parameters from Observed Data Anthony J Petrella, PhD.
Density Estimation in R Ha Le and Nikolaos Sarafianos COSC 7362 – Advanced Machine Learning Professor: Dr. Christoph F. Eick 1.
Visual Recognition Tutorial1 Markov models Hidden Markov models Forward/Backward algorithm Viterbi algorithm Baum-Welch estimation algorithm Hidden.
Markov Chain Monte Carlo in R
An Introduction to Stochastic Actor-Oriented Models (aka SIENA)
Statistical Models for Automatic Speech Recognition
A p* primer: logit models for social networks
Adoption of Health Information Exchanges and Physicians’ Referral Patterns: Are they Mutually Reinforcing? SAEEDE EFTEKHARI*, School of Management, State.
Hidden Markov Models Part 2: Algorithms
Slides for Introduction to Stochastic Search and Optimization (ISSO) by J. C. Spall CHAPTER 15 SIMULATION-BASED OPTIMIZATION II: STOCHASTIC GRADIENT AND.
Ch13 Empirical Methods.
Topic models for corpora and for graphs
Topic models for corpora and for graphs
Dr. Arslan Ornek MATHEMATICAL MODELS
Longitudinal Social Network Data
Presentation transcript:

Introduction to Statistical Models for longitudinal network data Stochastic actor-based models Kayo Fujimoto, Ph.D.

Stochastic actor-based model (Snijders 2001, 2005) Actor-oriented modeling Actor-oriented modeling –Methodological individualism Modeled as a consequence of actors: Modeled as a consequence of actors: –Making new choices –Withdrawing existing choice –Functions that actors try to maximize Continuous-time Markov chain models Continuous-time Markov chain models –Simulation models

Dependent variable Changing relation network Changing relation network –Number of changed ties between consecutive observations

Independent Variables Change in the network (DV) is modeled as the stochastic result of network effects (such as reciprocity, transitivity, etc.) and covariates Change in the network (DV) is modeled as the stochastic result of network effects (such as reciprocity, transitivity, etc.) and covariates

Model assumptions Full knowledge of the present network Full knowledge of the present network All actors control their outgoing relations All actors control their outgoing relations –A specific actor i has the opportunity to change their relations one at a time at stochastic moment t at a rate ρ m Model specification: changes of single relations Model specification: changes of single relations

Three types of effects Rate function effects Rate function effects –Models the speed by which the DV changes Objective function effects Objective function effects –Models the actors ’ satisfaction with their local network configuration Endowment function effects Endowment function effects –Model the loss of satisfaction incurred when existing network ties are dissolved

Objective function effect Determines probabilistically the tie changes made by the actors Determines probabilistically the tie changes made by the actors Defined as a function of the network Defined as a function of the network –regarded from the perspective of the focus actor Depends on parameters Depends on parameters –estimated from the data

Objective function Network evaluation function for actor i Network evaluation function for actor i –Degree of satisfaction for each actor i in relation x

Structural effects (examples) Outdegree effect (density effect) Outdegree effect (density effect) Reciprocity effect Reciprocity effect Triad effect (transitivity, cycle, balance etc.) Triad effect (transitivity, cycle, balance etc.)

Examples – transitive triplets effect

Covariate effects (V) Covariate-ego effect (sender effect) Covariate-ego effect (sender effect) –Whether actors with higher V values tend to nominate more friends and hence have a higher outdegree Covariate-alter effect (receiver effect) Covariate-alter effect (receiver effect) –Whether actors with higher V values tend to be nominated by more others and hence have higher indegrees Covariate-similarity effect (homophily) Covariate-similarity effect (homophily) –Whether ties tend to occur more often between actors with similar values o n V

Covariate effects (examples) Covariate-ego effect (covariate-related activity) Covariate-ego effect (covariate-related activity) Covariate-alter effect (covariate-related popularity) Covariate-alter effect (covariate-related popularity) Same covariate effect (homophily) Same covariate effect (homophily)

Objective function Actor i chooses alter j that maximize the value of her objective function fi(x) Actor i chooses alter j that maximize the value of her objective function fi(x) Plus random element (Gumbel dist ’ n) Plus random element (Gumbel dist ’ n) –The part of the actor ’ s preference that is not represented by the systematic component of fi(x)

Model Parameters Estimated from observed data Estimated from observed data Stochastic simulation models Stochastic simulation models –MCMC algorithm –Approximate the solution of the Method of Moment

Estimation in SIENA Choose statistics Choose statistics Obtain parameters such that the expected values of the statistics are equal to the observed values Obtain parameters such that the expected values of the statistics are equal to the observed values –Expected values are approximated as the averages over a lot of simulated network –Observed values are calculated from the dataset (target values)

Estimation in SIENA Iterative stochastic simulation algorithm Iterative stochastic simulation algorithm In phase 1: the sensitivity of the statistics to the parameters is determined In phase 1: the sensitivity of the statistics to the parameters is determined In phase 2: provisional parameter values are updated In phase 2: provisional parameter values are updated –Simulate a network based on provisional parameter values –Compute the deviations between these simulated statistics and target values –Update parameter values In phase 3: the final results of phase 2 is used and checked if the average statistic of many simulated networks are close to the targeted values In phase 3: the final results of phase 2 is used and checked if the average statistic of many simulated networks are close to the targeted values –t statistics for deviations from targets

Longitudinal network dynamic models Actor-oriented models of Snijders and colleagues Actor-oriented models of Snijders and colleagues –Assumption: network change driven by actors seeking to optimize particular structural positions Longitudinal versions of ERGM (tie- based version of the model) Longitudinal versions of ERGM (tie- based version of the model) –Assumption: network change driven by change in tie variables (particular social neighborhood of other ties)

References Snijders, T.A.B.(2001). The statistical evaluation of social network dynamics, Sociological Methodology Snijders, T.A.B.(2001). The statistical evaluation of social network dynamics, Sociological Methodology Snijders, T.A.B.(2005). Models for longitudinal network data, chapter 11 in Carrington, P., Scott, J, Wasserman S (eds), models and methods in social network analysis. New York: Cambridge University Press. Snijders, T.A.B.(2005). Models for longitudinal network data, chapter 11 in Carrington, P., Scott, J, Wasserman S (eds), models and methods in social network analysis. New York: Cambridge University Press.