This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2026-232830
If you've NEVER registered a DOI in your Lattes, check our tutorial!This study investigates the behavior of the Maximum Weight Edge Clique Problem as a tool for extracting dense subgraphs in functional networks constructed from multivariate time series. Adopting an Integer Linear Programming formulation, we characterize how the choice of association metrics (Pearson, Spearman, and Mutual Information) and the threshold θ affect the optimal clique under three synthetic regimes: high-frequency seasonality, low-frequency cycles with trend, and random walks. We further investigate the effect of restricting clique cardinality through different size constraints, analyzing how the imposition of an upper bound on the number of vertices affects the stability of the selected components. The results expose regimes where linear and non-linear metrics qualitatively diverge and reveal limitations of the approach in scenarios involving autocorrelated series.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper