Showing papers in "Social Networks in 1988"

TL;DR: In this paper, the authors argue that the quadratic assignment procedure (QAP) is superior to OLS for testing hypothesis in both simple and multiple regression models based on dyadic data, such as found in network analysis.

TL;DR: This article examined patterns of inbreeding (or homophily) and social distance in data from the 1985 General Social Survey on dyads discussing important matters and found that discussion relations are most constrained by race/ethnicity, and least by sex and education.

TL;DR: In this article, the authors assess the performance of four centrality models under a variety of known and controlled situations and assess the robustness and sensitivity of each model under conditions of random and systematic variation introduced into this network.

TL;DR: In this paper, the conceptualization and measurement of social position in relational data are discussed, and two alternative approaches based on structural equivalence and general equivalence are discussed. But it is argued that structural equivalences is an unsuitable basis for analysis of relational data if the goal is detection of social positions.

TL;DR: In this article, the convergence of social network analysis with structuration theory on the principle of methodological individualism is discussed, and a new role for network analysis in the methodological restructuring of modern social theory is suggested.

TL;DR: In this paper, the authors describe the results of computer simulations of behavioral contagion in the realm of public opinion, using threshold models to describe how and why some people assert opinions and others do not, arguing that to better describe the dynamics of opinion assertion and quiescence the model must be able to account for the fact that different individuals differ in the importance they place on the actions of others, and in the networks in which they are embedded.

TL;DR: In this article, the authors analyze the dynamics behind the network of interlocking directorates and show that primary interlocks (interlocks between the corporation in which the multiple director has an inside position and the other corporations in which he has outside positions) and multiple interlocks between corporations are considerably more stable than other interlocks.

TL;DR: Winship and Mandel as mentioned in this paper proposed a theory of roles that allows a researcher not only to identify individuals who where in the same roles in a same population but individuals who were in similar roles in different populations.

TL;DR: This paper presents a fast and efficient algorithm which finds the orbits of a large class graph and suggests a simple measure of role similarity based upon the constructions contained within the algorithm.

TL;DR: In this article, structural equivalence is computed from path distance measures of network relations rather than being computed directly from patterns of binary choice data, and the results show significant reliability across alternative measures and that this reliability increases with the clarity of boundaries between statuses in a study population.

TL;DR: In this paper, the authors focus on identifying, describing, and explaining the bases of discrete networks among the state supreme courts, using all interstate references for all states and the District of Columbia in the calendar year 1975.

TL;DR: The appropriate task in using multiple methods to study the structure of a social network is not to use them all to see what they converge on, but to select the structural properties of critical interest and use the tools most appropriate for those properties.

TL;DR: In this paper, the concept of a social group is examined from a social interaction point of view, based on the idea that social groups are characterized by regions of dense interactions ties, and by internal structure of a hierarchiral nature.

TL;DR: In this paper, Doreian's solution, which is called the "Doreian Split", is creative and practical, and yields intuitively satisfying results if there really is a problem.

TL;DR: An index of a player's ability to communicate with others is developed and a new game is created whose solution reflects this ability in conjunction with the economic capabilities described by the original game.

TL;DR: In this paper, the concept of graph automorphism is extended to permutation groups, and the main application of these techniques is to crack a disappointingly small number of orbits (say one or two) found in highly symmetric graphs into a richer block structure.

TL;DR: Borgatti's (1988) comments on the utility of the splitting I proposed (Doreian 1987) for symmetric structures are very helpful as discussed by the authors, and it is useful, at least for me, to reconsider regular equivalence and REGE.

TL;DR: In this article, Doreian's solution, which is called the "Doreian Split", is creative and practical, and yields intuitively satisfying results if there really is a problem.