Subgraph Frequencies: Mapping the Empirical and Extremal Geography of Large Graph Collections
arXiv:1304.1548
Abstract
A growing set of on-line applications are generating data that can be viewed as very large collections of small, dense social graphs -- these range from sets of social groups, events, or collaboration projects to the vast collection of graph neighborhoods in large social networks. A natural question is how to usefully define a domain-independent coordinate system for such a collection of graphs, so that the set of possible structures can be compactly represented and understood within a common space. In this work, we draw on the theory of graph homomorphisms to formulate and analyze such a representation, based on computing the frequencies of small induced subgraphs within each graph. We find that the space of subgraph frequencies is governed both by its combinatorial properties, based on extremal results that constrain all graphs, as well as by its empirical properties, manifested in the way that real social graphs appear to lie near a simple one-dimensional curve through this space. We develop flexible frameworks for studying each of these aspects. For capturing empirical properties, we characterize a simple stochastic generative model, a single-parameter extension of Erdos-Renyi random graphs, whose stationary distribution over subgraphs closely tracks the concentration of the real social graph families. For the extremal properties, we develop a tractable linear program for bounding the feasible space of subgraph frequencies by harnessing a toolkit of known extremal graph theory. Together, these two complementary frameworks shed light on a fundamental question pertaining to social graphs: what properties of social graphs are 'social' properties and what properties are 'graph' properties? We conclude with a brief demonstration of how the coordinate system we examine can also be used to perform classification tasks, distinguishing between social graphs of different origins.
11 pages, 6 figures, 1 table
References in corpus (1)
Cited by in corpus (20)
- What Would a Graph Look Like in This Layout? A Machine Learning Approach to Large Graph Visualization
- Detecting Strong Ties Using Network Motifs
- The Power of Pivoting for Exact Clique Counting
- Testing Network Structure Using Relations Between Small Subgraph Probabilities
- Testing for Global Network Structure Using Small Subgraph Statistics
- ESCAPE: Efficiently Counting All 5-Vertex Subgraphs
- DeepGraph: Graph Structure Predicts Network Growth
- Moss: A Scalable Tool for Efficiently Sampling and Counting 4- and 5-Node Graphlets
- A General Framework for Estimating Graphlet Statistics via Random Walk
- Mathematical and Algorithmic Analysis of Network and Biological Data
- Predicting Graph Categories from Structural Properties
- SubGraph2Vec: Highly-Vectorized Tree-likeSubgraph Counting
- Correlation between social proximity and mobility similarity
- Comparing large-scale graphs based on quantum probability theory
- Decompositions of Triangle-Dense Graphs
- Structural Diversity and Homophily: A Study Across More than One Hundred Big Networks
- Graph Kernels via Functional Embedding
- Efficiently Estimating Motif Statistics of Large Networks
- A Fast Counting Method for 6-motifs with Low Connectivity
- Paired Threshold Graphs