Empirically Classifying Network Mechanisms
Ryan E. Langendorf, Matthew G. Burgess

TL;DR
This paper presents an empirical method to classify network data based on underlying mechanisms, revealing many real networks do not fit common models and often involve multiple mechanisms.
Contribution
The authors introduce a classification approach that tests network data against candidate mechanisms, enabling mechanistic insights and identifying the prevalence of unmodeled or mixed mechanisms.
Findings
Most empirical networks do not match common mechanisms.
Mixtures of mechanisms are common and often unidentifiable.
The approach accurately predicts functional properties despite unidentifiability.
Abstract
Network models are used to study interconnected systems across many physical, biological, and social disciplines. Such models often assume a particular network-generating mechanism, which when fit to data produces estimates of mechanism-specific parameters that describe how systems function. For instance, a social network model might assume new individuals connect to others with probability proportional to their number of pre-existing connections ('preferential attachment'), and then estimate the disparity in interactions between famous and obscure individuals with similar qualifications. However, without a means of testing the relevance of the assumed mechanism, conclusions from such models could be misleading. Here we introduce a simple empirical approach which can mechanistically classify arbitrary network data. Our approach compares empirical networks to model networks from a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
