2 citations · 4 across the 5 of their papers we have counts for
7 papers
Kemeny's constant via matrix compression and eigenvalue interlacing
A. Abiad, Á. Carmona, A. M. Encinas +3
Kemeny's constant quantifies the expected time for a random walk to reach a randomly chosen vertex, capturing global properties of a Markov chain. We develop a matrix-analytic fram…
The -matrix group inverse problem for recoverable complete networks
Angeles Carmona, Andrés M. Encinas, Sweta Patra +1
This study investigates the conditions under which the group inverse of a singular, irreducible, symmetric -matrix retains the -matrix property. By concentrating on a structu…
Stable recovery of piecewise constant conductance on spider networks
Ángeles Carmona, Andrés M. Encinas, María José Jiménez +1
We address the discrete inverse conductance problem for well-connected spider networks; that is, to recover the conductance function on a well-connected spider network from the Dir…
The -matrix group inverse problem for distance-biregular graphs
Aida Abiad, Ángeles Carmona, Andrés M. Encinas +1
In this paper we provide the group inverse of the combinatorial Laplacian matrix of distance-biregular graphs using the so-called equilibrium measures for sets obtained by deleting…
Effective resistances and Kirchhoff Index in subdivision networks
Ángeles Carmona, Margarida Mitjana, Enric Monsó
We define a subdivision network of a given network by inserting a new vertex in every edge, so that each edge is replaced by two new edges with conductances that fulfill…
Green Operators of Networks with a new vertex
A. Carmona, A. M. Encinas, S. Gago +1
Any elliptic operator defines an automorphism on the orthogonal subspace to the eigenfunctions associated with the lowest eigenvalue, whose inverse is the orthogonal Green operator…