Extracting Dense and Connected Subgraphs in Dual Networks by Network Alignment

Pietro Hiram Guzzi; Emanuel Salerno; Giuseppe Tradigo; Pierangelo Veltri

doi:10.1109/access.2020.3020924

Home/Archive/arXiv

arXiv · 2002.01289

Extracting Dense and Connected Subgraphs in Dual Networks by Network Alignment

Pietro Hiram Guzzi·Emanuel Salerno·Giuseppe Tradigo·Pierangelo Veltri

View original source ↗Read source document ↗Export metadata ↓

Abstract

The use of network based approaches to model and analyse large datasets is currently a growing research field. For instance in biology and medicine, networks are used to model interactions among biological molecules as well as relations among patients. Similarly, data coming from social networks can be trivially modelled by using graphs. More recently, the use of dual networks gained the attention of researchers. A dual network model uses a pair of graphs to model a scenario in which one of the two graphs is usually unweighted (a network representing physical associations among nodes) while the other one is edge-weighted (a network representing conceptual associations among nodes). In this paper we focus on the problem of finding the Densest Connected sub-graph (DCS) having the largest density in the conceptual network which is also connected in the physical network. The problem is relevant but also computationally hard, therefore the need for introducing of novel algorithms arises. We formalise the problem and then we map DCS into a graph alignment problem. Then we propose a possible solution. A set of experiments is also presented to support our approach.

Explore related subjects

cs.DS cs.SI q-bio.MN

Keep this discovery

BibTeX RIS

Pietro Hiram Guzzi, Emanuel Salerno, Giuseppe Tradigo, Pierangelo Veltri. 2020-02-04. Extracting Dense and Connected Subgraphs in Dual Networks by Network Alignment. https://doi.org/10.1109/access.2020.3020924

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗