Learning to Generate Networks
Preprint
Abstract
We investigate the problem of learning to generate complex networks from data. Specifically, we consider whether deep belief networks, dependency networks, and members of the exponential random graph family can learn to generate networks whose complex behavior is consistent with a set of input examples. We find that the deep model is able to capture the complex behavior of small networks, but that no model is able capture this behavior for networks with more than a handful of nodes.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Instability, Sensitivity, and Degeneracy of Discrete Exponential FamiliesJournal of the American Statistical Association, 2011
- An introduction to exponential random graph (p*) models for social networksSocial Networks, 2007
- Recent developments in exponential random graph (p*) models for social networksSocial Networks, 2007
- A Fast Learning Algorithm for Deep Belief NetsNeural Computation, 2006
- Training Products of Experts by Minimizing Contrastive DivergenceNeural Computation, 2002
- Position in formal structure, personal characteristics and choices of advisors in a law firm: A logistic regression model for dyadic network dataSocial Networks, 1997
- Modified Randomization Tests for Nonparametric HypothesesThe Annals of Mathematical Statistics, 1957