Showing papers in "Social Networks in 1989"

TL;DR: A simple mathematical model of the evolution of indirect reciprocity is described and analysis suggests that indirect reciprocities is unlikely to be important unless interacting groups are fairly small.

TL;DR: In this paper, a new model of centrality is proposed for networks based on the information contained in all possible paths between pairs of points, which does not require path enumeration and is not limited to the shortest paths or geodesies.

TL;DR: This work proposes a quite different approach to citation networks where the connective threads through a network are preserved and the focus is on the links in the network rather than on the nodes.

TL;DR: Levels-of-selection theory in biology is reviewed and a parallel argument for the human sciences is sketched that a unit becomes organismic to the degree that natural selection operates at the level of that unit.

TL;DR: The structure of the set of all regular equivalences, proving that it forms a lattice, is explored, and a general approach to computing certain elements of the lattice is suggested, which represents a useful complement to the White and Reitz algorithm.

TL;DR: In this paper, a mutation heuristic is introduced under which only forgiving reciprocity can resist Boyd/Lorberbaum invasion in viscous populations; this provides a selective basis for forgiveness and extends TIT FOR TAT's collective stability to evolutionary stability under multiple mutation.

TL;DR: In this article, the authors used a simple counting algorithm to find the n-paths in a binary matrix and described the characteristics of centrality statuses in the grooming network using paths of up to maximum length.

TL;DR: Estimates of indegree centrality in snowball samples that vary in initial sample size, number of stages, and number of choices are examined with the use of computer simulations.

TL;DR: In this paper, the grooming network of a group of free-ranging rhesus monkeys undergoing group fission was examined to examine the social structure of the pre-fission group.

TL;DR: In this article, a variety of quadratic assignment methods are outlined that operationalize these compactness/isolation concepts, and the sampling distributions for each of the indices described are easily generated using Monte Carlo procedures.

TL;DR: In this article, a critique of Mizruchi et al.'s (1986) solution to the problem of quantification of centrality has been presented, taking all possible reflection and derivation of the centrality into account.

TL;DR: In this paper, an empirically-based assessment of the operational procedures routinely used in network analysis reveals serious measurement deficiencies that render spurious images of network structure, and an alternative approach is described that resolves these problems.

TL;DR: The procedure enables us to find several otherwise unknown regular equivalences, including an extension of automorphic equivalence (Everett 1985) that is not sensitive to degree and an approach to role structure analysis in which one examines not just one blocking of actors but a series of increasingly broad simplifications of the data.

TL;DR: In this article, the authors explore two methods for analyzing sociometric data measured on several relations observed at several points in time, where the multirelational, sequential data may be represented in a four-dimensional actors × partners × relations × time points super-sociomatrix.

TL;DR: In this paper, a homogeneous, transitive random network model is described and the exact distribution of the number of arcs that contain a given vertex is given for networks with large numbers of vertices.