Cooperative Game Theory Approaches for Network Partitioning

Abstract

The paper is devoted to game-theoretic methods for community detection in networks. The traditional methods for detecting community structure are based on selecting denser subgraphs inside the network. Here we propose to use the methods of cooperative game theory that highlight not only the link density but also the mechanisms of cluster formation. Specifically, we suggest two approaches from cooperative game theory: the first approach is based on the Myerson value, whereas the second approach is based on hedonic games. Both approaches allow to detect clusters with various resolution. However, the tuning of the resolution parameter in the hedonic games approach is particularly intuitive. Furthermore, the modularity based approach and its generalizations can be viewed as particular cases of the hedonic games.

References in corpus (8)

• Fast unfolding of communities in large networks
• Community structure in social and biological networks
• Modularity and community structure in networks
• Community detection in graphs
• Cooperative Game Theory Approaches for Network Partitioning
• Near linear time algorithm to detect community structures in large-scale networks
• Resolution limit in community detection
• Statistical Mechanics of Community Detection

Cited by in corpus (620)

• Fast unfolding of communities in large networks
• Community structure in social and biological networks
• Finding and evaluating community structure in networks
• Modularity and community structure in networks
• Community detection in graphs
• DeepWalk: Online Learning of Social Representations
• Fast algorithm for detecting community structure in networks
• Cooperative Game Theory Approaches for Network Partitioning
• Near linear time algorithm to detect community structures in large-scale networks
• Multilayer Networks
• Link Prediction in Complex Networks: A Survey
• Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
• Stochastic blockmodels and community structure in networks
• Detecting the overlapping and hierarchical community structure of complex networks
• Graph Embedding Techniques, Applications, and Performance: A Survey
• Community detection in networks: A user guide
• Community detection in complex networks using Extremal Optimization
• A smart local moving algorithm for large-scale modularity-based community detection
• Graph Contrastive Learning with Adaptive Augmentation
• struc2vec: Learning Node Representations from Structural Identity
• An information-theoretic framework for resolving community structure in complex networks
• Missing and spurious interactions and the reconstruction of complex networks
• Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
• Spectral redemption: clustering sparse networks
• Line Graphs, Link Partitions and Overlapping Communities
• A Comparative Analysis of Community Detection Algorithms on Artificial Networks
• Mixture models and exploratory analysis in networks
• The ground truth about metadata and community detection in networks
• Finding Communities in Linear Time: A Physics Approach
• Analysis of the structure of complex networks at different resolution levels
• Statistical physics of inference: Thresholds and algorithms
• Defining and identifying Sleeping Beauties in science
• Fuzzy communities and the concept of bridgeness in complex networks
• Phase transition in the detection of modules in sparse networks
• An efficient and principled method for detecting communities in networks
• Node Classification in Social Networks
• Detecting Network Communities: a new systematic and efficient algorithm
• Community detection in networks: Modularity optimization and maximum likelihood are equivalent
• The Physics of Communicability in Complex Networks
• Detecting network communities by propagating labels under constraints
• Robustness of community structure in networks
• Localization and Spreading of Diseases in Complex Networks
• A Comprehensive Survey on Community Detection with Deep Learning
• Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics
• Modularity-Maximizing Network Communities via Mathematical Programming
• Size reduction of complex networks preserving modularity
• Fast community detection by SCORE
• Community Detection via Maximization of Modularity and Its Variants
• Analysis of a continuous-time model of structural balance
• Exponential-Family Random Graph Models for Valued Networks
• Data Based Identification and Prediction of Nonlinear and Complex Dynamical Systems
• A Method to Find Community Structures Based on Information Centrality
• Adversarial Attack and Defense on Graph Data: A Survey
• VERSE: Versatile Graph Embeddings from Similarity Measures
• A Local Method for Detecting Communities
• Community Detection in Complex Networks Using Genetic Algorithms
• Distance, dissimilarity index, and network community structure
• Modularity clustering is force-directed layout
• Advanced modularity-specialized label propagation algorithm for detecting communities in networks
• Spectral Measures of Bipartivity in Complex Networks
• Community detection in networks: Structural communities versus ground truth
• Stationary Graph Processes and Spectral Estimation
• The entropy of randomized network ensembles
• Fundamentals of spreading processes in single and multilayer complex networks
• A Review of Stochastic Block Models and Extensions for Graph Clustering
• Nestedness in complex networks: Observation, emergence, and implications
• Ranking in evolving complex networks
• Crawling Facebook for Social Network Analysis Purposes
• Community Detection as an Inference Problem
• A General Optimization Technique for High Quality Community Detection in Complex Networks
• Nonparametric Bayesian inference of the microcanonical stochastic block model
• Unfolding communities in large complex networks: Combining defensive and offensive label propagation for core extraction
• Kernel Granger causality and the analysis of dynamical networks
• Robust network community detection using balanced propagation
• Local resolution-limit-free Potts model for community detection
• Scalable detection of statistically significant communities and hierarchies, using message-passing for modularity
• Machine learning meets network science: dimensionality reduction for fast and efficient embedding of networks in the hyperbolic space
• Community extraction for social networks
• Robust Reconstruction of Complex Networks from Sparse Data
• A measure of individual role in collective dynamics
• Detecting criminal organizations in mobile phone networks
• Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement
• Community Detection Using A Neighborhood Strength Driven Label Propagation Algorithm
• Clique Graphs and Overlapping Communities
• Network Landscape from a Brownian Particle's Perspective
• Structural Inference of Hierarchies in Networks
• Containing epidemic outbreaks by message-passing techniques
• Line Graphs of Weighted Networks for Overlapping Communities
• Think Locally, Act Locally: The Detection of Small, Medium-Sized, and Large Communities in Large Networks
• Estimating the number of communities in a network
• Unified functional network and nonlinear time series analysis for complex systems science: The pyunicorn package
• Improved community structure detection using a modified fine tuning strategy
• On network bipartivity
• Finding instabilities in the community structure of complex networks
• Motif-based communities in complex networks
• Optimal Containment of Epidemics in Temporal and Adaptive Networks
• Statistical significance of communities in networks
• Comparative analysis of two discretizations of Ricci curvature for complex networks
• Bayesian stochastic blockmodeling
• Community detection and graph partitioning
• When are networks truly modular?
• Social significance of community structure: Statistical view
• Predicting percolation thresholds in networks
• Deciphering Network Community Structure by Surprise
• Computing communities in large networks using random walks (long version)
• Multicores-periphery structure in networks
• Link Prediction via Matrix Completion
• Multiscale mixing patterns in networks
• Model selection and hypothesis testing for large-scale network models with overlapping groups
• Hypergraph reconstruction from network data
• Model Selection for Degree-corrected Block Models
• Synchronization interfaces and overlapping communities in complex networks
• Self-similar scaling of density in complex real-world networks
• Spectral methods for the detection of network community structure: a comparative analysis
• Reconstruction of Graph Signals through Percolation from Seeding Nodes
• Unifying Graph Convolutional Neural Networks and Label Propagation
• Prisoners' dilemma in real-world acquaintance networks: Spikes and quasi-equilibria induced by the interplay between structure and dynamics
• Information filtering in complex weighted networks
• A nonuniform popularity-similarity optimization (nPSO) model to efficiently generate realistic complex networks with communities
• Social goods dilemmas in heterogeneous societies
• Z-score-based modularity for community detection in networks
• Identification of overlapping communities and their hierarchy by locally calculating community-changing resolution levels
• A New Comparative Definition of Community and Corresponding Identifying Algorithm
• Community Detecting By Signaling on Complex Networks
• Efficient method for estimating the number of communities in a network
• A message-passing approach for recurrent-state epidemic models on networks
• Reconstructing networks with unknown and heterogeneous errors
• Detecting Multiple Communities Using Quantum Annealing on the D-Wave System
• Non-parametric Bayesian modeling of complex networks
• Median evidential c-means algorithm and its application to community detection
• Map equation for link community
• Blind Identification of Graph Filters
• Evaluating accuracy of community detection using the relative normalized mutual information
• Network Community Detection: A Review and Visual Survey
• Rich-cores in networks
• Finding multiple core-periphery pairs in networks
• Cover time for random walks on arbitrary complex networks
• EoN (Epidemics on Networks): a fast, flexible Python package for simulation, analytic approximation, and analysis of epidemics on networks
• Developments in the theory of randomized shortest paths with a comparison of graph node distances
• Data-driven Computational Social Science: A Survey
• Communicability Graph and Community Structures in Complex Networks
• Large-scale nonlinear Granger causality: A data-driven, multivariate approach to recovering directed networks from short time-series data
• Improved mutual information measure for classification and community detection
• Centrality-based identification of important edges in complex networks
• Dynamic message-passing equations for models with unidirectional dynamics
• Core-periphery structure requires something else in the network
• Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering
• Note on the equivalence of the label propagation method of community detection and a Potts model approach
• Topological implications of negative curvature for biological and social networks
• Exploring the structural regularities in networks
• Identification of network modules by optimization of ratio association
• Conjoining uncooperative societies facilitates evolution of cooperation
• Community Structure Detection in Complex Networks with Partial Background Information
• Diffusion on Complex Networks : A way to probe their large scale topological structures
• Local dominance unveils clusters in networks
• GEMSEC: Graph Embedding with Self Clustering
• Comparison and validation of community structures in complex networks
• Distinctiveness Centrality in Social Networks
• Hierarchical multiresolution method to overcome the resolution limit in complex networks
• Measuring robustness of community structure in complex networks
• People are Strange when you're a Stranger: Impact and Influence of Bots on Social Networks
• Inference using noisy degrees: Differentially private $\beta$-model and synthetic graphs
• A Parameterized Centrality Metric for Network Analysis
• Multistep greedy algorithm identifies community structure in real-world and computer-generated networks
• Detecting Important Nodes to Community Structure Using the Spectrum of the Graph
• DDGK: Learning Graph Representations for Deep Divergence Graph Kernels
• Phase transitions in semisupervised clustering of sparse networks
• Interacting discovery processes on complex networks
• Deep Community Detection
• Covariance, correlation matrix and the multi-scale community structure of networks
• A Survey of Community Detection Approaches: From Statistical Modeling to Deep Learning
• Analyzing complex networks through correlations in centrality measurements
• State and Network Structures of Stock Markets around the Global Financial Crisis
• Markov random walk under constraint for discovering overlapping communities in complex networks
• Universal fractal scaling of self-organized networks
• Large network community detection by fast label propagation
• A message-passing approach for threshold models of behavior in networks
• An Order-based Algorithm for Minimum Dominating Set with Application in Graph Mining
• Communities in Networks
• Conformity, anticonformity and polarization of opinions: insights from a mathematical model of opinion dynamics
• The web of federal crimes in Brazil: topology, weaknesses, and control
• Estimating the number of communities in networks by spectral methods
• Degree Distribution in Quantum Walks on Complex Networks
• Lessons Learned from Applying Social Network Analysis on an Industrial Free/Libre/Open Source Software Ecosystem
• Unveiling community structures in weighted networks
• Link-Prediction Enhanced Consensus Clustering for Complex Networks
• Matching-centrality decomposition and the forecasting of new links in networks
• Ubiquitousness of link-density and link-pattern communities in real-world networks
• Detecting communities of triangles in complex networks using spectral optimization
• Review on Learning and Extracting Graph Features for Link Prediction
• GLEE: Geometric Laplacian Eigenmap Embedding
• Equivalence of several generalized percolation models on networks
• Detecting Communities in Networks by Merging Cliques
• Network community detection using modularity density measures
• Diffusion and networks: A powerful combination!
• Opinion Maximization in Social Networks
• Nonbacktracking expansion of finite graphs
• Revealing consensus and dissensus between network partitions
• Measuring Significance of Community Structure in Complex Networks
• Estimation of global network statistics from incomplete data
• Multilayer Network Science: from Cells to Societies
• Identifying communities by influence dynamics in social networks
• Exact Coupling Threshold for Structural Transition in Interconnected Networks
• Disentangling homophily, community structure and triadic closure in networks
• Fast and accurate determination of modularity and its effect size
• Community Detection in Quantum Complex Networks
• Discrete-time quantum walk on complex networks for community detection
• Bi-Objective Community Detection (BOCD) in Networks using Genetic Algorithm
• Finding network communities using modularity density
• Multi-resolution community detection based on generalized self-loop rescaling strategy
• Reducing Degeneracy in Maximum Entropy Models of Networks
• Community detection using boundary nodes in complex networks
• A Complex-Network Perspective on Alexander's Wholeness
• Cross-validation estimate of the number of clusters in a network
• Optimal map of the modular structure of complex networks
• Combinatorial Continuous Maximal Flows
• Spectral Detection of Simplicial Communities via Hodge Laplacians
• The interplay between conformity and anticonformity and its polarizing effect on society
• Neural graph embeddings as explicit low-rank matrix factorization for link prediction
• Identifying symmetries and predicting cluster synchronization in complex networks
• Optimizing an Organized Modularity Measure for Topographic Graph Clustering: a Deterministic Annealing Approach
• Modularity functions maximization with nonnegative relaxation facilitates community detection in networks
• Genetic Algorithm with Ensemble Learning for Detecting Community Structure in Complex Networks
• Dynamics of opinion polarization
• Genetic Algorithm with a Local Search Strategy for Discovering Communities in Complex Networks
• Network Structure, Topology and Dynamics in Generalized Models of Synchronization
• A Mathematical Theory for Clustering in Metric Spaces
• Overlapping community detection in signed networks
• Hierarchical benchmark graphs for testing community detection algorithms
• Reinforced communication and social navigation generate groups in model networks
• A divisive spectral method for network community detection
• Exploiting the Structure of Bipartite Graphs for Algebraic and Spectral Graph Theory Applications
• Edge exchangeable models for network data
• A generalised significance test for individual communities in networks
• Hopping in the crowd to unveil network topology
• Finding communities in sparse networks
• Information dynamics algorithm for detecting communities in networks
• Positively Correlated Samples Save Pooled Testing Costs
• Extension of Modularity Density for Overlapping Community Structure
• Versatility of nodal affiliation to communities
• Lexical Sorting Centrality to Distinguish Spreading Abilities of Nodes in Complex Networks under the Susceptible-Infectious-Recovered (SIR) Model
• The Interplay Between Dynamics and Networks: Centrality, Communities, and Cheeger Inequality
• DMCS : Density Modularity based Community Search
• A Study of Mental Maps in Immersive Network Visualization
• Community detection and Social Network analysis based on the Italian wars of the 15th century
• The Turing Test for Graph Drawing Algorithms
• Modeling temporal networks with bursty activity patterns of nodes and links
• Blind identification of stochastic block models from dynamical observations
• A Unified Method of Detecting Core-Periphery Structure and Community Structure in Networks
• Controllability of Bandlimited Graph Processes Over Random Time Varying Graphs
• LabelRank: A Stabilized Label Propagation Algorithm for Community Detection in Networks
• Mixing patterns and individual differences in networks
• Nodes having a major influence to break cooperation define a novel centrality measure: game centrality
• The Minimum Wiener Connector
• Neighborhood Information-based Probabilistic Algorithm for Network Disintegration
• Deep Learning-Based Average Consensus
• Identifying overlapping communities in social networks using multi-scale local information expansion
• From Relational Data to Graphs: Inferring Significant Links using Generalized Hypergeometric Ensembles
• What is the Entropy of a Social Organization?
• Combinatorial approach to Modularity
• RobustECD: Enhancement of Network Structure for Robust Community Detection
• Walk modularity and community structure in networks
• A generalised mean-field approximation for the Deffuant opinion dynamics model on networks
• What do we see when we look at networks
• Gain and loss of esteem, direct reciprocity and Heider balance
• A novel metric for community detection
• Graph Comparison via the Non-backtracking Spectrum
• A framework for statistical network modeling
• Alternative approach to community detection in networks
• A measure of centrality based on the spectrum of the Laplacian
• Fast Detection of Community Structures using Graph Traversal in Social Networks
• Heider balance, asymmetric ties, and gender segregation
• Effect of size heterogeneity on community identification in complex networks
• Modeling and verifying a broad array of network properties
• Network Weirdness: Exploring the Origins of Network Paradoxes
• Quantum walks on complex networks with connection instabilities and community structure
• Scale-dependent measure of network centrality from diffusion dynamics
• Organization of networks with tagged nodes and biased links: a priori distinct communities. The case of Intelligent Design Proponents and Darwinian Evolution Defenders
• Network Alignment
• A Generalized and Adaptive Method for Community Detection
• Ant Colony Optimization with a New Random Walk Model for Community Detection in Complex Networks
• A framework for second order eigenvector centralities and clustering coefficients
• Social Network Analysis Taxonomy Based on Graph Representation
• Optimal Investment Strategies for Competing Camps in a Social Network: A Broad Framework
• Consistency landscape of network communities
• Improvements on SCORE, Especially for Weak Signals
• Finding missing edges and communities in incomplete networks
• Discovering Network Structure Beyond Communities
• Community detection using preference networks
• Identifying Overlapping and Hierarchical Thematic Structures in Networks of Scholarly Papers: A Comparison of Three Approaches
• A unified data representation theory for network visualization, ordering and coarse-graining
• Discovering link communities in complex networks by exploiting link dynamics
• Reverse engineering of complex dynamical networks in the presence of time-delayed interactions based on noisy time series
• Communicability Angles Reveal Critical Edges for Network Consensus Dynamics
• A similarity-based community detection method with multiple prototype representation
• Defining Least Community as a Homogeneous Group in Complex Networks
• Network clustering and community detection using modulus of families of loops
• The Effects of Randomness on the Stability of Node Embeddings
• The characteristics of cycle-nodes-ratio and its application to network classification
• Multitarget search on complex networks: A logarithmic growth of global mean random cover time
• Relational flexibility of network elements based on inconsistent community detection
• Ground truth? Concept-based communities versus the external classification of physics manuscripts
• An Unsupervised Framework for Comparing Graph Embeddings
• On analyzing and evaluating privacy measures for social networks under active attack
• Multi-resolution community detection in massive networks
• Community detection by label propagation with compression of flow
• Hypergraph reconstruction from noisy pairwise observations
• Fuzzy Overlapping Community Quality Metrics
• Anomaly detection and community detection in networks
• Robustness of community structure to node removal
• Non-parametric resampling of random walks for spectral network clustering
• Energy cost study for controlling complex social networks with conformity behavior
• Kernel k-Groups via Hartigan's Method
• Inference for graphs and networks: Extending classical tools to modern data
• Revisiting the Bethe-Hessian: Improved Community Detection in Sparse Heterogeneous Graphs
• Solving Statistical Mechanics on Sparse Graphs with Feedback Set Variational Autoregressive Networks
• Label propagation for clustering
• Local-ring network automata and the impact of hyperbolic geometry in complex network link-prediction
• Minimum curvilinear automata with similarity attachment for network embedding and link prediction in the hyperbolic space
• Inferring the strength of social ties: a community-driven approach
• Comparative analysis on the selection of number of clusters in community detection
• Asymptotic resolution bounds of generalized modularity and multi-scale community detection
• Sizing the length of complex networks
• Community detection based on first passage probabilities
• Localization of eigenvector centrality in networks with a cut vertex
• Node Dependent Local Smoothing for Scalable Graph Learning
• Embedding Node Structural Role Identity into Hyperbolic Space
• Randomized Shortest Paths with Net Flows and Capacity Constraints
• ExplaiNE: An Approach for Explaining Network Embedding-based Link Predictions
• Understanding graph embedding methods and their applications
• Approximating quasi-stationary behaviour in network-based SIS dynamics
• Effects of Stochastic Games on Evolutionary Dynamics in Structured Populations
• A Study on Modularity Density Maximization: Column Generation Acceleration and Computational Complexity Analysis
• Mean-field theory for double-well systems on degree-heterogeneous networks
• Karate Club: An API Oriented Open-source Python Framework for Unsupervised Learning on Graphs
• Competition, Collaboration, and Optimization in Multiple Interacting Spreading Processes
• Absorbing Random Walks Interpolating Between Centrality Measures on Complex Networks
• Randomized opinion dynamics over networks: influence estimation from partial observations
• Methods for approximating stochastic evolutionary dynamics on graphs
• Clustering and Community Detection with Imbalanced Clusters
• A Method for Group Extraction and Analysis in Multilayer Social Networks
• Heterogeneous message passing for heterogeneous networks
• Community structure revealed by phase locking
• An ensemble based on a bi-objective evolutionary spectral algorithm for graph clustering
• Emergence of event cascades in inhomogeneous networks
• Spectral estimation of the percolation transition in clustered networks
• Measuring nodes centrality when local and global measures overlap
• A quantitative method for determining the robustness of complex networks
• Differential Game Strategies for Social Networks with Self-Interested Individuals
• Analytical Formulation of the Block-Constrained Configuration Model
• A unified framework for spectral clustering in sparse graphs
• Community detection based on "clumpiness" matrix in complex networks
• Statistical test for detecting community structure in real-valued edge-weighted graphs
• Different patterns of social closeness observed in mobile phone communication
• Thermodynamics of network model fitting with spectral entropies
• Triangle Centrality
• Evolutionary Subnetworks in Complex Systems
• Orthogonal symmetric non-negative matrix factorization under the stochastic block model
• A Deep Generative Model for Reordering Adjacency Matrices
• Multi-scale Dynamics in a Massive Online Social Network
• Fast Complex Network Clustering Algorithm Using Agents
• Detecting groups of similar components in complex networks
• Augmentations of Forman's Ricci Curvature and their Applications in Community Detection
• On the relationship between Gaussian stochastic blockmodels and label propagation algorithms
• Latent Poisson models for networks with heterogeneous density
• Unifying information propagation models on networks and influence maximization
• Consistent Community Identification in Complex Networks
• Network depth: identifying median and contours in complex networks
• Complex systems: features, similarity and connectivity
• Consistency and Asymptotic Normality of Stochastic Block Models Estimators from Sampled Data
• ImGAGN:Imbalanced Network Embedding via Generative Adversarial Graph Networks
• Accelerating coordination in temporal networks by engineering the link order
• Distribution of maximal clique size of the vertices for theoretical small-world networks and real-world networks
• Community Detection in Complex Networks Using Agents
• Locally computable approximations for spectral clustering and absorption times of random walks
• Exploring the "Middle Earth" of Network Spectra via a Gaussian Matrix Function
• Optimal exploration of random walks with local bias on networks
• Characteristic scales and adaptation in higher-order contagions
• Strategic Attack & Defense in Security Diffusion Games
• Two faces of greedy leaf removal procedure on graphs
• Inferring topologies via driving-based generalized synchronization of two-layer networks
• Multi-scale Laplacian community detection in heterogeneous networks
• Structural patterns in complex systems using multidendrograms
• Evidential Communities for Complex Networks
• Detecting Communities in Complex Networks using an Adaptive Genetic Algorithm and node similarity-based encoding
• Geometric Affinity Propagation for Clustering with Network Knowledge
• Consensus and Information Cascades in Game-Theoretic Imitation Dynamics with Static and Dynamic Network Topologies
• Weighted H-index for identifying influential spreaders
• Fast Community Identification by Hierarchical Growth
• Identification of Overlapping Communities by Locally Calculating Community-Changing Resolution Levels
• Quantifying Triadic Closure in Multi-Edge Social Networks
• Generalized Markov stability of network communities
• Model-based clustering in networks with Stochastic Community Finding
• The Landscape of Complex Networks
• Communities as Well Separated Subgraphs With Cohesive Cores: Identification of Core-Periphery Structures in Link Communities
• Topological Feature Based Classification
• Explainable, Stable, and Scalable Graph Convolutional Networks for Learning Graph Representation
• An efficient counting method for the colored triad census
• Emerging communities in networks - a flow of ties
• A Latent Shrinkage Position Model for Binary and Count Network Data
• Understanding Information Centrality Metric: A Simulation Approach
• Noisy Hamiltonian Monte Carlo for doubly-intractable distributions
• Multi-layer network approach in modeling epidemics in an urban town
• Community detection for interaction networks
• Structured networks and coarse-grained descriptions: a dynamical perspective
• Criterions for locally dense subgraphs
• Community structure in real-world networks from a non-parametrical synchronization-based dynamical approach
• Ranking the Importance of Nodes of Complex Networks by the Equivalence Classes Approach
• OCSM : Finding Overlapping Cohesive Subgraphs with Minimum Degree
• Search for overlapped communities by parallel genetic algorithms
• Discord in the voter model for complex networks
• Sparse Graph Attention Networks
• Mathematical Programming Formulations for the Collapsed k-Core Problem
• Null-eigenvalue localization of quantum walks on real-world complex networks
• Discrete-Time Open Quantum Walks for Vertex Ranking in Graphs
• Revisiting Decomposable Submodular Function Minimization with Incidence Relations
• Entrograms and coarse graining of dynamics on complex networks
• Sparse Randomized Shortest Paths Routing with Tsallis Divergence Regularization
• Self-falsifiable Hierarchical Detection of Overlapping Communities On Social Networks
• Network Cards: concise, readable summaries of network data
• Automatic exploration of structural regularities in networks
• Generative models for local network community detection
• On Comparing and Enhancing Common Approaches to Network Community Detection
• Effective resistance on graphs and the Epidemic quasimetric
• Local multiresolution order in community detection
• Experimental Analysis and Evaluation of Cohesive Subgraph Discovery
• Social network analysis of manga: similarities to real-world social networks and trends over decades
• Stochastic Block Models are a Discrete Surface Tension
• Ising-Based Louvain Method: Clustering Large Graphs with Specialized Hardware
• Obtaining Communities with a Fitness Growth Process
• Estimating the number of communities in weighted networks
• Detecting network communities via greedy expanding based on local superiority index
• Emergence of heterogeneity and political organization in information exchange networks
• Benchmarking community detection methods on social media data
• Bayesian Learning of Graph Substructures
• A Dynamic Mode Decomposition Approach for Decentralized Spectral Clustering of Graphs
• A Memetic Algorithm for the Minimum Conductance Graph Partitioning Problem
• Community Detection with the Map Equation and Infomap: Theory and Applications
• Identifying robust features of community structure in complex networks
• Community models for networks observed through edge nominations
• Black Box Submodular Maximization: Discrete and Continuous Settings
• Adhesion-induced Discontinuous Transitions and Classifying Social Networks
• Detecting Statistically Significant Communities
• Comparing Graph Spectra of Adjacency and Laplacian Matrices
• The likelihood-ratio test for multi-edge network models
• Blankets Joint Posterior score for learning Markov network structures
• "Conjectural" links in complex networks
• Role-based Label Propagation Algorithm for Community Detection
• Comparing directed networks via denoising graphlet distributions
• Resolving degeneracies in Google search via quantum stochastic walks
• Quantifying Controversy in Social Media
• Antifragility of stochastic transport on networks with damage
• Robustness of Decentralised Learning to Nodes and Data Disruption
• Centrality measures and opinion dynamics in two-layer networks with replica nodes
• Leiden-Fusion Partitioning Method for Effective Distributed Training of Graph Embeddings
• Generating Post-hoc Explanations for Skip-gram-based Node Embeddings by Identifying Important Nodes with Bridgeness
• Geometric properties of graph layouts optimized for greedy navigation
• Active Learning for Hidden Attributes in Networks
• On weakly optimal partitions in modular networks
• How to grow an oscillator network with enhanced synchronization
• Spectral Representations of Graphons in Very Large Network Systems Control
• Consistency between ordering and clustering methods for graphs
• Perturbation theory for evolution of cooperation on networks
• Discovering Block Structure in Networks
• Community Detection by Information Flow Simulation
• NISQ-ready community detection based on separation-node identification
• Comprehensive spectral approach for community structure analysis on complex networks
• Community detection by resistance distance: automation and benchmark testing
• Modular decomposition of Markov chain: detecting hierarchical organization of pervasive communities
• Edge Union of Networks on the Same Vertex Set
• Phase transitions and optimal algorithms for semi-supervised classifications on graphs: from belief propagation to graph convolution network
• Percolation transitions with nonlocal constraint
• Finding the proper node ranking method for complex networks
• Quantum walk on simplicial complexes for simplicial community detection
• A General Definition of Network Communities and the Corresponding Detection Algorithm
• SCOREH+: A High-Order Node Proximity Spectral Clustering on Ratios-of-Eigenvectors Algorithm for Community Detection
• Angular separability of data clusters or network communities in geometrical space and its relevance to hyperbolic embedding
• The Atlas for the Aspiring Network Scientist
• Centrality-Weighted Opinion Dynamics: Disagreement and Social Network Partition
• Systematic comparison of graph embedding methods in practical tasks
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian
• Fast Multiplier Methods to Optimize Non-exhaustive, Overlapping Clustering
• Relational representation learning with spike trains
• Dynamic degree-corrected blockmodels for social networks: a nonparametric approach
• On Finding the Community with Maximum Persistence Probability
• A fast multilevel algorithm for graph clustering and community detection
• Community Detection Algorithm Combining Stochastic Block Model and Attribute Data Clustering
• Optimizing Edge Sets in Networks to Produce Ground Truth Communities Based on Modularity
• Distortion estimates for approximate Bayesian inference
• Efficient network navigation with partial information
• Graph Analysis Using a GPU-based Parallel Algorithm: Quantum Clustering
• Smoothness Sensor: Adaptive Smoothness-Transition Graph Convolutions for Attributed Graph Clustering
• YASCA: A collective intelligence approach for community detection in complex networks
• Stochastic graph Voronoi tessellation reveals community structure
• Refined Graph Encoder Embedding via Self-Training and Latent Community Recovery
• Latent Geometry Inspired Graph Dissimilarities Enhance Affinity Propagation Community Detection in Complex Networks
• Evaluating Overlapping Communities with the Conductance of their Boundary Nodes
• A new edge betweenness measure using a game theoretical approach: an application to hierarchical community detection
• Opinion Dynamics Optimization Through Noncooperative Differential Games
• Hierarchical clustering of bipartite data sets based on the statistical significance of coincidences
• Combinations of Affinity Functions for Different Community Detection Algorithms in Social Networks
• Dual regularized Laplacian spectral clustering methods on community detection
• A multilevel clustering technique for community detection
• Extending adjacency matrices to 3D with triangles
• When can networks be inferred from observed groups?
• Quantifying metadata relevance to network block structure using description length
• Network community detection via iterative edge removal in a flocking-like system
• A Visual Analytics Framework for Contrastive Network Analysis
• Community Detection by Principal Components Clustering Methods
• Generic criticality of community structure in random graphs
• Reconstructing networks from simple and complex contagions
• Weighted Label Propagation Algorithm based on Local Edge Betweenness
• Impact of local information in growing networks
• Limited Random Walk Algorithm for Big Graph Data Clustering
• Trophic groups and modules: two levels of group detection in food webs
• Costly bilingualism model in a population with one zealot
• Symmetry-driven embedding of networks in hyperbolic space
• A modified Ricci flow on arbitrary weighted graph
• Detecting hierarchical and overlapping network communities using locally optimal modularity changes
• Searchability of central nodes in networks
• Multilateration of Random Networks with Community Structure
• Fair treatment allocations in social networks
• Overlapping community detection in networks via sparse spectral decomposition
• Clustering evolving data using kernel-based methods
• Thermodynamics of the Minimum Description Length on Community Detection
• QWalkVec: Node Embedding by Quantum Walk
• Spectral Graph Analysis: A Unified Explanation and Modern Perspectives
• The ubiquity of small-world networks
• Monte Carlo goodness-of-fit tests for degree corrected and related stochastic blockmodels
• Into the Battlefield: Quantifying and Modeling Intra-community Conflicts in Online Discussion
• Symmetrical SyncMap for Imbalanced General Chunking Problems
• Kernel-based Approximate Bayesian Inference for Exponential Family Random Graph Models
• Maintaining Ferment: On Opinion Control Over Social Networks
• The vulnerability of communities in complex network: An entropy approach
• Systematic assessment of the quality of fit of the stochastic block model for empirical networks
• Modeling Information Diffusion in Social Networks
• Scalable Community Detection via Parallel Correlation Clustering
• Learning Networked Exponential Families with Network Lasso
• Block-Approximated Exponential Random Graphs
• Hate: no choice. Agent simulations
• Communicability and Communities in Complex Socio-Economic Networks
• An improved spectral clustering method for community detection under the degree-corrected stochastic blockmodel
• Analyzing Large and Sparse Tensor Data using Spectral Low-Rank Approximation
• Analyzing the Performance of Graph Neural Networks with Pipe Parallelism
• Evolutionary Multi Objective Optimization Algorithm for Community Detection in Complex Social Networks
• Stable and Discriminative Topological Graph Analysis
• Overcoming Bias in Community Detection Evaluation
• Community Structure Recovery and Interaction Probability Estimation for Gossip Opinion Dynamics
• Maximizing spreading in complex networks with risk in node activation
• Lowest Degree Decomposition of Complex Networks
• Ensemble Node Embeddings using Tensor Decomposition: A Case-Study on DeepWalk
• Testing for the Network Small-World Property
• The way to uncover community structure with core and diversity
• Blind Demixing of Diffused Graph Signals
• Understanding the Dynamics of DNNs Using Graph Modularity
• Scalable Projection-Free Optimization
• Spectral clustering of annotated graphs using a factor graph representation
• Using Spectral Radius Ratio for Node Degree to Analyze the Evolution of Scale Free Networks and Small World Networks
• A novel method based on node correlation to evaluate the important nodes in complex networks
• Clustering on the Edge: Learning Structure in Graphs
• Overlapping community detection in weighted networks
• A Consistent Diffusion-Based Algorithm for Semi-Supervised Graph Learning
• Leader-Driven Opinion Dynamics in Signed Social Networks With Asynchronous Trust/Distrust Level Evolution
• Mixed-SCORE+ for mixed membership community detection
• Impact of independence on polarization of opinions
• Spaceland Embedding of Sparse Stochastic Graphs
• Classification of vertices on social networks by multiple approaches
• Generalized Centrality Aggregation and Exclusive Centrality
• God ($\equiv Elohim$), the first small world network
• Ranking the spreading influence of nodes in complex networks based on mixing degree centrality and local structure
• Model selection for sequential designs in discrete finite systems using Bernstein kernels
• Synergistic Effects in Networked Epidemic Spreading Dynamics
• A Consistent Diffusion-Based Algorithm for Semi-Supervised Classification on Graphs
• Untrained Graph Neural Networks for Denoising
• A Game-Theoretic Algorithm for Link Prediction
• A systematic association of subgraph counts over a network
• Error-Correcting Decoders for Communities in Networks
• Dynamic Virtual Graph Significance Networks for Predicting Influenza
• Correlation-Based Community Detection
• Novel Edge and Density Metrics for Link Cohesion
• Universal scaling hypothesis of quantum spatial search in complex networks
• Transfer and routing of Gaussian states through quantum complex networks with and without community structure
• Understanding in Artificial Intelligence
• Opinion Divergence Reveals the Hierarchical and Overlapping Community Structure in Networks
• Estimating Network Processes via Blind Identification of Multiple Graph Filters
• Community Detection for Gossip Dynamics with Stubborn Agents
• On the notion of balance in social network analysis
• Identification of hybrid node and link communities in complex networks
• A Neighborhood-preserving Graph Summarization
• Diseases on complex networks. Modeling from a database and a protection strategy proposal
• On the initial value of PageRank
• Inferring Network Structure From Data
• Cultural fragmentation and innovation diffusion in a dynamic scenario
• SNAC: An Unbiased Metric Evaluating Topology Recognize Ability of Network Alignment
• Competitive Dynamics on Complex Networks
• Edge sampling using network local information
• Community Detection by a Riemannian Projected Proximal Gradient Method
• Non-backtracking walks reveal compartments in sparse chromatin interaction networks
• Temporal similarity metrics for latent network reconstruction: The role of time-lag decay
• A Unified Framework for Community Detection and Model Selection in Blockmodels
• A High-Performance Evolutionary Multiobjective Community Detection Algorithm
• Evaluating Effects of Background Stories on Graph Perception
• Sparse Nonnegative Matrix Factorization for Multiple Local Community Detection
• Cost Functions in Economic Complexity
• Improved mixing time for k-subgraph sampling
• Statistical properties of telephone communication network
• Gromov Centrality: A Multi-Scale Measure of Network Centrality Using Triangle Inequality Excess
• How polarization can provide an increase in content dissemination amongst the highly ranked influencers
• Dominating sets and ego-centered decompositions in social networks
• Exact statistical mechanics of the Ising model on networks
• Topologically Regularized Data Embeddings
• Tutorial on NLP-Inspired Network Embedding
• Friendship-paradox paradox: Do most people's friends really have more friends than they do?
• Interpreting Graph Drawing with Multi-Agent Reinforcement Learning
• A Game Generative Network Framework with its Application to Relationship Inference
• Overcoming Tight Constraints in Soft Happy Colouring
• On the use of local structural properties for improving the efficiency of hierarchical community detection methods
• Global Network Prediction from Local Node Dynamics
• A study on the performance of similarity indices and its relationship with link prediction: a two-state random network case
• Understanding Vulnerability of Communities in Complex Networks