Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message

Login Alert

Cancel
Log in
×
×
Register
Log In
(0) Cart
Logo for Cambridge Core from Cambridge University Press. Click to return to homepage.
Logo for Cambridge Core from Cambridge University Press. Click to return to homepage.

Cited by
  • Crossref logo 17
  • Google Scholar logo
Crossref Citations
Crossref logo
This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Xu, Chuang and Berger, Arno 2019. Best finite constrained approximations of one-dimensional probabilities. Journal of Approximation Theory, Vol. 244, Issue. , p. 1.
  • CrossRef
  • Google Scholar

Giles, Michael B. Hefter, Mario Mayer, Lukas and Ritter, Klaus 2019. Random bit multilevel algorithms for stochastic differential equations. Journal of Complexity, Vol. 54, Issue. , p. 101395.
  • CrossRef
  • Google Scholar

Chevallier, J. Duarte, A. Löcherbach, E. and Ost, G. 2019. Mean field limits for nonlinear spatially extended Hawkes processes with exponential memory kernels. Stochastic Processes and their Applications, Vol. 129, Issue. 1, p. 1.
  • CrossRef
  • Google Scholar

Berger, Arno and Xu, Chuang 2020. Asymptotics of One-Dimensional Lévy Approximations. Journal of Theoretical Probability, Vol. 33, Issue. 2, p. 1164.
  • CrossRef
  • Google Scholar

Neumayer, Sebastian and Steidl, Gabriele 2021. Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging. p. 1.
  • CrossRef
  • Google Scholar

Ehler, Martin Gräf, Manuel Neumayer, Sebastian and Steidl, Gabriele 2021. Curve Based Approximation of Measures on Manifolds by Discrepancy Minimization. Foundations of Computational Mathematics, Vol. 21, Issue. 6, p. 1595.
  • CrossRef
  • Google Scholar

Heinemann, Florian Munk, Axel and Zemel, Yoav 2022. Randomized Wasserstein Barycenter Computation: Resampling with Statistical Guarantees. SIAM Journal on Mathematics of Data Science, Vol. 4, Issue. 1, p. 229.
  • CrossRef
  • Google Scholar

Bencheikh, O. and Jourdain, B. 2022. Approximation rate in Wasserstein distance of probability measures on the real line by deterministic empirical measures. Journal of Approximation Theory, Vol. 274, Issue. , p. 105684.
  • CrossRef
  • Google Scholar

Kuehn, Christian and Xu, Chuang 2022. Vlasov equations on digraph measures. Journal of Differential Equations, Vol. 339, Issue. , p. 261.
  • CrossRef
  • Google Scholar

Kratsios, Anastasis 2023. Universal Regular Conditional Distributions via Probabilistic Transformers. Constructive Approximation, Vol. 57, Issue. 3, p. 1145.
  • CrossRef
  • Google Scholar

Neumayer, Sebastian and Steidl, Gabriele 2023. Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging. p. 1791.
  • CrossRef
  • Google Scholar

Eckstein, Stephan and Nutz, Marcel 2024. Convergence Rates for Regularized Optimal Transport via Quantization. Mathematics of Operations Research, Vol. 49, Issue. 2, p. 1223.
  • CrossRef
  • Google Scholar

Acciaio, Beatrice Kratsios, Anastasis and Pammer, Gudmund 2024. Designing universal causal deep learning models: The geometric (Hyper)transformer. Mathematical Finance, Vol. 34, Issue. 2, p. 671.
  • CrossRef
  • Google Scholar

Hernández-Maldonado, Victor Miguel Erdely, Arturo Díaz-Viera, Martín and Rios, Leonardo 2024. Fast procedure to compute empirical and Bernstein copulas. Applied Mathematics and Computation, Vol. 477, Issue. , p. 128827.
  • CrossRef
  • Google Scholar

Kuehn, Christian and Xu, Chuang 2025. Vlasov equations on directed hypergraph measures. Partial Differential Equations and Applications, Vol. 6, Issue. 1,
  • CrossRef
  • Google Scholar

Aydın, Ata Deniz and Iacobelli, Mikaela 2025. Asymptotic quantization of measures on Riemannian manifolds via covering growth estimates. Advances in Mathematics, Vol. 474, Issue. , p. 110311.
  • CrossRef
  • Google Scholar

Gkogkas, Marios Antonios Kuehn, Christian and Xu, Chuang 2025. Mean field limits of co-evolutionary signed heterogeneous networks. European Journal of Applied Mathematics, p. 1.
  • CrossRef
  • Google Scholar

Google Scholar Citations

View all Google Scholar citations for this article.

×
Cambridge University Press

Our Site

  • Accessibility
  • Contact & Help
  • Legal Notices

Quick Links

  • Cambridge Core
  • Cambridge Open Engage
  • Cambridge Aspire

Our Products

  • Journals
  • Books
  • Elements
  • Textbooks
  • Courseware

Join us online

Please choose a valid location.

  • Rights & Permissions
  • Copyright
  • Privacy Notice
  • Terms of Use
  • Cookies Policy
Cambridge University Press 2025

Cancel
Confirm
×

Save article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Uniform decomposition of probability measures: quantization, clustering and rate of convergence
  • Volume 55, Issue 4
  • Julien Chevallier (a1)
  • DOI: https://doi.org/10.1017/jpr.2018.69
Please provide your Kindle email.
Available formats Please select a format to save.
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Uniform decomposition of probability measures: quantization, clustering and rate of convergence
  • Volume 55, Issue 4
  • Julien Chevallier (a1)
  • DOI: https://doi.org/10.1017/jpr.2018.69
Available formats Please select a format to save.
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Uniform decomposition of probability measures: quantization, clustering and rate of convergence
  • Volume 55, Issue 4
  • Julien Chevallier (a1)
  • DOI: https://doi.org/10.1017/jpr.2018.69
Available formats Please select a format to save.
×
×

Reply to: Submit a response

Contents help
Close Contents help

- No HTML tags allowed
- Web page URLs will display as text only
- Lines and paragraphs break automatically
- Attachments, images or tables are not permitted

Please enter your response.

Your details

Email help
Close Email help

Your email address will be used in order to notify you when your comment has been reviewed by the moderator and in case the author(s) of the article or the moderator need to contact you directly.

Please enter a valid email address.

You have entered the maximum number of contributors

Conflicting interests

Do you have any conflicting interests? * Conflicting interests help

Close Conflicting interests help

Please list any fees and grants from, employment by, consultancy for, shared ownership in or any close relationship with, at any time over the preceding 36 months, any organisation whose interests may be affected by the publication of the response. Please also list any non-financial associations or interests (personal, professional, political, institutional, religious or other) that a reasonable reader would want to know about in relation to the submitted work. This pertains to all the authors of the piece, their spouses or partners.