25 citations · 47 across the 16 of their papers we have counts for
21 papers
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 subject to restrictions specified by a nonnegative transition matrix, propose an algorithm for determining wheth…
A classification of nonexpansive Bratteli-Vershik systems
Karl Petersen, Sandi Shields
We study simple, properly ordered nonexpansive Bratteli-Vershik () systems. Correcting a mistake in an earlier paper, we redefine the classes standard nonexpansive () and…
Entropy on regular trees
Karl Petersen, Ibrahim Salama
We show that the limit in our definition of tree shift topological entropy is actually the infimum, as is the case for both the topological and measure-theoretic entropies in the c…
Periodic codings of Bratteli-Vershik systems
Sarah Frick, Karl Petersen, Sandi Shields
We develop conditions for the coding of a Bratteli-Vershik system according to initial path segments to be periodic, equivalently for a constructive symbolic recursive scheme corre…
Tree shift topological entropy
Karl Petersen, Ibrahim Salama
We give a definition of topological entropy for tree shifts, prove that the limit in the definition exists, and show that it dominates the topological entropy of the associated one…
Constructive symbolic presentations of rank one measure-preserving systems
Terrence Adams, Sébastien Ferenczi, Karl Petersen
Given a rank one measure-preserving system defined by cutting and stacking with spacers, we produce a rank one binary sequence such that its orbit closure under the shift transform…