Maria Jose Jimenez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Maria Jose Jimenez has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Andrés M. Encinas
Universitat Politecnica de Catalunya
15 shared publications - Angeles Carmona
Universitat Politecnica de Catalunya
7 shared publications - Aida Abiad
Eindhoven University of Technology, Vrije Universiteit Brussel
2 shared publications - Margarida Mitjana
Departament de Matemàtiques, Universitat Politècnica de Catalunya, Barcelona, Spain
2 shared publications - Álvaro Samperio
Departamento de Álgebra Análisis Matemático Geometría y Topología and IMUVA Universidad de Valladolid Valladolid Spain
2 shared publications A. Carmona
1 shared publication
Latest Publications
- 22 July 2026
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 42, 591-612
Network parameters via equilibrium measures in Schrödinger random walks
In this work, we explore the concept of equilibrium measures within the framework of Schr¨odinger random walks on networks. Building on previous work, we demonstrate how these equilibrium measures can be leveraged to compute key network parameters such as the Mean First Passage Time (MFPT) and Kemeny’s constant. By expressing these parameters in terms of generalized inverses of the associated M-matrix, we provide new insights and efficient computational tools for network analysis. The results are particularly applicable to both star and path networks, where we offer explicit formulations for these fundamental quantities. Our findings highlight the importance of equilibrium measures as a powerful tool in the study of complex networks.
- 22 July 2026
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 42, 591-612
Network parameters via equilibrium measures in Schrödinger random walks
In this work, we explore the concept of equilibrium measures within the framework of Schr¨odinger random walks on networks. Building on previous work, we demonstrate how these equilibrium measures can be leveraged to compute key network parameters such as the Mean First Passage Time (MFPT) and Kemeny’s constant. By expressing these parameters in terms of generalized inverses of the associated M-matrix, we provide new insights and efficient computational tools for network analysis. The results are particularly applicable to both star and path networks, where we offer explicit formulations for these fundamental quantities. Our findings highlight the importance of equilibrium measures as a powerful tool in the study of complex networks.
- 1 October 2025
- Published by Springer Nature
- p. 1-26
On the Spectrum of Jacobi Matrices with Periodic Coefficients
- 1 October 2025
- Published by Springer Nature
- p. 1-26
On the Spectrum of Jacobi Matrices with Periodic Coefficients
- Open Access
A Spectral Approach to Kemeny's Constant
Kemeny's constant quantifies the expected time for a random walk to reach a randomly chosen vertex, providing insight into the global behavior of a Markov chain. We present a novel eigenvector-based formula for computing Kemeny's constant. Moreover, we analyze the impact of network structure on Kemeny's constant. In particular, we use various spectral techniques, such as spectral sparsification of graphs and eigenvalue interlacing, and show that they are particularly useful in this context for deriving approximations and sharp bounds for Kemeny's constant
Open AccessA Spectral Approach to Kemeny's Constant
Kemeny's constant quantifies the expected time for a random walk to reach a randomly chosen vertex, providing insight into the global behavior of a Markov chain. We present a novel eigenvector-based formula for computing Kemeny's constant. Moreover, we analyze the impact of network structure on Kemeny's constant. In particular, we use various spectral techniques, such as spectral sparsification of graphs and eigenvalue interlacing, and show that they are particularly useful in this context for deriving approximations and sharp bounds for Kemeny's constant
- 31 July 2024
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 101 (11) , 1237-1254
Stable recovery of piecewise constant conductance on spider networks
- 31 July 2024
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 101 (11) , 1237-1254
Stable recovery of piecewise constant conductance on spider networks
- Open Access
Stable recovery of piecewise constant conductance on spider networks
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 Dirichlet-to-Neumann map. It is well-known that this inverse problem is exponentially ill-posed, requiring the implementation of a regularization strategy for numerical solutions. Our focus lies in exploring whether prior knowledge of the conductance being piecewise constant within a partition of the edge set comprising few subsets enables stable conductance recovery. To achieve this, we propose formulating the problem as a polynomial optimization one, incorporating a regularization term that accounts for the piecewise constant hypothesis. We show several experimental examples in which the stable conductance recovery under the aforementioned hypothesis is feasible.
Open AccessStable recovery of piecewise constant conductance on spider networks
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 Dirichlet-to-Neumann map. It is well-known that this inverse problem is exponentially ill-posed, requiring the implementation of a regularization strategy for numerical solutions. Our focus lies in exploring whether prior knowledge of the conductance being piecewise constant within a partition of the edge set comprising few subsets enables stable conductance recovery. To achieve this, we propose formulating the problem as a polynomial optimization one, incorporating a regularization term that accounts for the piecewise constant hypothesis. We show several experimental examples in which the stable conductance recovery under the aforementioned hypothesis is feasible.
- Open Access
- 18 April 2023
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 42 (4) , 1-16
The M-matrix group inverse problem for distance-biregular graphs
In this work, we obtain the group inverse of the combinatorial Laplacian matrix of distance-biregular graphs. This expression can be obtained trough the so-called equilibrium measures for sets obtained by deleting a vertex. Moreover, we show that the two equilibrium arrays characterizing distance-biregular graphs can be expressed in terms of the mentioned equilibrium measures. As a consequence of the minimum principle, we provide a characterization of when the group inverse of the combinatorial Laplacian matrix of a distance-biregular graph is an M-matrix.
- 18 April 2023
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 42 (4) , 1-16
Open AccessThe M-matrix group inverse problem for distance-biregular graphs
In this work, we obtain the group inverse of the combinatorial Laplacian matrix of distance-biregular graphs. This expression can be obtained trough the so-called equilibrium measures for sets obtained by deleting a vertex. Moreover, we show that the two equilibrium arrays characterizing distance-biregular graphs can be expressed in terms of the mentioned equilibrium measures. As a consequence of the minimum principle, we provide a characterization of when the group inverse of the combinatorial Laplacian matrix of a distance-biregular graph is an M-matrix.
- Open Access
- 18 October 2021
- Published by Walter de Gruyter GmbH in Special Matrices
- Vol. 10 (1) , 87-108
The group inverse of circulant matrices depending on four parameters
Explicit expressions for the coefficients of the group inverse of a circulant matrix depending on four complex parameters are analytically derived. The computation of the entries of the group inverse are now reduced to the evaluation of a polynomial. Moreover, our methodology applies to both the invertible and the singular case, the latter being computationally less expensive. The techniques we use are related to the solution of boundary value problems associated with second order linear difference equations.
- 18 October 2021
- Published by Walter de Gruyter GmbH in Special Matrices
- Vol. 10 (1) , 87-108
Open AccessThe group inverse of circulant matrices depending on four parameters
Explicit expressions for the coefficients of the group inverse of a circulant matrix depending on four complex parameters are analytically derived. The computation of the entries of the group inverse are now reduced to the evaluation of a polynomial. Moreover, our methodology applies to both the invertible and the singular case, the latter being computationally less expensive. The techniques we use are related to the solution of boundary value problems associated with second order linear difference equations.
- 1 April 2021
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 614, 415-436
The group inverse of some circulant matrices
- 1 April 2021
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 614, 415-436
The group inverse of some circulant matrices
- 1 September 2019
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 576, 301-323
Triangular sequences, combinatorial recurrences and linear difference equations
- 1 September 2019
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 576, 301-323
Triangular sequences, combinatorial recurrences and linear difference equations
- Open Access
- 22 July 2019
- Published by Springer Nature in Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
- Vol. 113 (4) , 3795-3828
Boundary value problems for second order linear difference equations: application to the computation of the inverse of generalized Jacobi matrices
- 22 July 2019
- Published by Springer Nature in Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
- Vol. 113 (4) , 3795-3828
Open AccessBoundary value problems for second order linear difference equations: application to the computation of the inverse of generalized Jacobi matrices