Entropies of tailored random graph ensembles: bipartite graphs, generalized degrees, and node neighbourhoods

E. Roberts, A. Coolen

Journal of Physics A 47, 435101 (2014)

#randomgraphs#entropy#machinelearning

Download the PDF

LQ placeholderEnsembles of tailored random graphs allow us to reason quantitatively about the complexity of system.

Ensembles of tailored random graphs allow us to reason quantitatively about the complexity of system.

We calculate explicit formulae for the Shannon entropies of several families of tailored random graph ensembles for which no such formulae were as yet available, in leading orders in the system size. These include bipartite graph ensembles with imposed (and possibly distinct) degree distributions for the two node sets, graph ensembles constrained by specified node neigh- bourhood distributions, and graph ensembles constrained by specified gen- eralized degree distributions.

LQ placeholder

Imaginary replica analysis of loopy regular random graphs

F. Lopez, T. Coolen

Sub. to Journal of Physics A

LQ placeholder

Taming complexity

M. Reeves, S. Levin, T. Fink, A. Levina

Harvard Business Review

LQ placeholder

Degree-correlations in a bursting dynamic network model

F. Vanni, P. Barucca

Journal of Economic Interaction and Coordination

LQ placeholder

Scale of non-locality for a system of n particles

S. Talaganis, I. Teimouri

Sub. to Physical Review D

LQ placeholder

How much can we influence the rate of innovation?

T. Fink, M. Reeves

Science Advances

123 / 123 papers