- Carmona Mejías, Ángeles
- Encinas Bachiller, Andrés Marcos
- Jiménez Jiménez, María José
- Samperio Valdivieso, Álvaro
This paper extends our previous work on the discrete inverse conductance problem on spider networks. Our approach leverages polynomial optimization techniques, incorporating a regularization term to stabilize the inverse problem that penalises the deviation from a piecewise constant conductance hypothesis. Here, we show examples of the stability of the conductance recovery even in cases in which the real conductance does not satisfy the piecewise constant property. We provide a comprehensive analysis of the error behavior with respect to the penalty parameter, demonstrating the effectiveness of our method in various network scenarios. Finally, we look for optimality guarantees for the numerical solution of the polynomial optimization problem. This work significantly contributes to the field of applied inverse problems, offering robust strategies for conductance recovery in complex network structures., The authors thank the anonymous referees for their careful reading and insightful remarks, which have helped improve both the presentation and the results of this paper. This work has been partially supported by the Spanish Research Council (Ministerio de Ciencia e Innovación) under project PID2021-122501NB-I00 and PID2022-138906NB-C21, by the Universitat Politècnica de Catalunya under funds AGRUPS-UPC 2023, and by the Generalitat goverment under funds Producte 2025, Indùstria del coneixement. Moreover, Á. Samperio was also supported by a FPI grant of the Research Project PGC2018-096446-BC21., Peer Reviewed, Postprint (published version)