A note on certain ergodicity coefficients

Francesco Tudisco

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We investigate two ergodicity coefficients ɸ ∥∥ and τn−1, originally introduced to bound the subdominant eigenvalues of nonnegative matrices. The former has been generalized to complex matrices in recent years and several properties for such generalized version have been shown so far.We provide a further result concerning the limit of its powers. Then we propose a generalization of the second coefficient τ n−1 and we show that, under mild conditions, it can be used to recast the eigenvector problem Ax = x as a particular M-matrix linear system, whose coefficient matrix can be defined in terms of the entries of A. Such property turns out to generalize the two known equivalent formulations of the Pagerank centrality of a graph.
LanguageEnglish
Pages175-185
Number of pages11
JournalSpecial Matrices
Volume3
Issue number1
DOIs
Publication statusPublished - 3 Aug 2015

Fingerprint

Ergodicity
Coefficient
PageRank
Centrality
Nonnegative Matrices
M-matrix
Eigenvector
Linear Systems
Eigenvalue
Generalise
Formulation
Graph in graph theory

Keywords

  • ergodicity
  • eigenvalues
  • matrices
  • linear systems
  • pagerank
  • coefficients

Cite this

Tudisco, Francesco. / A note on certain ergodicity coefficients. In: Special Matrices. 2015 ; Vol. 3, No. 1. pp. 175-185.
@article{1c96ad89990b4578b8766487869219d5,
title = "A note on certain ergodicity coefficients",
abstract = "We investigate two ergodicity coefficients ɸ ∥∥ and τn−1, originally introduced to bound the subdominant eigenvalues of nonnegative matrices. The former has been generalized to complex matrices in recent years and several properties for such generalized version have been shown so far.We provide a further result concerning the limit of its powers. Then we propose a generalization of the second coefficient τ n−1 and we show that, under mild conditions, it can be used to recast the eigenvector problem Ax = x as a particular M-matrix linear system, whose coefficient matrix can be defined in terms of the entries of A. Such property turns out to generalize the two known equivalent formulations of the Pagerank centrality of a graph.",
keywords = "ergodicity, eigenvalues, matrices, linear systems, pagerank, coefficients",
author = "Francesco Tudisco",
year = "2015",
month = "8",
day = "3",
doi = "10.1515/spma-2015-0016",
language = "English",
volume = "3",
pages = "175--185",
journal = "Special Matrices",
issn = "2300-7451",
number = "1",

}

A note on certain ergodicity coefficients. / Tudisco, Francesco.

In: Special Matrices, Vol. 3, No. 1, 03.08.2015, p. 175-185.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A note on certain ergodicity coefficients

AU - Tudisco, Francesco

PY - 2015/8/3

Y1 - 2015/8/3

N2 - We investigate two ergodicity coefficients ɸ ∥∥ and τn−1, originally introduced to bound the subdominant eigenvalues of nonnegative matrices. The former has been generalized to complex matrices in recent years and several properties for such generalized version have been shown so far.We provide a further result concerning the limit of its powers. Then we propose a generalization of the second coefficient τ n−1 and we show that, under mild conditions, it can be used to recast the eigenvector problem Ax = x as a particular M-matrix linear system, whose coefficient matrix can be defined in terms of the entries of A. Such property turns out to generalize the two known equivalent formulations of the Pagerank centrality of a graph.

AB - We investigate two ergodicity coefficients ɸ ∥∥ and τn−1, originally introduced to bound the subdominant eigenvalues of nonnegative matrices. The former has been generalized to complex matrices in recent years and several properties for such generalized version have been shown so far.We provide a further result concerning the limit of its powers. Then we propose a generalization of the second coefficient τ n−1 and we show that, under mild conditions, it can be used to recast the eigenvector problem Ax = x as a particular M-matrix linear system, whose coefficient matrix can be defined in terms of the entries of A. Such property turns out to generalize the two known equivalent formulations of the Pagerank centrality of a graph.

KW - ergodicity

KW - eigenvalues

KW - matrices

KW - linear systems

KW - pagerank

KW - coefficients

U2 - 10.1515/spma-2015-0016

DO - 10.1515/spma-2015-0016

M3 - Article

VL - 3

SP - 175

EP - 185

JO - Special Matrices

T2 - Special Matrices

JF - Special Matrices

SN - 2300-7451

IS - 1

ER -