Communities in Networks

zbMath1188.05142arXiv0902.3788MaRDI QIDQ3639745

J.-P. Onnela, Mason A. Porter, Peter J. Mucha

Publication date: 26 October 2009

Full work available at URL: https://arxiv.org/abs/0902.3788

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items

On the reliable and efficient numerical integration of the Kuramoto model and related dynamical systems on graphs, Overlapping community detection in networks via sparse spectral decomposition, Consistency of modularity clustering on random geometric graphs, Comparison of communities detection algorithms for multiplex, Multilayer Modularity Belief Propagation to Assess Detectability of Community Structure, Detecting Hierarchical Communities in Networks: A New Approach, Two sample tests for high-dimensional autocovariances, Communicability graph and community structures in complex networks, Cliques and cavities in the human connectome, The Small Community Phenomenon in Networks: Models, Algorithms and Applications, Structure-oriented prediction in complex networks, Rumor propagation on networks with community structure, Community Detection in Temporal Multilayer Networks, with an Application to Correlation Networks, A framework for detecting communities of unbalanced sizes in networks, Uniform-scale assessment of role minimization in bipartite networks and its application to access control, A user study on hybrid graph visualizations, Community detection by modularity maximization using GRASP with path relinking, Post-processing partitions to identify domains of modularity optimization, MAX \(\kappa\)-cut and the inhomogeneous Potts spin Glass, Validation of community robustness, A generalized inverse for graphs with absorption, Motifs, coherent configurations and second order network generation, Modeling dynamics of disaster spreading in community networks, Core-Periphery Structure in Networks (Revisited), Modularity Maximization for Graphons, On the modularity of 3‐regular random graphs and random graphs with given degree sequences, Random walks and diffusion on networks, Community detection in networks via a spectral heuristic based on the clustering coefficient, Unnamed Item, Network analysis and modelling: Special issue ofEuropean Journal of Applied Mathematics, Detection of core–periphery structure in networks using spectral methods and geodesic paths, Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs, Methods of continuation and their implementation in the COCO software platform with application to delay differential equations, An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs, Path Laplacian matrices: introduction and application to the analysis of consensus in networks, Total Variation Based Community Detection Using a Nonlinear Optimization Approach, Detecting community structure: from parsimony to weighted parsimony, Community detection in networks using new update rules for label propagation, Propagation of chaos and large deviations in mean-field models with jumps on block-structured networks, Unnamed Item, Invertible generalized synchronization: A putative mechanism for implicit learning in neural systems, Modularity of Erdős‐Rényi random graphs, ChordLink: a new hybrid visualization model, Hearing the clusters of a graph: A distributed algorithm, A latent process model for time series of attributed random graphs, Structure Detection in Mixed-Integer Programs, Temporal prediction of epidemic patterns in community networks, Modularity revisited: a novel dynamics-based concept for decomposing complex networks, A testing based extraction algorithm for identifying significant communities in networks, The large graph limit of a stochastic epidemic model on a dynamic multilayer network, Modularity of directed networks: cycle decomposition approach, Imbalanced classification in sparse and large behaviour datasets, Aggregation of Markov flows I: theory, Unnamed Item, Clustering and community detection in directed networks: a survey, Density-based modularity for evaluating community structure in bipartite networks, Layer communities in multiplex networks, Application of complex networks theory in urban traffic network researches, Unnamed Item, Multilayer brain networks, Stochastic block models are a discrete surface tension, Community Detection in Networks via Nonlinear Modularity Eigenvectors, Simplified Energy Landscape for Modularity Using Total Variation, Topological aspects of the multi-language phases of the naming game on community-based networks, Dynamical community structure of populations evolving on genotype networks, Analysis of the Neighborhood Pattern Similarity Measure for the Role Extraction Problem, A classification for community discovery methods in complex networks, Dynamics on modular networks with heterogeneous correlations, Overlapping communities and roles in networks with node attributes: probabilistic graphical modeling, Bayesian formulation and variational inference, New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\), Regions of Reduced Dynamics in Dynamic Networks, Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization, The parameterised complexity of computing the maximum modularity of a graph, Unnamed Item, Estimation in a binomial stochastic blockmodel for a weighted graph by a variational expectation maximization algorithm, A Bounded-Confidence Model of Opinion Dynamics on Hypergraphs, Multivariate Spatiotemporal Hawkes Processes and Network Reconstruction, Relating Modularity Maximization and Stochastic Block Models in Multilayer Networks, The maximum balanced subgraph of a signed graph: applications and solution approaches