Entropies of tailored random graph ensembles: bipartite graphs, generalized degrees, and node neighbourhoods
Ensembles of tailored random graphs allow us to reason quantitatively about the complexity of system.
Journal of Physics A 47, 435101 (2014)
E. Roberts, A. Coolen
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.
Network valuation in financial systems
P. Barucca, M. Bardoscia, F. Caccioli, M. D’Errico, G. Visentin, G. Caldarelli, S. Battiston
Mathematical Finance
The space of functions computed by deep layered machines
A. Mozeika, B. Li, D. Saad
Sub. to Physical Review Letters
Replica analysis of overfitting in generalized linear models
T. Coolen, M. Sheikh, A. Mozeika, F. Aguirre-Lopez, F. Antenucci
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
124 / 124 papers