Graph disjointness is characterized by spectral overlap of Markov transition matrices and tree structures, depending only on vertex and edge sets rather than weights.
An introduction to joinings in ergodic theory
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Since their introduction by Furstenberg in 1967, joinings have proved a very powerful tool in ergodic theory. We present here some aspects of the use of joinings in the study of measurable dynamical systems, emphasizing on - the links between the existence of a non trivial common factor and the existence of a joining which is not the product measure, - how joinings can be employed to provide elegant proofs of classical results, - how joinings are involved in important questions of ergodic theory, such as pointwise convergence or Rohlin's multiple mixing problem.
fields
math.ST 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Graph Disjointness with Applications to Reversible Markov Chains
Graph disjointness is characterized by spectral overlap of Markov transition matrices and tree structures, depending only on vertex and edge sets rather than weights.