Sciweavers

Share
JMLR
2012

Graphlet decomposition of a weighted network

8 years 6 months ago
Graphlet decomposition of a weighted network
We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combines EM with Bron-Kerbosch in a novel fashion, for estimating the parameters of the model underlying graphlets using one network sample. We explore theoretical properties of graphlets, including computational complexity, redundancy and expected accuracy. We test graphlets on synthetic data, and we analyze messaging on Facebook and crime associations in the 19th century.
Hossein Azari Soufiani, Edo Airoldi
Added 27 Sep 2012
Updated 27 Sep 2012
Type Journal
Year 2012
Where JMLR
Authors Hossein Azari Soufiani, Edo Airoldi
Comments (0)
books