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.
|Titolo:||Exchangeable random networks|
COSENTINO LAGOMARSINO, MARCO (Secondo)
MANDRA', SALVATORE (Ultimo)
|Data di pubblicazione:||2007|
|Digital Object Identifier (DOI):||10.1080/15427951.2007.10129152|
|Appare nelle tipologie:||01 - Articolo su periodico|