Non Parametric Statistics of Dynamic Networks with distinguishable nodes

Abstract

The study of random graphs and networks had an explosive development in the last couple of decades. Meanwhile, techniques for the statistical analysis of sequences of networks were less developed. In this paper we focus on networks sequences with a fixed number of labeled nodes and study some statistical problems in a nonparametric framework. We introduce natural notions of center and a depth function for networks that evolve in time. We develop several statistical techniques including testing, supervised and unsupervised classification, and some notions of principal component sets in the space of networks. Some examples and asymptotic results are given, as well as two real data examples.

24 pages, 6 figures. Title changed, Test (2017)

References in corpus (9)

• Modularity and community structure in networks
• Stochastic blockmodels and community structure in networks
• Modern temporal network theory: A colloquium
• Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys
• Inferring the mesoscale structure of layered, edge-valued and time-varying networks
• How complex climate networks complement eigen techniques for the statistical analysis of climatological data
• Dynamic stochastic blockmodels: Statistical models for time-evolving networks
• The notion of $\psi$-weak dependence and its applications to bootstrapping time series
• Growing Networks: Limit in-degree distribution for arbitrary out-degree one