REVIEW 2 cited by
An introduction to joinings in ergodic theory
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 2 Pith papers
-
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.
-
Ergodic Optimization with Linear Constraints
Under linear constraints on invariant measures, the constrained ergodic optimization problem still admits optimizers, has a unique optimizer for generic and prevalent objective functions, and satisfies a duality formu...
Discussion (0). Continue with ORCID to comment.