Clustering and community detection in directed networks: a survey
From MaRDI portal
Publication:514409
DOI10.1016/j.physrep.2013.08.002zbMath1356.05151arXiv1308.0971OpenAlexW3098742898WikidataQ30040732 ScholiaQ30040732MaRDI QIDQ514409
Fragkiskos D. Malliaros, Michalis Vazirgiannis
Publication date: 1 March 2017
Published in: Physics Reports (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.0971
Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Directed graphs (digraphs), tournaments (05C20)
Related Items (33)
Structure-oriented prediction in complex networks ⋮ Model-Based Edge Clustering ⋮ Inverse modelling-based multi-objective evolutionary algorithm with decomposition for community detection in complex networks ⋮ Clustering method based on the elastic energy functional of directed signed weighted graphs ⋮ Identifiability and parameter estimation of the overlapped stochastic co-block model ⋮ Direction matters in complex networks: a theoretical and applied study for greedy modularity optimization ⋮ Adaptive directional Haar tight framelets on bounded domains for digraph signal representations ⋮ A label propagation-based method for community detection in directed signed social networks ⋮ Representation of functions on big data associated with directed graphs ⋮ Weighting dissimilarities to detect communities in networks ⋮ An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs ⋮ Dynamics of cluster structure in financial correlation matrix ⋮ Approximation of the second eigenvalue of the \(p\)-Laplace operator in symmetric domains ⋮ Unnamed Item ⋮ Bayesian estimation of the latent dimension and communities in stochastic blockmodels ⋮ Effective Resistance Preserving Directed Graph Symmetrization ⋮ Applying correlation dimension to the analysis of the evolution of network structure ⋮ Bipartitioning of directed and mixed random graphs ⋮ Percolation on complex networks: theory and application ⋮ Community structure detection for directed networks through modularity optimisation ⋮ Generalizedk-core pruning process on directed networks ⋮ Modularity of directed networks: cycle decomposition approach ⋮ Detecting groups in large vector autoregressions ⋮ Analyzing the stock market based on the structure of \textit{kNN} network ⋮ Uniform and most uniform partitions of trees ⋮ Spectral based hypothesis testing for community detection in complex networks ⋮ Partitioning of relative sensing networks: a stability margin perspective ⋮ Weighted community detection and data clustering using message passing ⋮ Overlapping communities and roles in networks with node attributes: probabilistic graphical modeling, Bayesian formulation and variational inference ⋮ A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities ⋮ Unnamed Item ⋮ Koopman-based spectral clustering of directed and time-evolving graphs ⋮ Adaptive learning control synchronization for unknown time-varying complex dynamical networks with prescribed performance
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clustering by Passing Messages Between Data Points
- Optimization by Simulated Annealing
- Graph clustering
- Spectral methods for graph clustering - a survey
- Role models for complex networks
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- Laplacians and the Cheeger inequality for directed graphs
- Comparing clusterings -- an information based distance
- Complex networks: structure and dynamics
- Mutual or Unrequited Love: Identifying Stable Clusters in Social Networks with Uni- and Bi-directional Links
- Random Walks on Digraphs, the Generalized Digraph Laplacian and the Degree of Asymmetry
- Mixed membership stochastic blockmodels
- Emergence of Scaling in Random Networks
- Authoritative sources in a hyperlinked environment
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- Mixture models and exploratory analysis in networks
- Communities in Networks
- A Comparison of the Stability Characteristics of Some Graph Theoretic Clustering Methods
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- The Structure and Function of Complex Networks
- Community structure in social and biological networks
- Stochastic Blockmodels for Directed Graphs
- Digraph Laplacian and the Degree of Asymmetry
- A classification for community discovery methods in complex networks
- Computing Communities in Large Networks Using Random Walks
- Local Partitioning for Directed Graphs Using PageRank
This page was built for publication: Clustering and community detection in directed networks: a survey
