Showing 1947–1960 of 172,946 results for "Ibrahim Mohammadzadeh"

Resource 2025 EN

Arrival of information at a target set in a network

Karl Petersen · Ibrahim Salama

We consider labelings of a finite regular tree by a finite alphabet subjectto restrictions specified by a nonnegative transition matrix, propose analgorithm for determining whether the set of possible configurations on thelast row of the tree is independent of the symbol at the root, and prove thatthe algorithm succeeds in a bounded number of steps, provided that thedimension of the tree is greater than or equal to the maximum row sum of thetransition matrix. (The question was motivated by calculation of topologicalpressure on trees and is an extension of the idea of primitivity fornonnegative matrices.)

Not Specified