Markov Graphs
Necessary definitions and notations are introduced in section 2. Probability functions are represented in exponential form and by summation, as two possible alternatives. Side conditions permit to identify the interaction function \(\lambda_ A\) of a set A of subindexes i in the set of m discrete random variables. Then the dependence graph D on a vertex set M is introduced. Using these results, the probability function of a random graph G is characterized in Theorem 1. It is a log-linear model. Sufficient statistics are fixed and they indicate the sufficient subgraphs of G. Two examples illustrate the concepts and results. Theorem 2 gives the log-linear model and the sufficient statistics for a Markov graph and Theorem 3 for an undirected and homogeneous Markov graph. Inference for Markov graphs is studied and the difficulties for obtaining maximum likelihood estimators are discussed. The use of a Metropolis procedure, say a thermodynamic simulation method, permits to obtain the maximum. The logit regression is also proposed and maximum likelihood estimators are derived for generated random graphs. Random directed graphs with a certain structure are characterized by fixing their probabilistic structure. The corresponding model is a log-linear one. Also, Markov graphs under directed graphs and Markov homogeneous directed graph are studied. The characterizations are given in Theorems 4, 5 and 6. Various graphics and tables illustrate the results. Hammersley-Clifford theorem is used for describing the dependence structures related with the different cases.
- Generating random networks from a given distribution
- Exponential-family random graph models for valued networks
- Asymptotic normality of graph statistics
- Triad count statistics
- Contagion distributions for defining disease clustering in time
- Metric inference for social networks
- Probabilistic models in cluster analysis
- Latent space modelling of multidimensional networks with application to the exchange of votes in Eurovision song contest
- Statistical evaluation of algebraic constraints for social networks
- Using retrospective sampling to estimate models of relationship status in large longitudinal social networks
- A network-based approach to modeling and predicting product coconsideration relations
- Minimum distance estimators of population size from snowball samples using conditional estimation and scaling of exponential random graph models
- Double instrumental variable estimation of interaction models with big data
- A statistical social network model for consumption data in trophic food webs
- Bayesian inference and testing of group differences in brain networks
- Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality
- On the geometry of discrete exponential families with application to exponential random graph models
- Discrete temporal models of social networks
- The local structure of globalization
- A statistical framework for modern network science
- Identifying overlapping terrorist cells from the Noordin Top actor-event network
- Community detection with dependent connectivity
- Structural factorization of latent adjacency matrix, with an application to auto industry networks
- Online network monitoring
- Bayesian dynamic network actor models with application to South Korean COVID-19 patient movement data
- Link prediction techniques, applications, and performance: a survey
- Collaboration mechanisms and community detection of statisticians based on ERGMs and \(k\)NN-walktrap
- Statistics of the two star ERGM
- Modeling transitivity in local structure graph models
- 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
- Correcting for differential recruitment in respondent-driven sampling data using ego-network information
- Modeling heterogeneous peer assortment effects using finite mixture exponential random graph models
- Posterior contraction rates for stochastic block models
- Exponential-family random graph models for multi-layer networks
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Bayesian model selection for high-dimensional Ising models, with applications to educational data
- Logit models and logistic regressions for social networks. III: Valued relations
- Approximating stationary distributions of fast mixing Glauber dynamics, with applications to exponential random graphs
- Scalable and exact sampling method for probabilistic generative graph models
- The geometry of continuous latent space models for network data
- Degeneracy in sparse ERGMs with functions of degrees as sufficient statistics
- Consistent structure estimation of exponential-family random graph models with block structure
- Modeling community structure and topics in dynamic text networks
- Network firewall dynamics and the subsaturation stabilization of HIV
- Outliers and influential observations in exponential random graph models
- A note on parallel sampling in Markov graphs
- Dynamic stochastic block models: parameter estimation and detection of changes in community structure
- Degree-based moment estimation for ordered networks
- Estimating and understanding exponential random graph models
- Critical phenomena in exponential random graphs
- Model-based clustering of large networks
- Network models for social influence processes
- Evolution of social networks
- Topological variability of collectives and its import for social epistemology
- Sensitivity of MRQAP tests to collinearity and autocorrelation conditions
- On the question of effective sample size in network modeling: an asymptotic inquiry
- A tutorial on methods for the modeling and analysis of social network data
- Conditional independence in dynamic networks
- Conditional estimation of exponential random graph models from snowball sampling designs
- Random graph models for temporal processes in social networks*
- Poisson approximation of subgraph counts in stochastic block models and a graphon model
- Conditional marginalization for exponential random graph models
- Regression analysis of asymmetric pairs in large-scale network data
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
- Model-based clustering for populations of networks
- Exploring dependence structures in the international arms trade network: A network autocorrelation approach
- Multiresolution Network Models
- Simulating Markov Random Fields With a Conclique-Based Gibbs Sampler
- Continuous Time Markov Processes on Graphs
- Exponential random simplicial complexes
- Sensitivity to noise variance in a social network dynamics model
- Local Structural Properties and Attribute Characteristics in 2-mode Networks: p∗ Models to Map Choices of Theater Events1
- Consistency under sampling of exponential random graph models
- Exponential Random Graphs as Models of Overlay Networks
- Integration of human behavioural aspects in a dynamic model for a manufacturing system
- scientific article; zbMATH DE number 3907513 (Why is no real title available?)
- Bayesian dynamic financial networks with time-varying predictors
- Statistical analysis of change in networks
- Asymptotic distributions in random graphs with applications to social networks
- Triad count estimation in digraphs
- Models for network evolution
- Consensus analysis of three‐way social network data
- Extended dynamic subgraph statistics using h-index parameterized data structures
- A BAYESIAN APPROACH TO MODELING STOCHASTIC BLOCKSTRUCTURES WITH COVARIATES
- On the asymptotics of constrained exponential random graphs
- Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters
- Recovering social networks from individual attributes
- Asymptotic structure and singularities in constrained directed graphs
- Random networks, graphical models and exchangeability
- On the equivalence of the edge/isolate and edge/concurrent tie ERGM families, and their extensions
- Analyzing local and global properties of multigraphs
- A decoupled exponential random graph model for prediction of structure and attributes in temporal social networks
- Modeling the dynamics of social networks using Bayesian hierarchical blockmodels
- Review of statistical network analysis: models, algorithms, and software
- Spatial modeling of brain connectivity data via latent distance models with nodes clustering
- Bayesian regression with undirected network predictors with an application to brain connectome data
- Local graph stability in exponential family random graph models
- A perfect sampling method for exponential family random graph models
- A dynamic process reference model for sparse networks with reciprocity
This page was built for publication: Markov Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745877)