On optimal random nets
From MaRDI portal
Publication:2365849
This paper is concerned with the study of the so-called entropy numbers for linear operators acting between real Banach spaces. The author proposes the respective counterparts of the entropy numbers in the average and Monte Carlo settings and obtains their behaviour for Sobolev embeddings. As a consequence the author improves his previous estimates for average Kolmogorov numbers [ibid. 7, No. 3, 261-281 (1991; Zbl 0735.65004)], showing that the logarithmic factor is superfluous.
Recommendations
- Beyond the binary case in random nets
- Computational Science and Its Applications – ICCSA 2004
- scientific article; zbMATH DE number 5233923
- scientific article; zbMATH DE number 3880759
- Optimal paths in probabilistic networks
- Networks and the best approximation property
- On Markovian random networks
- Bounds On The Expected Maximal Value Of A Class Of Stochastic Network Problems
- Random equilibrium problems on networks
- Finite approximation for unimodular random networks
Cited in
(6)- Estimates of probabilistic widths of the diagonal operator of finite-dimensional sets with the Gaussian measure
- On Uniformly Optimal Networks: A Reversal of Fortune?
- A fresh look at free choice nets
- Free-choice Nets with Home Clusters are Lucent
- *-Jordan-triple maps on alternative *-algebras
- Networks and the best approximation property
This page was built for publication: On optimal random nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365849)