On system complexity, stability and performance: application to prediction

DOI10.2140/MEMOCS.2024.12.411MaRDI QIDQ7027856zbMATH OpenFDO

Authors Joel Ratsaby

Publication date 14 February 2025

Published in Mathematics and Mechanics of Complex Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/MEMOCS.2024.12.411

zbMATH Keywords

entropyconcentration inequalitysystem complexityMarkov chain prediction

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Inference from stochastic processes and prediction (62M20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cites work

• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• scientific article; zbMATH DE number 1992420 (Why is no real title available?)
• scientific article; zbMATH DE number 1460605 (Why is no real title available?)
• scientific article; zbMATH DE number 1426485 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• An empirical study of the complexity and randomness of prediction error sequences
• Elements of Information Theory
• Interaction of a self vibrating beam with chaotic external forces
• Neural Network Learning
• ON DETERMINISTIC FINITE STATE MACHINES IN RANDOM ENVIRONMENTS
• On the algorithmic complexity of static structures
• On the descriptional complexity of systems and their output response
• Some properties of sequential predictors for binary Markov sources
• Understanding Markov Chains
• Universal prediction of individual sequences

This page was built for publication: On system complexity, stability and performance: application to prediction

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