60 citations · 290 across the 27 of their papers we have counts for
15 papers · 1 filter
Overlapping Network Community Detection Using Sparse Backbones
Zihe Zhou, Samin Aref
Community structures are common in real networks, and extracting them provides valuable insight in applications ranging from drug discovery to market segmentation. Overlapping comm…
Evaluating Global Measures of Network Centralization: Axiomatic and Numerical Assessments
Majid Saberi, Samin Aref
Network centralization, driven by hub nodes, impacts communication efficiency, structural integration, and dynamic processes such as diffusion and synchronization. Although numerou…
Troika algorithm: approximate optimization for accurate clique partitioning and clustering of weighted networks
Samin Aref, Boris Ng
Clique partitioning is a fundamental network clustering task, with applications in a wide range of computational sciences. It involves identifying an optimal partition of the nodes…
Robust Markov stability for community detection at a scale learned based on the structure
Samin Aref, Sanchaai Mathiyarasan
Community detection, the unsupervised task of clustering nodes of a graph, finds applications across various fields. The common approaches for community detection involve optimizin…
Analyzing Modularity Maximization in Approximation, Heuristic, and Graph Neural Network Algorithms for Community Detection
Samin Aref, Mahdi Mostajabdaveh
Community detection, which involves partitioning nodes within a network, has widespread applications across computational sciences. Modularity-based algorithms identify communities…
Heuristic Modularity Maximization Algorithms for Community Detection Rarely Return an Optimal Partition or Anything Similar
Samin Aref, Mahdi Mostajabdaveh, Hriday Chheda
Community detection is a fundamental problem in computational sciences with extensive applications in various fields. The most commonly used methods are the algorithms designed to…
Bayan Algorithm: Detecting Communities in Networks Through Exact and Approximate Optimization of Modularity
Samin Aref, Mahdi Mostajabdaveh, Hriday Chheda
Community detection is a classic network problem with extensive applications in various fields. Its most common method is using modularity maximization heuristics which rarely retu…
Identifying hidden coalitions in the US House of Representatives by optimally partitioning signed networks based on generalized balance
Samin Aref, Zachary P. Neal
In network science, identifying optimal partitions of a signed network into internally cohesive and mutually divisive clusters based on generalized balance theory is computationall…
Multilevel Structural Evaluation of Signed Directed Social Networks based on Balance Theory
Samin Aref, Ly Dinh, Rezvaneh Rezapour +1
Balance theory explains the forces behind the structure of social systems, which are commonly modeled as static undirected signed networks. We expand this modeling approach to inco…
Detecting coalitions by optimally partitioning signed networks of political collaboration
Samin Aref, Zachary Neal
We propose new mathematical programming models for optimal partitioning of a signed graph into cohesive groups. To demonstrate the approach's utility, we apply it to identify coali…
Signed Network Structural Analysis and Applications with a Focus on Balance Theory
Samin Aref
We analyse signed networks from the perspective of balance theory which predicts structural balance as a global structure for signed social networks that represent groups of friend…
Balance and Frustration in Signed Networks
Samin Aref, Mark C. Wilson
The frustration index is a key measure for analysing signed networks, which has been underused due to its computational complexity. We use an exact optimisation-based method to ana…
Computing the Line Index of Balance Using Integer Programming Optimisation
Samin Aref, Andrew J. Mason, Mark C. Wilson
An important measure of signed graphs is the line index of balance which has several applications in many fields. However, this graph-theoretic measure was underused for decades be…
A modelling and computational study of the frustration index in signed networks
Samin Aref, Andrew J. Mason, Mark C. Wilson
Computing the frustration index of a signed graph is a key step toward solving problems in many fields including social networks, political science, physics, chemistry, and biology…
Measuring Partial Balance in Signed Networks
Samin Aref, Mark C. Wilson
Is the enemy of an enemy necessarily a friend? If not, to what extent does this tend to hold? Such questions were formulated in terms of signed (social) networks and necessary and…