Tailored graph ensembles as proxies or null models for real networks II: results on directed graphs

Our approach gives a rigorous quantitative method for prioritising network properties.

Journal of Physics A 44, 275002 (2011)

E. Roberts, T. Schlitt, A. Coolen

LQ placeholderOur approach gives a rigorous quantitative
method for prioritising network properties.

We generate new mathematical tools with which to quantify the macroscopic topological structure of large directed networks. This is achieved via a statistical mechanical analysis of constrained maximum entropy ensembles of directed random graphs with prescribed joint distributions for in- and out-degrees and prescribed degree–degree correlation functions. We calculate exact and explicit formulae for the leading orders in the system size of the Shannon entropies and complexities of these ensembles, and for information-theoretic distances. The results are applied to data on gene regulation networks.

LQ placeholder

The space of functions computed by deep layered machines

A. Mozeika, B. Li, D. Saad

Sub. to Physical Review Letters

LQ placeholder

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

LQ placeholder

Taming complexity

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

Harvard Business Review

LQ placeholder

Replica analysis of Bayesian data clustering

A. Mozeika, T. Coolen

Journal of Physics A

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

123 / 123 papers