A survey of discrete methods in (algebraic) statistics for networks

DOI10.1090/conm/685/13714zbMath1360.05156arXiv1510.02838OpenAlexW2295780336MaRDI QIDQ2979659

Sonja Petrović

Publication date: 25 April 2017

Published in: Algebraic and Geometric Methods in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.02838

zbMATH Keywords

exponential familiesrandom graphsnetwork modelsalgebraic statisticsbalanced graphsMarkov basesbalanced hypergraphsalternating conevertex bi-coloring

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (1)

Blow-up algebras, determinantal ideals, and Dedekind-Mertens-like formulas

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global identifiability of linear structural equation models
• Half-trek criterion for generic identifiability of linear structural equation models
• On the question of effective sample size in network modeling: an asymptotic inquiry
• Maximum likelihood estimation in the \(\beta\)-model
• New results on degree sequences of uniform hypergraphs
• Markov bases in algebraic statistics.
• On realizations of a joint degree matrix
• Statistical models for cores decomposition of an undirected random graph
• Random graphs with a given degree sequence
• Minimal generators of toric ideals of graphs
• Graph-theoretic concepts in computer science. 38th international workshop, WG 2012, Jerusalem, Israel, June 26--28, 2012. Revised selected papers
• Limits of dense graph sequences
• A finiteness theorem for Markov bases of hierarchical models
• Cones of closed alternating walks and trails
• Lectures on algebraic statistics
• A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
• Statistical analysis of network data. Methods and models
• The cone of balanced subgraphs
• Toric ideals generalized by quadratic binomials
• Markov bases for decomposable graphical models
• An invitation to algebraic geometry
• A survey of exact inference for contingency tables. With comments and a rejoinder by the author
• The polytope of degree sequences of hypergraphs
• Bouquet algebra of toric ideals
• A divide-and-conquer algorithm for generating Markov bases of multi-way tables
• Algebraic algorithms for sampling from conditional distributions
• Threshold graphs and related topics
• Relations among conditional probabilities
• Commutative algebra of statistical ranking
• Graver basis for an undirected graph and its application to testing the beta model of random graphs
• Maximum likelihood degree of variance component models
• Likelihood inference in exponential families and directions of recession
• On the geometry of discrete exponential families with application to exponential random graph models
• Towards random uniform sampling of bipartite graphs with given degree sequence
• Nonconvexity of the set of hypergraph degree sequences
• Fixed points of the EM algorithm and nonnegative rank boundaries
• Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases
• Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs
• The maximum likelihood threshold of a graph
• Critical phenomena in exponential random graphs
• Toric algebra of hypergraphs
• Markov bases of three-way tables are arbitrarily complicated
• The space of compatible full conditionals is a unimodular toric variety
• The polytope of degree partitions
• Rapid Mixing and Markov Bases
• Information and Exponential Families
• A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
• Track Layout Is Hard
• A remark on the existence of finite graphs
• $\beta$ models for random hypergraphs with a given degree sequence
• Algebraic Geometry and Statistical Learning Theory
• Handbook of Markov Chain Monte Carlo
• Algebraic statistics for a directed random graph model with reciprocation
• Goodness of Fit of Social Network Models
• Degree-based graph construction
• A Warning on the Use of Chi-Squared Statistics With Frequency Tables With Small Expected Cell Counts
• Generalised confounding with Grobner bases
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• An Exponential Family of Probability Distributions for Directed Graphs
• The Structure and Function of Complex Networks
• Rees algebras of edge ideals
• A Survey of Statistical Network Models
• A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix
• The switch Markov chain for sampling irregular graphs (Extended Abstract)
• Maximum Likelihood Estimation for Linear Gaussian Covariance Models
• Constructing and sampling graphs with a prescribed joint degree distribution
• Sampling Regular Graphs and a Peer-to-Peer Network
• Computing and Combinatorics
• Introducing Monte Carlo Methods with R
• Networks
• Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
• Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs

This page was built for publication: A survey of discrete methods in (algebraic) statistics for networks