Acquisition of Social Network Graph Structure

39 Pages Posted: 13 Jun 2011

See all articles by Jason J. Jones

Jason J. Jones

Stony Brook University; University of California, San Diego (UCSD)

Date Written: 2011

Abstract

Two hypotheses concerning the acquisition of network graph structures were tested. Strong support was found for the hypothesis that the deep structure of a graph affects how quickly it will be learned. Specifically, scale-free graphs were acquired more readily than random graphs. Much less support was found for the hypothesis that the acquisition of social networks is exceptional. The results suggest that the surface description given a graph does not affect how quickly it will be learned. Given similar stimuli, computer or transportation networks were learned just as efficiently as social networks. Evidence is also presented that subjects bring a set of expectations to the task of graph structure acquisition. They exhibit a bias toward responding yes when asked if nodes are connected. In social networks, they assume that intragender friendships are more common than intergender friendships. Acquisition is positively correlated with graph transitivity and negatively correlated with connectedness and efficiency.

Keywords: learning, social networks

Suggested Citation

Jones, Jason Jeffrey, Acquisition of Social Network Graph Structure (2011). Available at SSRN: https://ssrn.com/abstract=1862362 or http://dx.doi.org/10.2139/ssrn.1862362

Jason Jeffrey Jones (Contact Author)

Stony Brook University ( email )

Health Science Center
Stony Brook, NY 11794
United States

HOME PAGE: http://jasonjones.ninja/

University of California, San Diego (UCSD) ( email )

9500 Gilman Drive
Mail Code 0502
La Jolla, CA 92093-0112
United States

Register to save articles to
your library

Register

Paper statistics

Downloads
67
Abstract Views
675
rank
342,551
PlumX Metrics