A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks

AbstractThe use of networks for modelling and analysing relations among data is currently growing. Recently, the use of a single networks for capturing all the aspects of some complex scenarios has shown some limitations. Consequently, it has been proposed to use Dual Networks (DN), a pair of related networks, to analyse complex systems. The two graphs in a DN have the same set of vertices and different edge sets. Common subgraphs among these networks may convey some insights about the modelled scenarios. For instance, the detection of the Top-k Densest Connected subgraphs, i.e. a set k subgraphs having the largest density in the conceptual network which are also connected in the physical network, may reveal set of highly related nodes. After proposing a formalisation of the approach, we propose a heuristic to find a solution, since the problem is computationally hard. A set of experiments on synthetic and real networks is also presented to support our approach.

Download Full-text

Using dual-network-analyser for communities detecting in dual networks

BMC Bioinformatics ◽

10.1186/s12859-022-04564-7 ◽

2021 ◽

Vol 22 (S15) ◽

Author(s):

Pietro Hiram Guzzi ◽

Giuseppe Tradigo ◽

Pierangelo Veltri

Keyword(s):

Biological Networks ◽

Biological Data ◽

Network Mining ◽

Meaningful Information ◽

Social Network Mining ◽

Research Fields ◽

Conceptual Network ◽

Network Analyser ◽

Connected Subgraphs ◽

Mapping Information

Abstract Background Representations of the relationships among data using networks are widely used in several research fields such as computational biology, medical informatics and social network mining. Recently, complex networks have been introduced to better capture the insights of the modelled scenarios. Among others, dual networks (DNs) consist of mapping information as pairs of networks containing the same set of nodes but with different edges: one, called physical network, has unweighted edges, while the other, called conceptual network, has weighted edges. Results We focus on DNs and we propose a tool to find common subgraphs (aka communities) in DNs with particular properties. The tool, called Dual-Network-Analyser, is based on the identification of communities that induce optimal modular subgraphs in the conceptual network and connected subgraphs in the physical one. It includes the Louvain algorithm applied to the considered case. The Dual-Network-Analyser can be used to study DNs, to find common modular communities. We report results on using the tool to identify communities on synthetic DNs as well as real cases in social networks and biological data. Conclusion The proposed method has been tested by using synthetic and biological networks. Results demonstrate that it is well able to detect meaningful information from DNs.

Download Full-text