Introduction to Social Network Methods

By Robert A. Hanneman. 2001

4,272 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/58896e4e56c54b640a8a2a0abca0d2dbab45a1bc

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Designs for Collective Cognitive Responsibility in Knowledge-Building Communities (2009, background): “A clique in a network can be defined as “a sub-set of a network in which the actors are more closely and intensively tied to one another than they are to other members of the network” (Hanneman, 2001, p. 79).”
Predicting defects using network analysis on dependency graphs (2008, methodology): “Our definition corresponds to the one used by Freeman (see [19, 37, 49]).”
Assessment of New Hub‐and‐Spoke and Point‐to‐Point Airline Network Configurations (2007, background): “The factor analysis is carried out for the eight carriers under consideration.10 The factors explaining cumulatively about 70% of the overall variation are reported in Table 1 (Hanneman, 2001).”
Financial Contagion on the International Trade Network (2010, unknown): “Recent advances in complex network analysis provide us with a number of measures that we can use to understand how well connected an individual country is into the network and assess the level of influence that it has on other countries (nodes) and on the network as a whole (Hanneman 2001).”
Do all birds tweet the same?: characterizing twitter around the world (2011, background): “Network reciprocity tells us about the degree of cohesion, trust and social capital in sociology [7].”
Understanding social learning relations of international students in a large classroom using social network analysis (2013, methodology): “Follow-up quadratic assignment procedure Pearson correlations (Hanneman & Riddle, 2005) were conducted in order to compare similarity measures between the friendship and learning networks.”
Graph mining: Laws, generators, and algorithms (2006, unknown): “In general, the following three kinds of similarities are considered, in decreasing order of constraints [Hanneman and Riddle 2005; Borgatti and Everett 1989]:”