mathematical graphspectral partitioningsocial communitiesscientific collaboration networksresolution parametersPotts Methodonline social networksnodesnetworksmodularity optimizationmodular structuremobile phone networksbiological networkslegislative networksKL algorithmkernighan lin algorithmhierarchical structuregraph partitioningconnected componentscommunity detectioncommunitiesclusteringclique percolation
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)
- Consistency of modularity clustering on random geometric graphs
- Comparison of communities detection algorithms for multiplex
- Cliques and cavities in the human connectome
- Structure-oriented prediction in complex networks
- 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
- Random walks and diffusion on networks
- Community detection in networks using new update rules for label propagation
- Imbalanced classification in sparse and large behaviour datasets
- 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
- Multilayer brain networks
- Stochastic block models are a discrete surface tension
- 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)\)
- Overlapping community detection in networks via sparse spectral decomposition
- Rumor propagation on networks with community structure
- 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
- ChordLink: a new hybrid visualization model
- The maximum balanced subgraph of a signed graph: applications and solution approaches
- Detecting community structure: from parsimony to weighted parsimony
- Motifs, coherent configurations and second order network generation
- Dynamics on modular networks with heterogeneous correlations
- The Small Community Phenomenon in Networks: Models, Algorithms and Applications
- The large graph limit of a stochastic epidemic model on a dynamic multilayer network
- Community detection by modularity maximization using GRASP with path relinking
- Community detection in temporal multilayer networks, with an application to correlation networks
- Modeling dynamics of disaster spreading in community networks
- Community detection in networks via a spectral heuristic based on the clustering coefficient
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- Hearing the clusters of a graph: A distributed algorithm
- scientific article; zbMATH DE number 6982944 (Why is no real title available?)
- Network analysis and modelling: Special issue ofEuropean Journal of Applied Mathematics
- Detection of core-periphery structure in networks using spectral methods and geodesic paths
- Community extraction in multilayer networks with heterogeneous community structure
- Community detection in networks via nonlinear modularity eigenvectors
- Simplified energy landscape for modularity using total variation
- Modularity revisited: a novel dynamics-based concept for decomposing complex networks
- A testing based extraction algorithm for identifying significant communities in networks
- Modularity of directed networks: cycle decomposition approach
- Analysis of the neighborhood pattern similarity measure for the role extraction problem
- A classification for community discovery methods in complex networks
- Regions of reduced dynamics in dynamic networks
- Trust your data or not -- StQP remains StQP: community detection via robust standard quadratic optimization
- Modularity of Erdős-Rényi random graphs
- scientific article; zbMATH DE number 7378595 (Why is no real title available?)
- 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
- On the reliable and efficient numerical integration of the Kuramoto model and related dynamical systems on graphs
- Multilayer modularity belief propagation to assess detectability of community structure
- Detecting Hierarchical Communities in Networks: A New Approach
- scientific article; zbMATH DE number 7626745 (Why is no real title available?)
- Total variation based community detection using a nonlinear optimization approach
- Invertible generalized synchronization: a putative mechanism for implicit learning in neural systems
- Modularity of Erdős-Rényi random graphs
- Structure Detection in Mixed-Integer Programs
- Temporal prediction of epidemic patterns in community networks
- Clustering and community detection in directed networks: a survey
- Aggregation of Markov flows I: theory
- Core-periphery structure in networks (revisited)
- Estimation in a binomial stochastic blockmodel for a weighted graph by a variational expectation maximization algorithm
- Modularity Maximization for Graphons
- On the modularity of 3‐regular random graphs and random graphs with given degree sequences
- 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
- Propagation of chaos and large deviations in mean-field models with jumps on block-structured networks
- A latent process model for time series of attributed random graphs
- Fundamental structures in temporal communication networks
- A fast algorithm for integrative community detection of multi-layer networks
- Emergence of polarization in a sigmoidal bounded-confidence model of opinion dynamics
- Hierarchical overlapping community detection for weighted networks
- Adapting infomap to absorbing random walks using absorption-scaled graphs
- Introduction to correlation networks: interdisciplinary approaches beyond thresholding
- Role extraction by matrix equations and generalized random walks
- Modularity and graph expansion
- Topological aspects of the multi-language phases of the naming game on community-based networks
- Spanning trees and redistricting: new methods for sampling and validation
- Dynamical community structure of populations evolving on genotype networks
- The parameterised complexity of computing the maximum modularity of a graph
- Two sample tests for high-dimensional autocovariances
- Communicability graph and community structures in complex networks
This page was built for publication: Communities in Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3639745)