arXiv Analytics

Sign in

arXiv:1908.02375 [math.PR]AbstractReferencesReviewsResources

Limit Theorems for Data with Network Structure

Guido M. Kuersteiner

Published 2019-08-06Version 1

This paper develops new limit theory for data that are generated by networks or more generally display cross-sectional dependence structures that are governed by observable and unobservable characteristics. Strategic network formation models are an example. Wether two data points are highly correlated or not depends on draws from underlying characteristics distributions. The paper defines a measure of closeness that depends on primitive conditions on the distribution of observable characteristics as well as functional form of the underlying model. A summability condition over the probability distribution of observable characteristics is shown to be a critical ingredient in establishing limit results. The paper establishes weak and strong laws of large numbers as well as a stable central limit theorem for a class of statistics that include as special cases network statistics such as average node degrees or average peer characteristics. Some worked examples illustrating the theory are provided.

Related articles: Most relevant | Search more
arXiv:0903.4373 [math.PR] (Published 2009-03-25, updated 2009-03-26)
A note on the distribution of the maximum of a set of Poisson random variables
arXiv:1401.1442 [math.PR] (Published 2014-01-07, updated 2014-09-11)
Random partitions in statistical mechanics
arXiv:1212.6697 [math.PR] (Published 2012-12-30, updated 2014-10-13)
Distribution of the sum-of-digits function of random integers: a survey