How complex is a random picture?
From MaRDI portal
Publication:2001211
DOI10.1016/j.jco.2018.11.003zbMath1422.60008arXiv1806.06597OpenAlexW2962874924WikidataQ128897241 ScholiaQ128897241MaRDI QIDQ2001211
Frank Aurzada, Mikhail Lifshits
Publication date: 2 July 2019
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.06597
metric entropyBoolean modelhigh resolution quantizationinformation based complexityfunctional quantization
Probability measures on topological spaces (60B05) Large deviations (60F10) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinite-dimensional quadrature and approximation of distributions
- High-resolution quantization and entropy coding for fractional Brownian motion
- The coding complexity of diffusion processes under supremum norm distortion
- The coding complexity of diffusion processes under \(L^p[0,1\)-norm distortion]
- High resolution quantization and entropy coding of jump processes
- Foundations of quantization for probability distributions
- Functional quantization rate and mean regularity of processes with an application to Lévy processes
- A local refinement strategy for constructive quantization of scalar SDEs
- Partial functional quantization and generalized bridges
- Fractal functional quantization of mean-regular stochastic processes
- Stochastic and Integral Geometry
- Optimal Quantization for Finance: From Random Vectors to Stochastic Processes
- Constructive Quantization and Multilevel Algorithms for Quadrature of Stochastic Differential Equations
- Elements of Information Theory
- Three approaches to the quantitative definition of information*
This page was built for publication: How complex is a random picture?
