Evolutionary Network Analysis

DOI10.1145/2601412zbMath1322.68138OpenAlexW2111350126MaRDI QIDQ5178094

Karthik Subbian, Charu C. Aggarwal

Publication date: 9 March 2015

Published in: ACM Computing Surveys (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2601412

zbMATH Keywords

network analysisdynamic graphstemporal graphs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10)

Related Items (12)

On analyzing user preference dynamics with temporal social networks ⋮ Exploring the evolution of node neighborhoods in dynamic networks ⋮ A novel evolutionary clustering via the first-order varying information for dynamic networks ⋮ Detecting evolving communities in dynamic networks using graph regularized evolutionary nonnegative matrix factorization ⋮ Unnamed Item ⋮ Multi-objective evolutionary clustering for large-scale dynamic community detection ⋮ Factor Models for High-Dimensional Tensor Time Series ⋮ On the analysis of fitness change: fitness-popularity dynamic network model with varying fitness ⋮ Explaining social events through community evolution on temporal networks ⋮ Big networks: a survey ⋮ Epidemic spreading on evolving networks ⋮ Finding proper time intervals for dynamic network extraction

Uses Software

• Colibri
• FacetNet
• GraphScope
• CiteSpace

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• CiteSpace
• Nonparametric link prediction in large scale dynamic networks
• Scan statistics on Enron graphs
• Estimating time-varying networks
• Evolution of the social network of scientific collaborations
• Managing and mining graph data
• A graph-theoretic approach to enterprise network dynamics.
• Social Network Data Analytics
• Estimating PageRank on graph streams
• Random sampling with a reservoir
• A MODEL OF LARGE-SCALE PROTEOME EVOLUTION
• Clustering, Visualizing, and Navigating for Large Dynamic Graphs
• Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Minimum cuts in near-linear time

This page was built for publication: Evolutionary Network Analysis