Generating Maximally Disassortative Graphs with Given Degree Distribution
From MaRDI portal
Publication:5113876
DOI10.1287/stsy.2017.0006zbMath1442.05212arXiv1607.01742OpenAlexW2963882047MaRDI QIDQ5113876
Egor Samosvat, Pim Van der Hoorn, Liudmila Ostroumova Prokhorenkova
Publication date: 18 June 2020
Published in: Stochastic Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.01742
Measures of association (correlation, canonical correlation, etc.) (62H20) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Convergence of rank based degree-degree correlations in random directed networks
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- On nonparametric measures of dependence for random variables
- The Construction and Properties of Assortative Configuration Graphs
- A critical point for random graphs with a given degree sequence
- Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
- Degree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees
- Exact sampling of graphs with prescribed degree correlations
- Constructing and sampling graphs with a prescribed joint degree distribution
- On the properties of some nonparametric concordance measures in the discrete case
