5 citations · 5 across the 3 of their papers we have counts for
4 papers
The Derivative of Kemeny's Constant as a Centrality Measure in Undirected Graphs
Dario A. Bini, Beatrice Meini, Federico Poloni
Kemeny's constant quantifies a graph's connectivity by measuring the average time for a random walker to reach any other vertex. We introduce two concepts of the directional deriva…
Invariant subspaces of -palindromic pencils and algebraic -Riccati equations
Bruno Iannazzo, Beatrice Meini, Federico Poloni
By exploiting the connection between solving algebraic -Riccati equations and computing certain deflating subspaces of -palindromic matrix pencils, we obtain theoretica…
A general framework for the rigorous computation of invariant densities and the coarse-fine strategy
Stefano Galatolo, Maurizio Monge, Isaia Nisoli +1
In this paper we present a general, axiomatical framework for the rigorous approximation of invariant densities and other important statistical features of dynamics. We approximate…
On the use of Markov chains for epidemic modeling on networks
Sooyeong Kim, Jane Breen, Ekaterina Dudkina +2
We discuss various models for epidemics on networks that rely on Markov chains. Random walks on graphs are often used to predict epidemic spread and to investigate possible control…