facebook_friends — Maier Facebook friends (2014)
- Description
The anonymized Facebook friendship network of B. F. Maier, collected in fall 2014. Nodes are the Facebook profiles of his friends, and an undirected edge connects two profiles that are "friends" on Facebook. The ego node (Maier's own profile), which was connected to every other node, has been removed, so the network has several connected components (the largest has 329 nodes). The network was used as an example in a study of random-walk cover times.
The network has the following properties:
- (Node)
context_0,context_1,context_2,context_3: up to four free-text labels given by the ego to describe the social context of the relationship with that person (e.g. "school", "uni", "choir", "family", "friend of friend"); unused labels are empty.
- (Node)
- Tags
- Social Online Unweighted Metadata
- Added
- 2020-08-11
- Citation
-
- B. F. Maier and D. Brockmann, "Cover time for random walks on arbitrary complex networks." Phys. Rev. E 96, 042307 (2017) arXiv:1706.02356
- Upstream URL OK
- https://github.com/benmaier/BFMaierFBnetwork
- Networks
-
Tip: hover over a column header for a description.
Column legend
- $\left<k\right>$
- Mean degree
- $\sigma_k$
- Standard deviation of the degrees
- $\lambda_h$
- Largest eigenvalue of the Hashimoto (non-backtracking) matrix
- $\tau$
- Random walk mixing time
- $r$
- Degree assortativity
- $c$
- Global clustering coefficient
- $\oslash$
- (Pseudo-) diameter
- $S$
- Relative size of the largest component
- NPs
- Node properties
- EPs
- Edge properties
- Ridiculograms*
-