Generating Maximally Disassortative Graphs with Given Degree Distribution

References

• Alderson DL, Li L (2007) Diversity of graphs with highly variable connectivity. Phys. Rev. E 75(4):046102.Google Scholar
• Bassler KE, Del Genio CI, Erdős PL, Miklós I, Toroczkai Z (2015) Exact sampling of graphs with prescribed degree correlations. New J. Phys. 17(8):083052.Google Scholar
• Bollobás B (1980) A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Eur. J. Combinatorics 1(4):311–316.Google Scholar
• Chen N, Olvera-Cravioto M (2015) Efficient simulation for branching linear recursions. Proc. Winter Simulation Conf., WSC’15 (IEEE, Piscataway, NJ), 2716–2727.Google Scholar
• Deprez P, Wüthrich MV (2015) Construction of directed assortative configuration graphs. Preprint arXiv:1510.00575.Google Scholar
• Hurd T (2015) The construction and properties of assortative configuration graphs. Preprint arXiv:1512.03084.Google Scholar
• Kannan R, Tetali P, Vempala S (1999) Simple markov-chain algorithms for generating bipartite graphs and tournaments. Random Structures and Algorithms 14(4):293–308.Google Scholar
• Maslov S, Sneppen K (2002) Specificity and stability in topology of protein networks. Science 296(5569):910–913.Google Scholar
• Menche J, Valleriani A, Lipowsky R (2010) Asymptotic properties of degree-correlated scale-free networks. Phys. Rev. E 81(4):046103.Google Scholar
• Mesfioui M, Tajar A (2005) On the properties of some nonparametric concordance measures in the discrete case. Nonparametric Statist. 17(5):541–554.Google Scholar
• Molloy M, Reed B (1995) A critical point for random graphs with a given degree sequence. Random Structures and Algorithms 6(2–3):161–180.Google Scholar
• Newman ME (2002) Assortative mixing in networks. Phys. Rev. Lett. 89(20):208701.Google Scholar
• Newman ME, Strogatz SH, Watts DJ (2001) Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64(2):026118.Google Scholar
• Schweizer B, Wolff EF (1981) On nonparametric measures of dependence for random variables. Ann. Statist. 9(4):879–885.Google Scholar
• Spearman C (1904) The proof and measurement of association between two things. Amer. J. Psych. 15(1):72–101.Google Scholar
• Stanton I, Pinar A (2012) Constructing and sampling graphs with a prescribed joint degree distribution. J. Experiment. Algorithmics 17:3–5.Google Scholar
• Van Der Hofstad R (2016) Random Graphs and Complex Networks, Vol. 1 (Cambridge University Press, New York).Google Scholar
• Van Der Hofstad R, Litvak N (2014) Degree-degree dependencies in random graphs with heavy-tailed degrees. Internet Math. 10(3–4):287–334.Google Scholar
• Van Der Hoorn P (2016) Asymptotic analysis of network structures: Degree-degree correlations and directed paths. Ph.D. thesis, University of Twente.Google Scholar
• Van Der Hoorn P, Litvak N (2014) Convergence of rank based degree-degree correlations in random directed networks. Moscow J. Combinatorics and Number Theory 4(4):45–83.Google Scholar
• Van Der Hoorn P, Litvak N (2015) Degree-degree dependencies in directed networks with heavy-tailed degrees. Internet Math. 11(2):155–179.Google Scholar
• Villani C (2008) Optimal Transport: Old and New, Vol. 338 (Springer, Berlin).Google Scholar
• Xulvi-Brunet R, Sokolov I (2004) Reshuffling scale-free networks: From random to assortative. Phys. Rev. E 70(6):066102.Google Scholar
• Yang D, Pan L, Zhou T (2017) Lower bound of assortativity coefficient in scale-free networks. Chaos: An Interdisciplinary J. Nonlinear Sci. 27(3):033113.Google Scholar