Let ? act on a countable set V with only nitely many orbits. Given a ?-invariant random environment for a Markov chain on V and a random scenery, we exhibit, under certain conditions, an equivalent stationary measure for the environment and scenery from the viewpoint of the random walker. Such theorems have been very useful in investigations of percolation on quasi-transitive graphs.

Let act on a countable set V with only nitely many orbits Given a invariant random environment for a Markov chain on V and a random scenery we exhibit under certain conditions an equivalent stationary measure for the environment and scenery from the viewpoint of the random walker Such theorems have been very useful in investigations of percolation on quasi transitive graphs

In the present paper we show that for any given digraph , is, an oriented graph without self-loops and 2-cycles, one can construct a 1-dependent Markov chain n identically distributed hitting times T1, … Tn on this such probability of event Ti > Tj, i, j = 1, n, is larger than if only . This result related to various paradoxes in theory, concerning particular non-transitive dice.

The paper presents two terminating tableau systems for hybrid logic with the difference modality. Both systems are based on an abstract treatment of equality. They expand formulas with respect to a congruence closure that is not represented explicitly. The first system employs pattern-based blocking. The second system employs chain-based blocking and covers converse modalities. Both systems can...

after the classification of the flag-transitive linear spaces, the attention has been turned to line-transitive linear spaces. in this article, we present a partial classification of the finite linear spaces $mathcal s$ on which an almost simple group $g$ with the socle $g_2(q)$ acts line-transitively.

In this paper, we first introduce the pseudo-entropy of free semigroup actions and show that it is equal to topological entropy defined by Bufetov [9]. Second, for actions, concepts chain recurrence time, mixing time are introduced, upper bounds these times calculated. Furthermore, lower box dimension provide a bound on actions. Third, structure transitive systems discussed. Our analysis genera...

we consider the transitive linear maps on the operator algebra $b(x)$for a separable banach space $x$. we show if a bounded linear map is norm transitive on $b(x)$,then it must be hypercyclic with strong operator topology. also we provide a sot-transitivelinear map without being hypercyclic in the strong operator topology.

We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanisms. In particular, we show that the transitive closure cannot be maintained in relational calculus under deletion of edges. We use new proof techniques to show this result. These proof techniques generalize to other la...

This paper presents an e cient method for state classi cation of nite state Markov chains using BDD-based symbolic techniques. The method exploits the fundamental properties of a Markov chain and classi es the state space by iteratively applying reachability analysis. We compare our method with the current state-of-the-art technique which requires the computation of the transitive closure of th...

This paper presents an e cient method for state classi cation of nite state Markov chains using BDD-based symbolic techniques. The method exploits the fundamental properties of a Markov chain and classi es the state space by iteratively applying reachability analysis. We compare our method with the current state-of-the-art technique which requires the computation of the transitive closure of th...