𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Network measures for dyadic interactions: stability and reliability

✍ Scribed by Bernhard Voelkl; Claudia Kasper; Christine Schwab


Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
157 KB
Volume
73
Category
Article
ISSN
0275-2565

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

Social network analysis (SNA) is a general heading for a collection of statistical tools that aim to describe social interactions and social structure by representing individuals and their interactions as graph objects. It was originally developed for the social sciences, but more recently it was also adopted by behavioral ecologists. However, although SNA offers a full range of exciting possibilities for the study of animal societies, some authors have raised concerns about the correct application and interpretation of network measures. In this article, we investigate how reliable and how stable network measures are (i.e. how much variation they show under re‐sampling and how much they are influenced by erroneous observations). For this purpose, we took a data set of 44 nonhuman primate grooming networks and studied the effects of re‐sampling at lower re‐sampling rates than the originally observed ones and the inclusion of two types of errors, “mis‐identification” and “mis‐classification,” on six different network metrics, i.e. density, degree variance, vertex strength variance, edge weight disparity, clustering coefficient, and closeness centrality. Although some measures were tolerant toward reduced sample sizes, others were sensitive and even slightly reduced samples could yield drastically different results. How strongly a metric is affected seems to depend on both the sample size and the structure of the specific network. The same general effects were found for the inclusion of sampling errors. We, therefore, emphasize the importance of calculating valid confidence intervals for network measures and, finally, we suggest a rough research plan for network studies. Am. J. Primatol. 73:731–740, 2011. © 2011 Wiley‐Liss, Inc.


📜 SIMILAR VOLUMES


Polynomial algorithms for estimating net
✍ Eitan Zemel 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 751 KB

## Abstract We consider the problem of calculating the best possible bounds on the reliability of a system given limited information about the joint density function of its components. We show that a polynomial algorithm for this problem exists iff such an algorithm exists for a certain related pro

A decomposition algorithm for network re
✍ A. W. Shogan 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 945 KB

## Abstract Consider a directed, source‐sink network whose arcs either function or fail with known probabilities. This paper presents a decomposition algorithm for the exact computation of the reliability of such a network; that is, the probability that there exists a path from the network's source