Open Access
2007 Exchangeable Random Networks
F. Bassetti,, M. Cosentino Lagomarsino, S. Mandrà
Internet Math. 4(4): 357-400 (2007).


We introduce and study a class of exchangeable random graph ensembles. They can be used as statistical null models for empirical networks, and as a tool for theoretical investigations. We provide general theorems that characterize the degree distribution of the ensemble graphs, together with some features that are important for applications, such as subgraph distributions and kernel of the adjacency matrix. A particular case of directed networks with power-law out–degree is studied in more detail, as an example of the flexibility of the model in applications.


Download Citation

F. Bassetti,. M. Cosentino Lagomarsino. S. Mandrà. "Exchangeable Random Networks." Internet Math. 4 (4) 357 - 400, 2007.


Published: 2007
First available in Project Euclid: 27 May 2009

zbMATH: 1206.68028
MathSciNet: MR2522949

Rights: Copyright © 2007 A K Peters, Ltd.

Vol.4 • No. 4 • 2007
Back to Top