Search

Abstract: This paper is an emic, interview-based study of computer scientists’ and sociologists’ accounts of the functions of citations in their writing. Twelve informants took part in the research, commenting upon their citations in one of their own articles. Informants were not provided with functional checklists, and were free to ascribe as many functions to each citation as they wished. Eleven citation functions are identified and described, and evidence of inter- and intra-disciplinary similarities and differences is provided. While the computer scientists used citations to direct their audience to further reading more often, the sociologists’ texts featured more cases of critical citations. The type of paper informants were writing (e.g. theoretical/empirical), the anticipated audience, and the publication outlet resulted in intra-disciplinary differences. Over half of the citations in both fields were said to have more than one function. The insights and implications of the study are discussed. [Copyright &y& Elsevier]

Abstract: A classic experiment by Milgram shows that individuals can route messages along short paths in social networks, given only simple categorical information about recipients (such as “he is a prominent lawyer in Boston” or “she is a Freshman sociology major at Harvard”). That is, these networks have very short paths between pairs of nodes (the so-called small-world phenomenon); moreover, participants are able to route messages along these paths even though each person is only aware of a small part of the network topology. Some sociologists conjecture that participants in such scenarios use a greedy routing strategy in which they forward messages to acquaintances that have more categories in common with the recipient than they do, and similar strategies have recently been proposed for routing messages in dynamic ad hoc networks of mobile devices. In this paper, we introduce a network property called membership dimension, which characterizes the cognitive load required to maintain relationships between participants and categories in a social network. We show that any connected network has a system of categories that will support greedy routing, but that these categories can be made to have small membership dimension if and only if the underlying network exhibits the small-world phenomenon. [Copyright &y& Elsevier]