Dimensionality of Social Networks Using Motifs and Eigenvalues

@article{Bonato2014DimensionalityOS,
  title={Dimensionality of Social Networks Using Motifs and Eigenvalues},
  author={Anthony Bonato and David F. Gleich and Myunghwan Kim and Dieter Mitsche and Paweł Prałat and Amanda Tian and Stephen J. Young},
  journal={PLoS ONE},
  year={2014},
  volume={9}
}
We consider the dimensionality of social networks, and develop experiments aimed at predicting that dimension. We find that a social network model with nodes and links sampled from an m-dimensional metric space with power-law distributed influence regions best fits samples from real-world networks when m scales logarithmically with the number of nodes of the network. This supports a logarithmic dimension hypothesis, and we provide evidence with two different social networks, Facebook and… Expand
The domination number of on-line social networks and random geometric graphs
TLDR
The domination number for on-line social networks is considered, both in a stochastic network model, and for real-world, networked data, and sublinear bounds are established for the domination number of graphs generated by the memoryless geometric protean random graph model. Expand
The Iterated Local Model for Social Networks
TLDR
A new, generative model, referred to as the Iterated Local Model (ILM), is proposed for social networks synthesizing both transitive and anti-transitive triads over time, which exhibits many properties of complex networks observed in the ILT and ILAT models. Expand
Mining and Modeling Character Networks
TLDR
Using machine learning techniques based on motif (or small subgraph) counts, it is determined that the Chung-Lu model best fits character networks and it is conjecture why this may be the case. Expand
TRACKING NETWORK DYNAMICS : A SURVEY OF DISTANCES AND SIMILARITY METRICS
From longitudinal biomedical studies to social networks, graphs have emerged as a powerful framework for describing evolving interactions between agents in complex systems. In such studies, afterExpand
Large algebraic connectivity fluctuations in spatial network ensembles imply a predictive advantage from node location information
A random geometric graph (RGG) ensemble is defined by the disordered distribution of its node locations. We investigate how this randomness drives sample-to-sample fluctuations in the dynamicalExpand
Dynamic Competition Networks: detecting alliances and leaders
TLDR
A novel hypothesis that serves as a predictive tool to uncover alliances and leaders within dynamic competition networks arising from social game shows such as Survivor and Big Brother is presented. Expand
Rumors Spread Slowly in a Small-World Spatial Network
TLDR
It is shown that the SPA model typically produces graphs that have small effective diameter, i.e., O(\log^2 n)$, while rumor spreading is relatively slow, namely, polynomial in $n$. Expand
What is the dimension of citation space?
TLDR
Novel quantitative methods are provided to characterise that structure of citation networks by adapting methods used in the causal set approach to quantum gravity by considering the networks to be embedded in a Minkowski spacetime and measuring its dimension using Myrheim–Meyer and Midpoint-scaling estimates. Expand
Tracking network dynamics: A survey using graph distances
TLDR
An overview of commonly-used graph distances and an explicit characterization of the structural changes that they are best able to capture, and some guidance on choosing one distance over another in different contexts are provided. Expand
An efficient algorithm for sampling of a single large graph
TLDR
An efficient sampling algorithm named Influence sampling (IS) is proposed which sample the graphs by analyzing the degree of the vertices of the graph such that the most influential vertices remain in the graph sample. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 51 REFERENCES
Social Structure of Facebook Networks
TLDR
The social structure of Facebook “friendship” networks at one hundred American colleges and universities at a single point in time is studied, finding for example that common high school is more important to the social organization of large institutions and that the importance of common major varies significantly between institutions. Expand
Spectral scaling and good expansion properties in complex networks
The existence of a scaling between the principal eigenvector and the subgraph centrality of a complex network indicates that the network has "good expansion" (GE) properties. GE is the important butExpand
Multiplicative Attribute Graph Model of Real-World Networks
TLDR
This work considers a model where each node has a vector of categorical latent attributes associated with it, and derives thresholds for the connectivity and the emergence of the giant connected component, and shows that the model gives rise to networks with a constant diameter. Expand
Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
TLDR
This paper employs approximation algorithms for the graph-partitioning problem to characterize as a function of size the statistical and structural properties of partitions of graphs that could plausibly be interpreted as communities, and defines the network community profile plot, which characterizes the "best" possible community—according to the conductance measure—over a wide range of size scales. Expand
Geometric Protean Graphs
TLDR
The dimension of an OSN is introduced based on the GEO-P model and how the geo-protean model may eventually be used as a tool to group users with similar attributes using only the link structure of the network is discussed. Expand
Efficient shortest paths on massive social graphs
TLDR
This paper explores the design space of graph coordinate systems, a new approach that accurately approximates node distances in constant time by embedding graphs into coordinate spaces, and proposes Rigel, a hyperbolic graph coordinate system that lends itself to efficient parallelization across a compute cluster. Expand
Spectral Scaling in Complex Networks
A complex network is said to show topological isotropy if the topological structure around a particular node looks the same in all directions of the whole network. Topologically anisotropic networksExpand
Network Cosmology
TLDR
This work shows that the causal network representing the large-scale structure of spacetime in the authors' accelerating universe is a power-law graph with strong clustering, similar to many complex networks such as the Internet, social, or biological networks, and proves that this structural similarity is a consequence of the asymptotic equivalence between theLarge-scale growth dynamics of complex networks and causal networks. Expand
Network structure and minimum degree
TLDR
An approach to network cohesion is proposed that is based on minimum degree and which produces a sequence of subgraphs of gradually increasing cohesion that associates with any network measures of local density which promise to be useful both in characterizing network structures and in comparing networks. Expand
Graph evolution: Densification and shrinking diameters
TLDR
A new graph generator is provided, based on a forest fire spreading process that has a simple, intuitive justification, requires very few parameters, and produces graphs exhibiting the full range of properties observed both in prior work and in the present study. Expand
...
1
2
3
4
5
...