Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Separable Model for Dynamic Networks
159
0
0.0
(
0
)
Added by
Pavel Krivitsky
Publication date
2010
fields
Mathematical Statistics
and research's language is
English
Authors
Pavel N. Krivitsky
Ask ChatGPT about the research
No Arabic abstract
Models of dynamic networks --- networks that evolve over time --- have manifold applications. We develop a discrete-time generative model for social network evolution that inherits the richness and flexibility of the class of exponential-family random graph models. The model --- a Separable Temporal ERGM (STERGM) --- facilitates separable modeling of the tie duration distributions and the structural dynamics of tie formation. We develop likelihood-based inference for the model, and provide computational algorithms for maximum likelihood estimation. We illustrate the interpretability of the model in analyzing a longitudinal network of friendship ties within a school.
rate research
Read More
Many social and other networks exhibit stable size scaling relationships, such that features such as mean degree or reciprocation rates change slowly or are approximately constant as the number of vertices increases. Statistical network models built on top of simple Bernoulli baseline (or reference) measures often behave unrealistically in this respect, leading to the development of sparse reference models that preserve features such as mean degree scaling. In this paper, we generalize recent work on the micro-foundations of such reference models to the case of sparse directed graphs with non-vanishing reciprocity, providing a dynamic process interpretation of the emergence of stable macroscopic behavior.
Dynamic multilayer networks frequently represent the structure of multiple co-evolving relations; however, statistical models are not well-developed for this prevalent network type. Here, we propose a new latent space model for dynamic multilayer networks. The key feature of our model is its ability to identify common time-varying structures shared by all layers while also accounting for layer-wise variation and degree heterogeneity. We establish the identifiability of the models parameters and develop a structured mean-field variational inference approach to estimate the models posterior, which scales to networks previously intractable to dynamic latent space models. We demonstrate the estimation procedures accuracy and scalability on simulated networks. We apply the model to two real-world problems: discerning regional conflicts in a data set of international relations and quantifying infectious disease spread throughout a school based on the students daily contact patterns.
Latent space models are popular for analyzing dynamic network data. We propose a variational approach to estimate the model parameters as well as the latent positions of the nodes in the network. The variational approach is much faster than Markov chain Monte Carlo algorithms, and is able to handle large networks. Theoretical properties of the variational Bayes risk of the proposed procedure are provided. We apply the variational method and latent space model to simulated data as well as real data to demonstrate its performance.
In relational event networks, the tendency for actors to interact with each other depends greatly on the past interactions between the actors in a social network. Both the quantity of past interactions and the time that elapsed since the past interactions occurred affect the actors decision-making to interact with other actors in the network. Recently occurred events generally have a stronger influence on current interaction behavior than past events that occurred a long time ago--a phenomenon known as memory decay. Previous studies either predefined a short-run and long-run memory or fixed a parametric exponential memory using a predefined half-life period. In real-life relational event networks however it is generally unknown how the memory of actors about the past events fades as time goes by. For this reason it is not recommendable to fix this in an ad hoc manner, but instead we should learn the shape of memory decay from the observed data. In this paper, a novel semi-parametric approach based on Bayesian Model Averaging is proposed for learning the shape of the memory decay without requiring any parametric assumptions. The method is applied to relational event history data among socio-political actors in India.
Researchers are often interested in treatment effects on outcomes that are only defined conditional on a post-treatment event status. For example, in a study of the effect of different cancer treatments on quality of life at end of follow-up, the quality of life of individuals who die during the study is undefined. In these settings, a naive contrast of outcomes conditional on the post-treatment variable is not an average causal effect, even in a randomized experiment. Therefore the effect in the principal stratum of those who would have the same value of the post-treatment variable regardless of treatment, such as the always survivors in a truncation by death setting, is often advocated for causal inference. While this principal stratum effect is a well defined causal contrast, it is often hard to justify that it is relevant to scientists, patients or policy makers, and it cannot be identified without relying on unfalsifiable assumptions. Here we formulate alternative estimands, the conditional separable effects, that have a natural causal interpretation under assumptions that can be falsified in a randomized experiment. We provide identification results and introduce different estimators, including a doubly robust estimator derived from the nonparametric influence function. As an illustration, we estimate a conditional separable effect of chemotherapies on quality of life in patients with prostate cancer, using data from a randomized clinical trial.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
