- Authors:
- Deepayan Chakrabarti,
- Christos Faloutsos
What does the Web look like? How can we find patterns, communities, outliers, in a social network? Which are the most central nodes in a network? These are the questions that motivate this work. Networks and graphs appear in many diverse settings, for example in social networks, computer-communication networks (intrusion detection, traffic management), protein-protein interaction networks in biology, document-text bipartite graphs in text retrieval, person-account graphs in financial fraud detection, and others. In this work, first we list several surprising patterns that real graphs tend to follow. Then we give a detailed list of generators that try to mirror these patterns. Generators are important, because they can help with "what if" scenarios, extrapolations, and anonymization. Then we provide a list of powerful tools for graph analysis, and specifically spectral methods (Singular Value Decomposition (SVD)), tensors, and case studies like the famous "pageRank" algorithm and the "HITS" algorithm for ranking web search results. Finally, we conclude with a survey of tools and observations from related fields like sociology, which provide complementary viewpoints. Table of Contents: Introduction / Patterns in Static Graphs / Patterns in Evolving Graphs / Patterns in Weighted Graphs / Discussion: The Structure of Specific Graphs / Discussion: Power Laws and Deviations / Summary of Patterns / Graph Generators / Preferential Attachment and Variants / Incorporating Geographical Information / The RMat / Graph Generation by Kronecker Multiplication / Summary and Practitioner's Guide / SVD, Random Walks, and Tensors / Tensors / Community Detection / Influence/Virus Propagation and Immunization / Case Studies / Social Networks / Other Related Work / Conclusions
Cited By
Romero D, Uzzi B and Kleinberg J (2019). Social Networks under Stress, ACM Transactions on the Web, 13:1, (1-24), Online publication date: 28-Feb-2019.- Auxier B, Buntain C, Jaeger P, Golbeck J and Kacorri H #HandsOffMyADA Proceedings of the 2019 CHI Conference on Human Factors in Computing Systems, (1-12)
- Romero D, Uzzi B and Kleinberg J Social Networks Under Stress Proceedings of the 25th International Conference on World Wide Web, (9-20)
- Balkir A, Oktay H and Foster I (2015). Estimating graph distance and centrality on shared nothing architectures, Concurrency and Computation: Practice & Experience, 27:14, (3587-3613), Online publication date: 25-Sep-2015.
Recommendations
Detecting malware based on DNS graph mining
Special issue on Big Data in Future SensingMalware remains a major threat to nowadays Internet. In this paper, we propose a DNS graph mining-based malware detection approach. A DNS graph is composed of DNS nodes, which represent server IPs, client IPs, and queried domain names in the process of ...
Mining of Frequent Externally Extensible Outerplanar Graph Patterns
ICMLA '08: Proceedings of the 2008 Seventh International Conference on Machine Learning and ApplicationsAn outerplanar graph is a planar graph which can be embedded in the plane in such a way that all of vertices lie on the outer boundary. Many chemical compounds are known to be expressed by outerplanar graphs. In this paper, firstly, we introduce an ...
Collapsible subgraphs of a 4-edge-connected graph
AbstractJaeger in 1979 showed that every 4-edge-connected graph is supereulerian, graphs that have spanning eulerian subgraphs. Catlin in 1988 sharpened Jaeger’s result by showing that every 4-edge-connected graph is collapsible, graphs that ...