On the number of non-zero elements of joint degree vectors

MaRDI QIDQ521382zbMATH OpenFDO

Authors Éva Czabarka, Johannes Rauh, Kayvan Sadeghi, Taylor Short, László A. Székely

Publication date 10 April 2017

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1511.01035, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i1p55

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

degree sequenceexponential random graph modeljoint degree matrixjoint degree distributionjoint degree vector

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Abstract: Joint degree vectors give the number of edges between vertices of degree $i$ and degree $j$ for $1leilejlen-1$ in an $n$-vertex graph. We find lower and upper bounds for the maximum number of nonzero elements in a joint degree vector as a function of $n$. This provides an upper bound on the number of estimable parameters in the exponential random graph model with bidegree-distribution as its sufficient statistics.

Recommendations

• On realizations of a joint degree matrix
• Joint vertex degrees in the inhomogeneous random graph model \(\mathcal g(n, \{p_{ij}\})\)
• Asymptotic enumeration by degree sequence of graphs of high degree
• Degree sequences of random digraphs and bipartite graphs
• Joint degree distributions of preferential attachment random graphs

Cites work

• scientific article; zbMATH DE number 44577 (Why is no real title available?)
• scientific article; zbMATH DE number 3602484 (Why is no real title available?)
• A sequential importance sampling algorithm for generating random graphs with prescribed degrees
• Approximating faces of marginal polytopes in discrete hierarchical models
• Connected realizations of joint-degree matrices
• Constructing and sampling graphs with a prescribed joint degree distribution
• Graph annotations in modeling complex network topologies
• Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
• Maximum likelihood estimation in the -model
• On realizations of a joint degree matrix
• Random graphs with a given degree sequence
• Random networks, graphical models and exchangeability
• Relations between graphs and integer-pair sequences
• Statistical analysis of change in networks
• The Structure and Function of Complex Networks

Cited in

(3)

• On realizations of a joint degree matrix
• Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions
• Assortativity and bidegree distributions on Bernoulli random graph superpositions

This page was built for publication: On the number of non-zero elements of joint degree vectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521382)