Generalizations of bounds on the index of convergence to weighted digraphs

From MaRDI portal
Publication:741541

DOI10.1016/J.DAM.2014.06.026zbMATH Open1300.05121arXiv1307.3716OpenAlexW2160736732MaRDI QIDQ741541FDOQ741541


Authors: Glenn Merlet, Thomas Nowak, Hans Schneider, Sergey M. Sergeev Edit this on Wikidata


Publication date: 12 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: We study sequences of optimal walks of a growing length, in weighted digraphs, or equivalently, sequences of entries of max-algebraic matrix powers with growing exponents. It is known that these sequences are eventually periodic when the digraphs are strongly connected. The transient of such periodicity depends, in general, both on the size of digraph and on the magnitude of the weights. In this paper, we show that some bounds on the indices of periodicity of (unweighted) digraphs, such as the bounds of Wielandt, Dulmage-Mendelsohn, Schwarz, Kim and Gregory-Kirkland-Pullman, apply to the weights of optimal walks when one of their ends is a critical node.


Full work available at URL: https://arxiv.org/abs/1307.3716




Recommendations




Cites Work


Cited In (13)





This page was built for publication: Generalizations of bounds on the index of convergence to weighted digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741541)