Statistical inference on attributed random graphs: Fusion of graph features and content

Authors:
John Grothendieck;Carey E. Priebe;Allen L. Gorin
Affiliations:
BBN technologies, United States;Johns Hopkins University, United States;US Department of Defense, United States
Venue:
Computational Statistics & Data Analysis
Year:
2010

Citing 3
Cited 2

Accurate, scalable in-network identification of p2p traffic using application signatures

Proceedings of the 13th international conference on World Wide Web
Scan Statistics on Enron Graphs

Computational & Mathematical Organization Theory
Mixed Membership Stochastic Blockmodels

The Journal of Machine Learning Research

Statistical inference on attributed random graphs: Fusion of graph features and content: An experiment on time series of Enron graphs

Computational Statistics & Data Analysis
Betti numbers of graphs with an application to anomaly detection

Statistical Analysis and Data Mining

Quantified Score

Hi-index	0.03

Visualization

Abstract

Many problems can be cast as statistical inference on an attributed random graph. Our motivation is change detection in communication graphs. We prove that tests based on a fusion of graph-derived and content-derived metadata can be more powerful than those based on graph or content features alone. For some basic attributed random graph models, we derive fusion tests from the likelihood ratio. We describe the regions in parameter space where the fusion improves power, using both numeric results from selected small examples and analytic results on asymptotically large graphs.