Random graphs with a given degree sequence

DOI10.1214/10-AAP728zbMath1234.05206arXiv1005.1136WikidataQ128601361 ScholiaQ128601361MaRDI QIDQ640061

Allan Sly, Persi Diaconis, Sourav Chatterjee

Publication date: 12 October 2011

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

random graphdegree sequencegraph limitthreshold graphsErdős-Gallai criterion

Mathematics Subject Classification ID

Asymptotic properties of parametric estimators (62F12) Central limit and other weak theorems (60F05) Point estimation (62F10) Random graphs (graph-theoretic aspects) (05C80) Computational aspects related to convexity (52B55) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16) Vertex degrees (05C07)

Related Items

Nonparametric discriminant analysis with network structures in predictor, Null models and community detection in multi-layer networks, Affiliation weighted networks with a differentially private degree sequence, Degree sequences of sufficiently dense random uniform hypergraphs, Moments of Uniform Random Multigraphs with Fixed Degree Sequences, Directed Networks with a Differentially Private Bi-degree Sequence, On negative dependence inequalities and maximal scores in round-robin tournaments, Network inference from temporally dependent grouped observations, Motif estimation via subgraph sampling: the fourth-moment phenomenon, Random Simplicial Complexes: Models and Phenomena, A note on a network model with degree heterogeneity and homophily, Some Introductory Notes on Random Graphs, Asymptotic distribution in directed finite weighted random graphs with an increasing bi-degree sequence, Asymptotics of score test in the generalized \(\beta\)-model for networks, Directed weighted random graphs with an increasing bi-degree sequence, Detection thresholds for the \(\beta\)-model on sparse graphs, Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm, Affiliation discrete weighted networks with an increasing degree sequence, Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs, Asymptotic distribution in affiliation finite discrete weighted networks with an increasing degree sequence, Asymptotics in theβ-model for networks with a differentially private degree sequence, Consistency under sampling of exponential random graph models, Asymptotic in the ordered networks with a noisy degree sequence, Degree-based moment estimation for ordered networks, Approximate estimation in a class of directed networks, A note on asymptotic distributions in a network model with degree heterogeneity and homophily, A note on undirected random graph models parameterized by the strengths of vertices, Weighted directed networks with a differentially private bi-degree sequence, Asymptotic in undirected random graph models with a noisy degree sequence, Asymptotics in a probit model for directed networks, Large deviation for uniform graphs with given degrees, Maximum likelihood estimation in the \(\beta\)-model, Concentration and consistency results for canonical and curved exponential-family models of random graphs, Multipodal structure and phase transitions in large constrained graphs, Nonparametric identification in index models of link formation, Longitudinal network models and permutation‐uniform Markov chains, Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon, Graver basis for an undirected graph and its application to testing the beta model of random graphs, A semiparametric Bayesian approach to epidemics, with application to the spread of the coronavirus MERS in South Korea in 2015, Hierarchical models for independence structures of networks, Threshold functions for small subgraphs in simple graphs and multigraphs, Inference in Ising models on dense regular graphs, Time‐varying β‐model for dynamic directed networks, Logical differencing in dyadic network formation models with nontransferable utilities, Inference in a class of directed random graph models with an increasing number of parameters, A network Poisson model for weighted directed networks with covariates, A note on asymptotic distributions in a directed network model with degree heterogeneity and homophily, Asymptotic theory in network models with covariates and a growing number of node parameters, Asymptotic theory in bipartite graph models with a growing number of parameters, VARIETIES OF INTERGOVERNMENTAL ORGANIZATION MEMBERSHIPS AND STRUCTURAL EFFECTS IN THE WORLD TRADE NETWORK, Bivariate gamma model, Learning the distribution of latent variables in paired comparison models with round-robin scheduling, Estimating and understanding exponential random graph models, Multigraph limit of the dense configuration model and the preferential attachment graph, Neural network coding of natural images with applications to pure mathematics, A survey of discrete methods in (algebraic) statistics for networks, The large deviation principle for the Erdős-Rényi random graph, Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters, Exponential-family models of random graphs: inference in finite, super and infinite population scenarios, Testing goodness of fit of random graph models, Asymptotic distributions in affiliation networks with an increasing sequence, On the singularity of adjacency matrices for random regular digraphs, Ensemble equivalence for dense graphs, On the number of non-zero elements of joint degree vectors, Sparse maximum-entropy random graphs with a given power-law degree distribution, Adjustable network reconstruction with applications to CDS exposures, The number of graphs and a random graph with a given degree sequence, Maximum likelihood estimation for discrete exponential families and random graphs, A note on asymptotic distributions in maximum entropy models for networks, On the asymptotics of constrained exponential random graphs, Asymptotics in directed exponential random graph models with an increasing bi-degree sequence, Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs, Degeneracy in sparse ERGMs with functions of degrees as sufficient statistics, Consistent structure estimation of exponential-family random graph models with block structure, Review of statistical network analysis: models, algorithms, and software, Consistent nonparametric estimation for heavy-tailed sparse graphs, Estimating parameters of a directed weighted graph model with beta-distributed edge-weights, Statistical Inference in a Directed Network Model With Covariates, Limits of sparse configuration models and beyond: graphexes and multigraphexes, Remarks on power-law random graphs, A dynamic network model with persistent links and node-specific latent variables, with an application to the interbank market, Sandwiching dense random regular graphs between binomial random graphs, Matrix estimation by universal singular value thresholding, Unnamed Item, Limits of random trees. II, Statistics of the two star ERGM, On the question of effective sample size in network modeling: an asymptotic inquiry, Asymptotic properties of GEE estimator for clustered ordinal data with high-dimensional covariates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• A theorem on flows in networks
• Limits of dense graph sequences
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
• On exchangeable random variables and the statistics of large graphs and hypergraphs
• Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
• Statistical analysis of network data. Methods and models
• Asymptotic behavior of M-estimators of p regression parameters when \(p^ 2/n\) is large. I. Consistency
• Asymptotic behavior of M estimators of p regression parameters when \(p^ 2/n\) is large. II: Normal approximation
• Asymptotic behavior of likelihood methods for exponential families when the number of parameters tends to infinity
• Representations for partially exchangeable arrays of random variables
• Correction to: Asymptotic behavior of \(M\) estimators of \(p\) regression parameters when \(p^ 2/n\) is large. II: Normal approximation
• Extremal families and systems of sufficient statistics
• Conjugate priors for exponential families
• Asymptotics when the number of parameters tends to infinity in the Bradley-Terry model for paired comparisons
• Asymptotic enumeration by degree sequence of graphs of high degree
• MM algorithms for generalized Bradley-Terry models.
• Threshold graphs and related topics
• An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
• A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
• Subgraphs of Dense Random Graphs with Specified Degrees
• Testability and repair of hereditary hypergraph properties
• Conjugate Parameterizations for Natural Exponential Families
• Combinatorial Properties of Matrices of Zeros and Ones
• Threshold Graph Limits and Random Threshold Graphs
• Graphical Models, Exponential Families, and Variational Inference
• Graph limits and exchangeable random graphs
• An Exponential Family of Probability Distributions for Directed Graphs
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure and Function of Complex Networks
• A critical point for random graphs with a given degree sequence
• What Does a Random Contingency Table Look Like?
• Probability Inequalities for Sums of Bounded Random Variables
• Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications