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
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.
Imaginary replica analysis of loopy regular random graphs
F. Lopez, T. Coolen
Sub. to Journal of Physics A
Degree-correlations in a bursting dynamic network model
F. Vanni, P. Barucca
Journal of Economic Interaction and Coordination
Phase transition creates the geometry of the continuum from discrete space
R. Farr, T. Fink
Physical Review E
Intelligently chosen interventions have potential to outperform the diode bridge in power conditioning
F. Liu, Y. Zhang, O. Dahlsten, F. Wang
Scientific Reports
123 / 123 papers