Random networks, graphical models and exchangeability
From MaRDI portal
Abstract: We study conditional independence relationships for random networks and their interplay with exchangeability. We show that, for finitely exchangeable network models, the empirical subgraph densities are maximum likelihood estimates of their theoretical counterparts. We then characterize all possible Markov structures for finitely exchangeable random graphs, thereby identifying a new class of Markov network models corresponding to bidirected Kneser graphs. In particular, we demonstrate that the fundamental property of dissociatedness corresponds to a Markov property for exchangeable networks described by bidirected line graphs. Finally we study those exchangeable models that are also summarized in the sense that the probability of a network only depends onthe degree distribution, and identify a class of models that is dual to the Markov graphs of Frank and Strauss (1986). Particular emphasis is placed on studying consistency properties of network models under the process of forming subnetworks and we show that the only consistent systems of Markov properties correspond to the empty graph, the bidirected line graph of the complete graph, and the complete graph.
Recommendations
Cited in
(31)- Statistical evaluation of algebraic constraints for social networks
- Network representation using graph root distributions
- Community detection with dependent connectivity
- Discussion to: ``Bayesian graphical models for modern biological applications by Y. Ni, V. Baladandayuthapani, M. Vannucci and F. C. Stingo
- Concentration and consistency results for canonical and curved exponential-family models of random graphs
- On finite exchangeability and conditional independence
- Exponential-family random graph models for multi-layer networks
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- New exploratory tools for extremal dependence: \(\chi \) networks and annual extremal networks
- Consistent structure estimation of exponential-family random graph models with block structure
- Parties and networks: Stochastic models for relationship networks
- Algebraic statistics for a directed random graph model with reciprocation
- Exchangeable Rasch matrices
- Graphical models for complex networks: an application to Italian museums
- Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities
- On the number of non-zero elements of joint degree vectors
- On exchangeability in network models
- Quantifying Statistical Interdependence by Message Passing on Graphs—Part II: Multidimensional Point Processes
- Harmonic analysis of symmetric random graphs.
- Exchangeable random networks
- Longitudinal network models and permutation‐uniform Markov chains
- Hierarchical models for independence structures of networks
- Hierarchical Network Models for Exchangeable Structured Interaction Processes
- U-Statistics on bipartite exchangeable networks
- Link Prediction for Egocentrically Sampled Networks
- How social networks influence human behavior: an integrated latent space approach for differential social influence
- Tractably modelling dependence in networks beyond exchangeability
- Pseudo-likelihood-based M-estimation of random graphs with dependent edges and parameter vectors of increasing dimension
- Hoeffding-type decomposition for U-statistics on bipartite networks
- Multiway empirical likelihood
- Causal inference over stochastic networks
This page was built for publication: Random networks, graphical models and exchangeability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4962075)
