Structure of neighborhoods in a large social network

Structure of neighborhoods in a large social network

[INFO:INFO_DS] Computer Science/Data Structures and Algorithms

[INFO:INFO_DB] Computer Science/Databases

[INFO:INFO_NI] Computer Science/Networking and Telecommunication

[SHS:STAT] Humanities and Social Sciences/Methods and statistics

social networks

roles

patterns

complex networks

personal networks

graph-mining

data-mining

We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph that relies on enumeration of small induced subgraphs. We make a step further in this direction by identifying not only subgraphs but also the positions occupied by the different vertices of the graph. We are thus able to compute the roles played by the vertices of the graph, roles found according to a new definition that we introduce. We apply this method to the neighborhood of each vertex in a 2.7M vertices, 6M edges mobile phone graph. We analyze how the contacts of each person are connected to each other and the positions they occupy in the neighborhood network. Then we compare their quantity of communication (duration and frequency) to their positions, finding that the two are not independent. We finally interpret and explain the results using social studies on phone communications.

Stoica, Alina

Prieur, Christophe

2009-02-06

ENG

preprint

http://hal.archives-ouvertes.fr/hal-00359464

http://hal.archives-ouvertes.fr/docs/00/35/94/64/PDF/stpr.pdf