HSgraphs: Two High School friendship networks
In youngser/VN: Vertex Nomination via Seeded Graph Matching
Description
Usage
Format
Details
Source
References
Description
R. Mastrandrea, J. Fournet, and A. Barrat. "Contact patterns in a high school:
a comparison between data collected using wearable sensors, contact diaries and friendship surveys."
PLoS ONE, 2015.
Usage
1
Format
Two igraph format of undirected graphs HSfbgraphcore and HSfrgraphcore with 82 core vertices
Details
The first network consists of 134 vertices, each representing a particular student,
in which two vertices are adjacent if one of the students reported that the two made contact
at school in a given time-frame. The second network, with 156 vertices, consists of a Facebook
network of profiles in which two vertices are adjacent if they were friends on Facebook.
There are 82 core vertices across the two networks for which we know the bijection
between the two vertex sets, and it is known that no such bijection
exists among the remaining vertices.
Source
References
R. Mastrandrea, J. Fournet, and A. Barrat, Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys, PLoS ONE (2015)
youngser/VN documentation built on July 18, 2020, 12:48 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Format Details Source References
Description
R. Mastrandrea, J. Fournet, and A. Barrat. "Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys." PLoS ONE, 2015.
Usage
1 |
Format
Two igraph format of undirected graphs HSfbgraphcore and HSfrgraphcore with 82 core vertices
Details
The first network consists of 134 vertices, each representing a particular student, in which two vertices are adjacent if one of the students reported that the two made contact at school in a given time-frame. The second network, with 156 vertices, consists of a Facebook network of profiles in which two vertices are adjacent if they were friends on Facebook. There are 82 core vertices across the two networks for which we know the bijection between the two vertex sets, and it is known that no such bijection exists among the remaining vertices.
Source
References
R. Mastrandrea, J. Fournet, and A. Barrat, Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys, PLoS ONE (2015)
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.