scientific article; zbMATH DE number 6110077

From MaRDI portal

zbMath1267.15004MaRDI QIDQ4649576

Michael Neumann, Stephen J. Kirkland

Publication date: 23 November 2012


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

The computation of key properties of Markov chains via perturbations, The Group Inverse of the Laplacian Matrix of a Graph, The W -weighted BT inverse, The \(M\)-matrix group inverse problem for distance-biregular graphs, Estimating random walk centrality in networks, On a matrix group constructed from an \(\{ R,s+1,k \}\)-potent matrix, Representations of the weighted WG inverse and a rank equation's solution, Ever-reaching probabilities and mean first passage times of higher order ergodic Markov chains, Maximizing Metapopulation Growth Rate and Biomass in Stream Networks, Perturbation bounds for the group inverse and its oblique projection, Performance and stability of direct methods for computing generalized inverses of the graph Laplacian, Unnamed Item, Acute perturbation of Drazin inverse and oblique projectors, Matrices whose group inverses are \(M\)-matrices, Further results on the perturbation estimations for the Drazin inverse, A combinatorial expression for the group inverse of symmetric \(M\)-matrices, Subclasses of (bc)-inverses, Spectral study of \(\{ R, s + 1, k \}\)- and \(\{R, s + 1, k, \ast \}\)-potent matrices, Minimising the largest mean first passage time of a Markov chain: the influence of directed graphs, Resistance distances in extended or contracted networks, Complete multipartite graphs and Braess edges, A Structured Condition Number for Kemeny's Constant, Singular irreducible \(M\)-operators on ordered Banach spaces, A recovery of two determinantal representations for derangement numbers, Random walk centrality and a partition of Kemeny’s constant, Matrix analysis for continuous-time Markov chains, Delta invariant for Eulerian digraphs, Impact of Varying Community Networks on Disease Invasion, Unnamed Item, Dissecting graph measure performance for node clustering in LFR parameter space, A weak group inverse for rectangular matrices, Sharp Entrywise Perturbation Bounds for Markov Chains