arXiv subjects

Chiara Faccio

Publications and source records attributed to Chiara Faccio.

5 recordsLinked to original sources

arXiv2026

The Maximum Clique Problem under Adversarial Uncertainty: a min-max approach

We analyze the problem of identifying large cliques in graphs that are affected by adversarial uncertainty. More specifically, we consider a new formulation, namely the adversarial maximum clique problem, which extends the classical maximum-clique problem to graphs with edges strategically perturbed by an adversary. The proposed mathematical model is thus formulated as a two-player zero-sum game between a clique seeker and an opposing agent. Inspired by regularized continuous reformulations of the maximum-clique problem, we derive a penalized continuous formulation leading to a nonconvex and nonsmooth optimization problem. We further introduce the notion of stable global solutions, namely points remaining optimal under small perturbations of the penalty parameters, and prove an equivalence between stable global solutions of the continuous reformulation and largest cliques that are common to all the adversarially perturbed graphs. In order to solve the given nonsmooth problem, we develop a first-order and projection-free algorithm based on generalized subdifferential calculus in the sense of Clarke and Goldstein, and establish global sublinear convergence rates for it. Finally, we report numerical experiments on benchmark instances showing that the proposed method efficiently detects large common cliques.

math.OC↗

arXiv2025

Fast and Simple Multiclass Data Segmentation: An Eigendecomposition and Projection-Free Approach

Graph-based machine learning has seen an increased interest over the last decade with many connections to other fields of applied mathematics. Learning based on partial differential equations, such as the phase-field Allen-Cahn equation, allows efficient handling of semi-supervised learning approaches on graphs. The numerical solution of the graph Allen-Cahn equation via a convexity splitting or the Merriman-Bence-Osher (MBO) scheme, albeit being a widely used approach, requires the calculation of a graph Laplacian eigendecomposition and repeated projections over the unit simplex to maintain valid partitions. The computational efficiency of those methods is hence limited by those two bottlenecks in practice, especially when dealing with large-scale instances. In order to overcome these limitations, we propose a new framework combining a novel penalty-based reformulation of the segmentation problem, which ensures valid partitions (i.e., binary solutions) for appropriate parameter choices, with an eigendecomposition and projection-free optimization scheme, which has a small per-iteration complexity (by relying primarily on sparse matrix-vector products) and guarantees good convergence properties. Experiments on synthetic and real-world datasets related to data segmentation in networks and images demonstrate that the proposed framework achieves comparable or better accuracy than the CS and MBO methods while being significantly faster, particularly for large-scale problems.

math.NA↗

arXiv2022

Solving linear systems of the form $(A + γUU^T)\, {\bf x} = {\bf b}$ by preconditioned iterative methods

We consider the iterative solution of large linear systems of equations in which the coefficient matrix is the sum of two terms, a sparse matrix $A$ and a possibly dense, rank deficient matrix of the form $γUU^T$, where $γ> 0$ is a parameter which in some applications may be taken to be 1. The matrix $A$ itself can be singular, but we assume that the symmetric part of $A$ is positive semidefinite and that $A+γUU^T$ is nonsingular. Linear systems of this form arise frequently in fields like optimization, fluid mechanics, computational statistics, and others. We investigate preconditioning strategies based on an alternating splitting approach combined with the use of the Sherman-Morrison-Woodbury matrix identity. The potential of the proposed approach is demonstrated by means of numerical experiments on linear systems from different application areas.

math.NA↗

arXiv2022

Structural analysis of water networks

Liquid water, besides being fundamental for life on Earth, has long fascinated scientists due to several anomalies. Different hypotheses have been put forward to explain these peculiarities. The most accredited one foresees the presence in the supercooled region of two phases at different densities: the low-density liquid phase and the high-density liquid phase. In our previous work [Faccio et al., J. Mol. Liq. 355 (2022): 118922], we showed that it is possible to identify these two forms in water networks through a computational approach based on molecular dynamics simulation and on the calculation of the total communicability of the associated graph, in which the nodes correspond to water molecules and the edges represent the connections (interactions) between molecules. In this paper, we present a more in-depth investigation of the application of graph-theory based approaches to the analysis of the structure of water networks. In particular, we investigate different connectivity and centrality measures and we report on the use of a variety of global metrics aimed at giving a topological and geometrical characterization of liquid water.

math.NA↗

arXiv2021

Low, high and very-high density forms of liquid water revealed by a medium-range order descriptor

We present in this paper a computational approach based on molecular dynamics simulations and graph theory to characterize the structure of liquid water considering not only the local structural arrangement within the first (or second) hydration shell, but also the medium- to long-range order. In particular, a new order parameter borrowed from the graph-theory framework, i.e. the node total communicability (NTC ), is introduced to analyze the dynamic network of water molecules in the liquid phase. This order parameter is able not only to accurately report on the different high-density-liquid (HDL) and low-density-liquid (LDL) water phases postulated in the liquid-liquid phase transition hypothesis, but also to unveil the presence of very high density liquid (VHDL) clusters, both under pressure and at ambient conditions. To the best of our knowledge, VHDL water patches under moderate pressures were not observed before.

cond-mat.soft↗