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

zbMATH Open1358.05256arXiv1511.01035MaRDI QIDQ521382FDOQ521382

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)

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.

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

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

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

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)

Cites Work

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

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)