PERFECTION IN R-PROCESSES

DOI10.1142/S1793830909000269MaRDI QIDQ3646204zbMATH OpenOpenAlexFDO

Authors Stephen M. Shea

Publication date 19 November 2009

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830909000269

zbMATH Keywords

Bernoulli schemeMarkovperfect graphr-process

Mathematics Subject Classification ID

Perfect graphs (05C17) Directed graphs (digraphs), tournaments (05C20) Renewal theory (60K05)

Recommendations

• A note on r-processes
• Permanental processes
• Minification processes with discrete marginals
• Processes with long memory: Regenerative construction and perfect simulation
• On permanental processes

Cites work

• A class of finitary codes
• A mixing Markov chain with exponentially decaying return times is finitarily Bernoulli
• Bernoulli schemes of the same entropy are finitarily isomorphic
• Factors of Bernoulli shifts are Bernoulli shifts
• Finitary codes between Markov processes
• Finitary isomorphisms of irreducible Markov shifts
• Finitary Isomorphisms with Finite Expected Code Lengths
• scientific article; zbMATH DE number 3463931 (Why is no real title available?)
• Normal hypergraphs and the perfect graph conjecture
• On the finitary isomorphisms of markov shifts that have finite expected coding time
• The finitary coding of two Bernoulli schemes with unequal entropies has finite expectation

Cited in

(1)

• A note on r-processes

This page was built for publication: PERFECTION IN R-PROCESSES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3646204)