A new framework maximizes influence spread in social networks by accounting for inter-community diffusion.
problem Real-world social networks have inter-community influence that is often overlooked in community-based IM approaches.
method Community-IM++ uses a heuristic based on community-based diffusion degree and progressive budgeting to model and prioritize cross-community diffusion.
result Community-IM++ achieves near-greedy influence spread at up to 100 times lower runtime than existing methods.
A new probabilistic model detects communities in networks using both structure and node features.
problem Detecting communities in networks with node features for more accurate results.
method Generative probabilistic model considering network structure and node features.
result The model accurately detects communities and determines feature strength.
Local network community detection aims to find a single community in a large network, while inspecting only a small part of that network around a given seed node. This is much cheaper than finding all communities in a network. Most methods for local community detection are formulated as ad-hoc optimization problems. In…
DFM model detects communities in weighted networks without distributional assumptions.
problem Challenges in community detection for weighted networks.
method Distribution-Free Model (DFM) for weighted networks, using spectral clustering.
result Spectral clustering yields consistent community detection under DFM.
We investigate the community structure of the global ownership network of transnational corporations. We find a pronounced organization in communities that cannot be explained by randomness. Despite the global character of this network, communities reflect first of all the geographical location of firms, while the indu…
We introduce the concept of community trees that summarizes topological structures within a network. A community tree is a tree structure representing clique communities from the clique percolation method (CPM). The community tree also generates a persistent diagram. Community trees and persistent diagrams reveal topol…
The analysis of temporal networks has a wide area of applications in a world of technological advances. An important aspect of temporal network analysis is the discovery of community structures. Real data networks are often very large and the communities are observed to have a hierarchical structure referred to as mult…
A new method detects communities in multi-relational networks.
problem Detect communities in heterogeneous multi-relational networks.
method Message passing based algorithm on a hierarchical structure of homogeneous networks.
result Effectiveness of the proposed method confirmed on synthetic and real-world networks.
Community detection has been one of the central problems in network studies and directed network is particularly challenging due to asymmetry among its links. In this paper, we found that incorporating the direction of links reveals new perspectives on communities regarding to two different roles, source and terminal, …
A new SBM for bipartite networks improves community detection in noisy data.
problem Community detection in bipartite networks with stochastic blockmodels.
method Bayesian nonparametric formulation of SBM for bipartite networks, algorithm to find communities efficiently.
result Improves community detection results over general SBMs, especially in noisy data.
A new model detects complex network communities using node attributes.
problem Lack of methods integrating node attributes for community detection in attributed networks.
method BCSBM model that integrates betweenness centrality and clustering coefficient of nodes.
result BCSBM model outperforms other methods in detecting various network structures.
We introduce a new paradigm that is important for community detection in the realm of network analysis. Networks contain a set of strong, dominant communities, which interfere with the detection of weak, natural community structure. When most of the members of the weak communities also belong to stronger communities, t…
Much of the community detection literature studies structural communities, communities defined solely by the connectivity patterns of the network. Often, networks contain additional metadata which can inform community detection such as the grade and gender of students in a high school social network. In this work, we i…
Across many scientific domains, there is a common need to automatically extract a simplified view or coarse-graining of how a complex system's components interact. This general task is called community detection in networks and is analogous to searching for clusters in independent vector data. It is common to evaluate …
Most real-world networks exhibit community structure, a phenomenon characterized by existence of node clusters whose intra-edge connectivity is stronger than edge connectivities between nodes belonging to different clusters. In addition to facilitating a better understanding of network behavior, community detection fin…
Inter-firm organizations, which play a driving role in the economy of a country, can be represented in the form of a customer-supplier network. Such a network exhibits a heavy-tailed degree distribution, disassortative mixing and a prominent community structure. We analyze a large-scale data set of customer-supplier re…
This paper improves hierarchical community detection efficiency using local structural properties.
problem Efficiency of hierarchical community detection methods in large networks.
method Use of local structural network properties as proxies to improve efficiency.
result Achieves competitive results in modularity with improved efficiency.
Unified framework detects dynamic community structure in brain networks across individuals.
problem Detecting community structure in functional brain networks across multiple subjects and over time.
method Markov-switching stochastic block model (MSS-SBM) for multilayer brain networks.
result Captures dynamic reconfiguration of modular connectivity in brain networks across different task conditions.
Graph energy helps detect communities in networks better than traditional methods.
problem Detecting communities in sparse networks where traditional methods fail.
method Using graph energy based on the full spectrum of adjacency matrices.
result The difference in graph energy between a planted partition model and an Erdős--Rényi network has a distinct transition at the detectability threshold.
Community detection is a fundamental problem in network analysis which is made more challenging by overlaps between communities which often occur in practice. Here we propose a general, flexible, and interpretable generative model for overlapping communities, which can be thought of as a generalization of the degree-co…
As research into community finding in social networks progresses, there is a need for algorithms capable of detecting overlapping community structure. Many algorithms have been proposed in recent years that are capable of assigning each node to more than a single community. The performance of these algorithms tends to …
New algorithm detects community labels in networks using unlabeled data.
problem Detect community labels in networks with partially labeled data.
method Proposes an algorithm using structural similarity metrics.
result Theoretical guarantees for misclassification error.
This article improves communication efficiency in distributed ML over wireless networks.
problem Achieving high ML inference accuracy at scale with zero communication latency.
method Optimizing communication payload types, techniques, scheduling, and ML architectures.
result Communication-efficient and distributed learning frameworks are presented.
ABCD model generates synthetic graphs for community detection with improved scalability and interpretability.
problem Synthetic graphs for community detection are limited in scalability and interpretability.
method Developed a new random graph model (ABCD) with community structure and power-law distribution.
result ABCD model solves scalability and interpretability issues of LFR model.
A new model for detecting overlapping communities in weighted networks.
problem Community detection in overlapping weighted networks with mixed membership and edge weights.
method Mixed membership distribution-free (MMDF) model with an efficient spectral algorithm and fuzzy weighted modularity.
result The MMDF model can estimate community memberships and evaluate community quality for weighted networks.
New model detects communities in network data from edge nominations.
problem Noise and bias in network data from edge nominations.
method General model for network sampling, spectral clustering, method of moments.
result Community detection improved for network data collected via edge nominations.
Multiplex networks have become increasingly more prevalent in many fields, and have emerged as a powerful tool for modeling the complexity of real networks. There is a critical need for developing inference models for multiplex networks that can take into account potential dependencies across different layers, particul…
Discovering community structure in complex networks is a mature field since a tremendous number of community detection methods have been introduced in the literature. Nevertheless, it is still very challenging for practioners to determine which method would be suitable to get insights into the structural information of…
Actors in realistic social networks play not one but a number of diverse roles depending on whom they interact with, and a large number of such role-specific interactions collectively determine social communities and their organizations. Methods for analyzing social networks should capture these multi-faceted role-spec…
This study compares community detection algorithms for delineating health service areas.
problem Delineating health service areas to improve health care services.
method Comparative analysis of community detection algorithms on hospital-patient discharge networks.
result Infomap algorithm produced the best delineation of health service areas.
Sketch-based approach detects community events in evolving networks.
problem Community detection in time-varying networks.
method Maintains a small sketch graph to capture essential community structure.
result Efficiently identifies six key community events during network evolution.
Study cooperative bandit learning with imperfect communication, achieving near-optimal performance.
problem Real-world distributed decision-making with imperfect communication.
method Proposed decentralized algorithms for three communication scenarios: stochastic networks, random delays, and adversarially corrupted rewards.
result Achieved competitive performance and near-optimal guarantees on group regret.
Finding meaningful communities in social network has attracted the attentions of many researchers. The community structure of complex networks reveals both their organization and hidden relations among their constituents. Most of the researches in the field of community detection mainly focus on the topological structu…
Bipartite networks are a common type of network data in which there are two types of vertices, and only vertices of different types can be connected. While bipartite networks exhibit community structure like their unipartite counterparts, existing approaches to bipartite community detection have drawbacks, including im…
Sparse spectral decomposition identifies overlapping communities in networks.
problem Estimating overlapping community memberships in networks where nodes can belong to multiple communities.
method Sparse principal subspace estimation with iterative thresholding.
result The fixed point of the algorithm corresponds to correct node memberships under the stochastic block model.
Community detection is a central problem of network data analysis. Given a network, the goal of community detection is to partition the network nodes into a small number of clusters, which could often help reveal interesting structures. The present paper studies community detection in Degree-Corrected Block Models (DCB…
Two spectral clustering methods for multi-layer networks are analyzed and compared.
problem Community detection in multi-layer networks.
method Sum and debiased sum of squared adjacency matrices for spectral clustering.
result Debiased sum of squared adjacency matrices outperforms sum of adjacency matrices.
We study the inference of a model of dynamic networks in which both communities and links keep memory of previous network states. By considering maximum likelihood inference from single snapshot observations of the network, we show that link persistence makes the inference of communities harder, decreasing the detectab…
Online algorithm detects community structure in dynamic event streams.
problem Community detection in networks with temporal event streams.
method Continuous-time point process latent network models with fast online variational inference.
result Online inference achieves comparable community recovery to non-online methods but with computational gains.
Many methods have been proposed for community detection in networks, but most of them do not take into account additional information on the nodes that is often available in practice. In this paper, we propose a new joint community detection criterion that uses both the network edge information and the node features to…
This paper explores advancements in neural network communication for distributed settings.
problem Challenges in training and evaluating neural networks in distributed, privacy-constrained environments.
method Development and evaluation of novel training and evaluation schemes for neural networks.
result Advantages of novel approaches over traditional cloud solutions, including privacy-preservation, increased security, and high training speed.
Stochastic Gradient Descent (SGD) is the most popular algorithm for training deep neural networks (DNNs). As larger networks and datasets cause longer training times, training on distributed systems is common and distributed SGD variants, mainly asynchronous and synchronous SGD, are widely used. Asynchronous SGD is com…
New algorithm detects communities in weighted networks, improving on binary ones.
problem Few methods exist for detecting communities in weighted networks.
method Pseudo-likelihood approach for weighted stochastic block model.
result The method is consistent and works well for both homogeneous and heterogeneous networks.
New framework tracks communities in dynamic networks.
problem Discovering and tracking communities in evolving networks.
method Spectral framework on Grassmann manifold for subspace tracking.
result Improved dynamic community detection results across various network types.
Improves community detection in directed networks with theoretical guarantees.
problem Degree heterogeneity affects community detection in directed networks.
method Introduced D-SCORE algorithm and established theoretical guarantees for Directed-DCBM.
result Established theoretical guarantees and provided improvements for D-SCORE.
Bayesian model detects communities in networks with covariates.
problem Extracting meaningful community clusters from network data with covariates.
method Proposes a Bayesian stochastic block model with a covariate-dependent random partition prior.
result Can learn the number of communities via posterior inference.
This paper connects graph curvature to community structure.
problem Understanding the relationship between network curvature and community formation.
method Defining curvature on networks and analyzing its relation to community structure.
result Apriori bounds on the curvature of intercommunity edges.
We present a scalable nonparametric Bayesian method to perform network reconstruction from observed functional behavior that at the same time infers the communities present in the network. We show that the joint reconstruction with community detection has a synergistic effect, where the edge correlations used to inform…