A Spanning Tree Invariant for Markov Shifts
نویسندگان
چکیده
We introduce a new type of invariant of block isomorphism for Markov shifts, defined by summing the weights of all spanning trees for a presentation of the Markov shift. We give two proofs of invariance. The first uses the Matrix-Tree Theorem to show that this invariant can be computed from a known invariant, the stochastic zeta function of the shift. The second uses directly the definition to show invariance under state splitting, from which all block isomorphisms can be built.
منابع مشابه
Invariants for Weighted Digraphs under One-Sided State Splittings
State in-splittings and out-splittings are very important operations in the theory of one-sided, or two-sided Markov shifts ([1, 2]). Lind and Tuncel introduced a spanning tree invariant forMarkov shifts in [3]. Spanning tree invariants are further studied in [4–6]. Motivated by these works, we consider some other graph structures like cycles and forests and present some invariants for weighted...
متن کاملGood Potentials for Almost Isomorphism of Countable State Markov Shifts
Almost isomorphism is an equivalence relation on countable state Markov shifts which provides a strong version of Borel conjugacy; still, for mixing SPR shifts, entropy is a complete invariant of almost isomorphism [2]. In this paper, we establish a class of potentials on countable state Markov shifts whose thermodynamic formalism is respected by almost isomorphism.
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملProviding a Simple Method for the Calculation of the Source and Target Reliabili- ty in a Communication Network (SAT)
The source and target reliability in SAT network is de- fined as the flawless transmission from the source node to all the other nodes. In some references, the SAT pro- cess has been followed between all the node pairs but it is very time-consuming in today’s widespread networks and involves many costs. In this article, a method has been proposed to compare the reliability in complex networks b...
متن کامل