Construction of Directed Assortative Configuration Graphs

Constructions of directed configuration graphs based on a given bi-degree distribution were introduced in random graph theory some years ago. These constructions lead to graphs where the degrees of two nodes belonging to the same edge are independent. However, it is observed that many real-life networks are assortative, meaning that edges tend to connect low degree nodes with high degree nodes, or variations thereof. In this article we provide an explicit algorithm to construct directed assortative configuration graphs based on a given bi-degree distribution and an arbitrary pre-specified assortativity.

[1]  Piet Van Mieghem,et al.  Distances in random graphs with finite variance degrees , 2005, Random Struct. Algorithms.

[2]  Valentas Kurauskas,et al.  Assortativity and clustering of sparse random intersection graphs , 2012, 1209.4675.

[3]  Edson Bastos e Santos,et al.  Network Structure and Systemic Risk in Banking Systems , 2010 .

[4]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[5]  The Topology of the Federal Funds Market , 2008 .

[6]  Remco van der Hofstad,et al.  Random Graphs and Complex Networks: Volume 1 , 2016 .

[7]  M. Newman,et al.  Mixing patterns in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[9]  Béla Bollobás,et al.  Random Graphs , 1985 .

[10]  N. Wormald.  Differential Equations for Random Processes and Random Graphs , 1995 .

[11]  R. Durrett.  Random Graph Dynamics: References , 2006 .

[12]  Kevin E. Bassler,et al.  Exact sampling of graphs with prescribed degree correlations , 2015, ArXiv.

[13]  Isabelle Stanton,et al.  Constructing and sampling graphs with a prescribed joint degree distribution , 2011, JEAL.

[14]  Christine M. Anderson-Cook,et al.  Book review: quantitative risk management: concepts, techniques and tools, revised edition, by A.F. McNeil, R. Frey and P. Embrechts. Princeton University Press, 2015, ISBN 978-0-691-16627-8, xix + 700 pp. , 2017, Extremes.

[15]  Pim van der Hoorn,et al.  Convergence of rank based degree-degree correlations in random directed networks , 2014 .

[16]  Mario V. Wuthrich,et al.  Networks, Random Graphs and Percolation , 2014, 1409.2339.

[17]  Paul Erdös,et al.  On random graphs, I , 1959 .

[18]  J. Gleeson,et al.  A Framework for Analyzing Contagion in Banking Networks , 2011, 1110.4312.

[19]  Nelly Litvak,et al.  Uncovering disassortativity in large scale-free networks. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Rick Durrett,et al.  Random Graph Dynamics (Cambridge Series in Statistical and Probabilistic Mathematics) , 2006 .

[21]  Ningyuan Chen,et al.  Directed Random Graphs with given Degree Distributions , 2012, 1207.2475.

[22]  Walter E. Beyeler,et al.  The topology of interbank payment flows , 2007 .

[23]  T. R. Hurd,et al.  The Construction and Properties of Assortative Configuration Graphs , 2015, 1512.03084.

[24]  Remco van der Hofstad,et al.  Random Graphs and Complex Networks , 2016, Cambridge Series in Statistical and Probabilistic Mathematics.