arXiv subjects

B. Meini

Publications and source records attributed to B. Meini.

3 recordsLinked to original sources

arXiv2022

An edge centrality measure based on the Kemeny constant

A new measure $c(e)$ of the centrality of an edge $e$ in an undirected graph $G$ is introduced. It is based on the variation of the Kemeny constant of the graph after removing the edge $e$. The new measure is designed in such a way that the Braess paradox is avoided. A numerical method for computing $c(e)$ is introduced and a regularization technique is designed in order to deal with cut-edges and disconnected graphs. Numerical experiments performed on synthetic tests and on real road networks show that this measure is particularly effective in revealing bottleneck roads whose removal would greatly reduce the connectivity of the network.

math.NA↗

arXiv2022

Computing eigenvalues of semi-infinite quasi-Toeplitz matrices

A quasi-Toeplitz (QT) matrix is a semi-infinite matrix of the form $A=T(a)+E$ where $T(a)$ is the Toeplitz matrix with entries $(T(a))_{i,j}=a_{j-i}$, for $a_{j-i}\in\mathbb C$, $i,j\ge 1$, while $E$ is a matrix representing a compact operator in $\ell^2$. The matrix $A$ is finitely representable if $a_k=0$ for $k<-m$ and for $k>n$, given $m,n>0$, and if $E$ has a finite number of nonzero entries. The problem of numerically computing eigenpairs of a finitely representable QT matrix is investigated, i.e., pairs $(\lambda,{\bf v})$ such that $A{\bf v}=\lambda {\bf v}$, with $\lambda\in\mathbb C$, ${\bf v}=(v_j)_{j\in\mathbb Z^+}$, ${\bf v}\ne 0$, and $\sum_{j=1}^\infty |v_j|^2<\infty$. It is shown that the problem is reduced to a finite nonlinear eigenvalue problem of the kind $ WU(\lambda){\pmb \beta}=0$, where $W$ is a constant matrix and $U$ depends on $\lambda$ and can be given in terms of either a Vandermonde matrix or a companion matrix. Algorithms relying on Newton's method applied to the equation $\det WU(\lambda)=0$ are analyzed. Numerical experiments show the effectiveness of this approach. The algorithms have been included in the CQT-Toolbox [Numer. Algorithms 81 (2019), no. 2, 741--769].

math.NA↗

arXiv2015

Computing the Exponential of Large Block-Triangular Block-Toeplitz Matrices Encountered in Fluid Queues

The Erlangian approximation of Markovian fluid queues leads to the problem of computing the matrix exponential of a subgenerator having a block-triangular, block-Toeplitz structure. To this end, we propose some algorithms which exploit the Toeplitz structure and the properties of generators. Such algorithms allow to compute the exponential of very large matrices, which would otherwise be untreatable with standard methods. We also prove interesting decay properties of the exponential of a generator having a block-triangular, block-Toeplitz structure.

math.NA↗