Pages that link to "Item:Q3508560"

The following pages link to On Finding Graph Clusterings with Maximum Modularity (Q3508560):

Displaying 40 items.

• Bayesian degree-corrected stochastic blockmodels for community detection (Q315413) (← links)
• Multicuts and perturb \& MAP for probabilistic graph clustering (Q334274) (← links)
• Mixing local and global information for community detection in large networks (Q394992) (← links)
• Detecting communities and their evolutions in dynamic social networks -- a Bayesian approach (Q413825) (← links)
• Information dynamics algorithm for detecting communities in networks (Q450463) (← links)
• A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks (Q498452) (← links)
• A fast and efficient algorithm to identify clusters in networks (Q606725) (← links)
• Spectral clustering and the high-dimensional stochastic blockmodel (Q651016) (← links)
• Anti-modularity and anti-community detecting in complex networks (Q726563) (← links)
• Large-scale structure of time evolving citation networks (Q978768) (← links)
• Hierarchical \(\mathsf{k}_{\mathsf{t}}\) jet clustering for parallel architectures (Q1698580) (← links)
• A greedy algorithm for neighborhood overlap-based community detection (Q1736758) (← links)
• Community structure detection for directed networks through modularity optimisation (Q1736848) (← links)
• New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\) (Q2068829) (← links)
• Synwalk: community detection via random walk modelling (Q2134053) (← links)
• Embedding-based silhouette community detection (Q2217405) (← links)
• Graph ambiguity (Q2446033) (← links)
• A locally optimal hierarchical divisive heuristic for bipartite modularity maximization (Q2448169) (← links)
• On Detection of Community Structure in Dynamic Social Networks (Q2917222) (← links)
• Some properties of e-quality function for network clustering (Q3388944) (← links)
• Community Detection in Temporal Multilayer Networks, with an Application to Correlation Networks (Q3459668) (← links)
• (Q4637082) (← links)
• Community Detection in Networks via Nonlinear Modularity Eigenvectors (Q4683908) (← links)
• Analysis of the Neighborhood Pattern Similarity Measure for the Role Extraction Problem (Q4959466) (← links)
• Review of statistical network analysis: models, algorithms, and software (Q4969842) (← links)
• Toward Optimal Community Detection: From Trees to General Weighted Networks (Q4985780) (← links)
• (Q4993553) (← links)
• Relating Modularity Maximization and Stochastic Block Models in Multilayer Networks (Q5025766) (← links)
• Moments of Uniform Random Multigraphs with Fixed Degree Sequences (Q5037554) (← links)
• Multilayer Modularity Belief Propagation to Assess Detectability of Community Structure (Q5037576) (← links)
• Total Variation Based Community Detection Using a Nonlinear Optimization Approach (Q5113808) (← links)
• Modularity of Erdős‐Rényi random graphs (Q5120747) (← links)
• Characterizing Brain Connectivity From Human Electrocorticography Recordings With Unobserved Inputs During Epileptic Seizures (Q5214347) (← links)
• Interpretation of the Precision Matrix and Its Application in Estimating Sparse Brain Connectivity during Sleep Spindles from Human Electrocorticography Recordings (Q5380666) (← links)
• Consensus and Information Cascades in Game-Theoretic Imitation Dynamics with Static and Dynamic Network Topologies (Q5383202) (← links)
• A DC Programming Approach for Finding Communities in Networks (Q5383809) (← links)
• On the modularity of 3‐regular random graphs and random graphs with given degree sequences (Q6052476) (← links)
• Scalable approximate Bayesian computation for growing network models via extrapolated and sampled summaries (Q6121615) (← links)
• Maximum modular graphs (Q6135108) (← links)
• Bad communities with high modularity (Q6135296) (← links)