Longitudinal network models and permutation‐uniform Markov chains
From MaRDI portal
Publication:6049789
Abstract: We offer a general approach to modeling longitudinal network data, including exponential random graph models (ERGMs), that vary according to certain discrete-time Markov chains. We connect conditional and Markovian exponential families, permutation-uniform Markov chains, various (temporal) ERGMs, and statistical considerations such as dyadic independence and exchangeability. By removing models' temporal dependence but not interpretability, our approach simplifies analysis of some network and autoregressive models from the literature, including closed-form expressions for maximum likelihood estimators. We also introduce "exponential random -multigraph models", motivated by our result on replacing observations of permutation-uniform Markov chains of graphs with single observations of corresponding multigraphs.
Cites work
- scientific article; zbMATH DE number 3151072 (Why is no real title available?)
- scientific article; zbMATH DE number 3157482 (Why is no real title available?)
- scientific article; zbMATH DE number 4082703 (Why is no real title available?)
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 1220667 (Why is no real title available?)
- scientific article; zbMATH DE number 635762 (Why is no real title available?)
- scientific article; zbMATH DE number 3226562 (Why is no real title available?)
- A dynamic model for social networks†
- A note on sufficiency in regular Markov chains
- A survey of statistical network models
- Algebraic and Geometric Methods in Discrete Mathematics
- An Exponential Family of Probability Distributions for Directed Graphs
- An econometric model of network formation with degree heterogeneity
- Conditional exponential families and a representation theorem for asymptotic inference
- Consistency under sampling of exponential random graph models
- Dependence in probability and statistics
- Discrete temporal models of social networks
- Estimating and understanding exponential random graph models
- Exponential families of stochastic processes
- Goodness of Fit of Social Network Models
- Graphical models, exponential families, and variational inference
- Inequalities: theory of majorization and its applications
- Information and exponential families in statistical theory
- Iterated Random Functions
- Large Sample Inference for Markovian Exponential Families with Application to Branching Processes with Immigration
- Markov Graphs
- Maximum likelihood estimation in log-linear models
- Maximum likelihood estimation in the \(\beta\)-model
- Multilinear tensor regression for longitudinal relational data
- On exchangeability in network models
- Random graph models for temporal processes in social networks*
- Random graphs with a given degree sequence
- Random networks, graphical models and exchangeability
- Realization of an ergodic Markov chain as a random walk subject to a synchronizing road coloring
- SOME THEOREMS AND SUFFICIENCY CONDITIONS FOR THE MAXIMUM-LIKELIHOOD ESTIMATOR OF AN UNKNOWN PARAMETER IN A SIMPLE MARKOV CHAIN
- SUFFICIENCY CONDITIONS IN REGULAR MARKOV CHAINS AND CERTAIN RANDOM WALKS
- Statistical analysis of change in networks
- Statistical inference in a directed network model with covariates
- Sufficiency and Exponential Families for Discrete Sample Spaces
- Sufficient Statistics and Discrete Exponential Families
- Topics at the Frontier of Statistics and Network Analysis
This page was built for publication: Longitudinal network models and permutation‐uniform Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6049789)
