Notes on Prestige

From Canadian Centre for Ethnomusicology
Revision as of 14:33, 29 October 2019 by Michaelf (talk | contribs) (→‎Definitions, basics)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Prestige in directed networks (chapter 9)

Definitions, basics

  • Prestige can be defined in two different ways:
    • Structural prestige. As a function of social network structure. Positive choices are generally a sign of prestige, and being chosen by a prestigious vertex is generally a sign of greater prestige. SNA uses this ideas as a means of defining prestige.
    • Social prestige. Other measures of prestige simply depend on combining what many different people think of a particular vertex (representing a person or association), without any explicit reference to social networks. This social prestige thus defines an attribute variable that could be represented in Pajek by a partition or vector.
  • As usual, the task of SNA lies in determining the relation between network and attribute properties - here between structural and social prestige.
    • Is it possible that social prestige in fact derives from structural prestige? (choices result in prestige)
    • Or perhaps structural prestige derives from social prestige? (prestige results in choices)
    • Either is likely, but the relation may not be simple - it's a topic for exploratory SNA!
  • Popularity of a vertex is its indegree (analogous to degree centrality).
    • Note that this procedure presumes no multiple arcs (simple network)
    • Multiple arcs and line values suggest a different operation
  • Note that the choice relation must be "positive" (e.g. "likes")
    • if negative ("dislikes"), prestige may be interpreted as a kind of "infamy"
    • if reversable ("lends money to") use outdegree instead (or transpose the network matrix, reversing all arc directions)
  • Other metrics for prestige:
    • size of the input domain for a node X: The input domain is the set of nodes with a path to X. how many nodes have a path to X? What fraction of nodes are in this domain? What is the average distance? For nodes that are unreachable from any other node we assign a distance of "infinity" (=999999998)
    • we can also restrict the input domain to paths of maximum length.
    • proximity prestige for a node X: the fraction of nodes in its input domain divided by the average distance.
  • Pajek techniques:
    • Net>partitions>degree>input to generate input degree partition and normalized input degree vector
    • Net>transform>transpose to transpose network (do this if the arrows are pointing the "wrong way", otherwise you may have to adjust commands from "input" to "output")
    • Network -> create partition -> k-neighbors -> input to discover input domains
    • Network -> create vector -> centrality -> proximity prestige -> input to compute the sizes of all input domains (as total or fraction), the average distance, and "proximity prestige"

Variable relations

  • Relating two variables: two variables are related (or associated) if their values don't occur independently of one another: the value of one variable biases the possible values of the other (for instance: "height" and "weight" are certainly not independent, whereas "height" and "musical preference" probably are). Statistical tests are used to measure the significance of these relations or associations. The kind of test used depends on the kind of variable.
    • Variable types:
      • Nominal (categorical): variable values cannot be ordered; are fundamentally non-numeric (e.g. red, blue, green). Categories are discrete.
      • Ordinal or rank: variable values are ordered, without any particular implication of difference (e.g. first, second, third; node degree: we can't say what a difference of "one" means in these cases)
      • Interval: variable values occur on a number line, but the zero point is arbitrary (e.g. temperature Celsius) so the ratio between two values is meaningless (20 degrees isn't twice as hot as 10 degrees)
      • Ratio: variable values on number line with a significant zero point, so that ratios are meaningful (e.g. weight: 20 kg is really twice as heavy as 10 kg)
    • Pajek and variable representations
      • Partitions: Discrete values. Nominal and ordinal data; rank data, though it may be continuous, can be converted to a partition without loss since it's only the ordering that matters.
      • Vectors: Continuous values. Interval and ratio; values are inherently real numbers, i.e. along a continuous range.
    • Different statistical tests are required to detect relations between different kinds of variables
      • Comparing two nominal variables: Chi-squared and cross tables - use Partitions>info>Cramer's V, Rajski
      • Comparing two rank variables: Spearman rank correlation - use Partitions>info>Spearman's rank
      • Comparing two interval or ratio variables: Pearson correlation - use Vectors>info
      • Spearman's takes only rank into account; few cases should have equal rank. Pearson's measures the degree of linear association between two variables and is more precise for interval or ratio data, however may miss relationships when the linearity condition isn't fulfilled for rank data. Generally, if Pearson's suggests a relation, so will Spearman's - but the former is more precise. But the latter may suggest a relation when the former doesn't.
  • San Juan Sur data
    • Network of visits, partitions identifying (a) social prestige rank and (b) prestige leaders (families 23, 39, 47, 61, 66).
    • Relation between input degree and prestige leadership: draw partition-vector ... no clear relation?
    • Relation between indegree and social status groupings
      • Run Spearman rank test on two partitions: social status and indegree
      • Run Pearson's test on two vectors: social status (converted to vector) and indegree