Multiplicative Attribute Graph Model of Real-World Networks

@article{Kim2012MultiplicativeAG,
  title={Multiplicative Attribute Graph Model of Real-World Networks},
  author={Myunghwan Kim and Jure Leskovec},
  journal={Internet Mathematics},
  year={2012},
  volume={8},
  pages={113 - 160}
}
Abstract Networks are a powerful way to describe and represent social, technological, and biological systems, where nodes represent entities (people, web sites, genes) and edges represent interactions (friendships, communication, regulation). The study of such networks then seeks to find common structural patterns and explain their emergence through tractable models of network formation. In most networks, each node is associated with a rich set of attributes or features. For example, users in… 
Attributed graph models: modeling network structure with correlated attributes
TLDR
This work presents the Attributed Graph Model (AGM) framework, a framework to jointly model network structure and vertex attributes, and demonstrates the efficiency and accuracy of this framework on two large real-world networks.
A Comprehensive Study of Multiplicative Attribute Graph Model
TLDR
This dissertation studies a recently introduced social network model, named the Multiplicative Attribute Graph model (MAG), which takes into account the randomness of nodal attributes in the process of link formation, and investigates the existence of zero-one laws for graph properties, e.g., the absence of isolated nodes, graph connectivity and the emergence of triangles.
Modeling Social Networks with Node Attributes using the Multiplicative Attribute Graph Model
TLDR
A Multiplicative Attribute Graph model is presented that considers nodes with categorical attributes and models the probability of an edge as the product of individual attribute link formation affinities, and a scalable variational expectation maximization parameter estimation method is developed.
Node isolation in large homogeneous binary multiplicative attribute graph models
TLDR
A zero-one law is proved for the absence of isolated nodes in the multiplicative attribute graph model; this law coincides with that obtained by Kim and Leskovec for graph connectivity (although under slightly weaker assumptions).
Algorithms for diversity and clustering in social networks through dot product graphs
Nonparametric Multi-group Membership Model for Dynamic Networks
TLDR
This work proposes a nonparametric multi-group membership model for dynamic networks that captures the evolution of individual node group memberships via a Factorial Hidden Markov model and explains the dynamics of the network structure by explicitly modeling the connectivity structure of groups.
Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs
TLDR
The dot product model assumes that two individuals are connected in the social network if their attributes or opinions are similar, and the resulting graph is called a d-dot product graph.
Model Selection for Social Networks Using Graphlets
TLDR
A model-selection method based on unsupervised learning is implemented that correctly classifies synthetic graphs, is robust under perturbations of the graphs, and shows that graphlet counts are a good way of capturing network structure.
On the log-normality of the degree distribution in large homogeneous binary multiplicative attribute graph models
TLDR
It is shown that a certain transformation of the node degree converges in distribution to a log-normal distribution, and its convergence rate is given in the form of a Berry-Esseen type estimate.
Graph Clustering Based on Attribute-Aware Graph Embedding
TLDR
This chapter proposes a new graph embedding approach for attributed graph clustering that embeds each vertex of a graph into a continuous vector space within which the local structure and attribute information surrounding the vertex can be jointly encoded in a unified, latent representation.
...
...

References

SHOWING 1-10 OF 62 REFERENCES
Modeling Social Networks with Node Attributes using the Multiplicative Attribute Graph Model
TLDR
A Multiplicative Attribute Graph model is presented that considers nodes with categorical attributes and models the probability of an edge as the product of individual attribute link formation affinities, and a scalable variational expectation maximization parameter estimation method is developed.
Networks, communities and kronecker products
TLDR
This work presents its work on clustering and community structure in large networks, where clusters are thought of as sets of nodes that are better connected internally than to the rest of the network.
Affiliation networks
TLDR
This paper presents the first model that provides a simple, realistic, and mathematically tractable generative model that intrinsically explains all the well-known properties of the social networks, as well as densification and shrinking diameter.
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.
Community structure in social and biological networks
  • M. Girvan, M. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
TLDR
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
The Network Completion Problem: Inferring Missing Nodes and Edges in Networks
TLDR
Experiments show that the approach can effectively recover the network even when about half of the nodes in the network are missing, and the algorithm outperforms not only classical link-prediction approaches but also the state of the art Stochastic block modeling approach.
Statistical properties of community structure in large social and information networks
TLDR
It is found that a generative model, in which new edges are added via an iterative "forest fire" burning process, is able to produce graphs exhibiting a network community structure similar to that observed in nearly every network dataset examined.
Weighted graphs and disconnected components: patterns and a generator
TLDR
This work observes that the non-giant connected components seem to stabilize in size, and proposes an intuitive, generative model for graph growth that obeys observed patterns.
The Geometric Protean Model for On-Line Social Networks
TLDR
This work introduces a new geometric, rank-based model for the link structure of on-line social networks (OSNs), and introduces the dimension of an OSN, and examines this new parameter using actual OSN data.
Stochastic Kronecker Graphs
TLDR
This paper studies the basic properties of stochastic Kronecker products based on an initiator matrix of size two and proves that such graphs have constant diameters beyond the connectivity threshold, but are not searchable using a decentralized algorithm.
...
...