English
Related papers

Related papers: A new generalized prime random approximation proce…

200 papers

In this paper we propose a new deterministic approximation method, called discretization approximation, for Bayesian computation. Discretization approximation is very simple to understand and to implement, It only requires calculating…

Computation · Statistics 2026-01-13 Shifeng Xiong

Given a sequence of frequencies $\{\lambda_n\}_{n\geq1}$, a corresponding generalized Dirichlet series is of the form $f(s)=\sum_{n\geq 1}a_ne^{-\lambda_ns}$. We are interested in multiplicatively generated systems, where each number…

Number Theory · Mathematics 2024-05-08 Frederik Broucke , Athanasios Kouroupis , Karl-Mikael Perfekt

We construct a Beurling generalized number system satisfying the Riemann hypothesis and whose integer counting function displays extremal oscillation in the following sense. The prime counting function of this number system satisfies…

Number Theory · Mathematics 2020-10-16 Frederik Broucke , Gregory Debruyne , Jasson Vindas

An important functional of Poisson random measure is the negative binomial process (NBP). We use NBP to introduce a generalized Poisson-Kingman distribution and its corresponding random discrete probability measure. This random discrete…

Statistics Theory · Mathematics 2023-07-04 Sadegh Chegini , Mahmoud Zarepour

The set of primes where a hypergeomeric series with rational parameters is $p$-adically bounded is known by [10] to have a Dirichlet density. We establish a formula for this Dirichlet density and conjecture that it is rare for the density…

Number Theory · Mathematics 2018-03-29 Cameron Franc , Brandon Gill , Jason Goertzen , Jarrod Pas , Frankie Tu

A family of random probabilities is defined and studied. This family contains the Dirichlet process as a special case, corresponding to an inner point in the appropriate parameter space. The extension makes it possible to have random means…

Statistics Theory · Mathematics 2026-04-21 Nils Lid Hjort

The rapid advancements in high-dimensional statistics and machine learning have increased the use of first-order methods. Many of these methods can be regarded as instances of the proximal point algorithm. Given the importance of the…

Optimization and Control · Mathematics 2024-11-05 Ya-xiang Yuan , Yi Zhang

Rate-independent systems arise in a number of applications. Usually, weak solutions to such problems with potentially very low regularity are considered, requiring mathematical techniques capable of handling nonsmooth functions. In this…

Analysis of PDEs · Mathematics 2017-08-18 Filip Rindler , Sebastian Schwarzacher , Endre Süli

In this paper, a modification of the conventional approximations to the quasi-maximum likelihood method is introduced for the parameter estimation of diffusion processes from discrete observations. This is based on a convergent…

Optimization and Control · Mathematics 2013-12-19 J. C. Jimenez

We provide a general theorem bounding the error in the approximation of a random measure of interest--for example, the empirical population measure of types in a Wright-Fisher model--and a Dirichlet process, which is a measure having…

Probability · Mathematics 2020-07-07 Han L. Gan , Nathan Ross

We analyze a recently proposed class of algorithms for the problem of sampling from probability distributions $\mu^\ast$ in $\mathbb{R}^d$ with a Lebesgue density of the form $\mu^\ast(x) \propto \exp(-f(Kx)-g(x))$, where $K$ is a linear…

Optimization and Control · Mathematics 2024-11-06 Martin Burger , Matthias J. Ehrhardt , Lorenz Kuger , Lukas Weigand

We consider the probabilistic numerical scheme for fully nonlinear PDEs suggested in \cite{cstv}, and show that it can be introduced naturally as a combination of Monte Carlo and finite differences scheme without appealing to the theory of…

Probability · Mathematics 2010-08-26 Arash Fahim , Nizar Touzi , Xavier Warin

This article presents an efficient algorithm to generate a discrete uniform distribution on a set of $p$ elements using a biased random source for $p$ prime. The algorithm generalizes Von Neumann's method and improves computational…

Probability · Mathematics 2023-01-18 Xiaoyu Lei

A succesful method to describe the asymptotic behavior of a discrete time stochastic process governed by some recursive formula is to relate it to the limit sets of a well chosen mean differential equation. Under an attainability condition,…

Probability · Mathematics 2011-01-19 Mathieu Faure , Gregory Roth

In this work we discuss the problem of selecting suitable approximators from families of parameterized elementary functions that are known to be dense in a Hilbert space of functions. We consider and analyze published procedures, both…

Numerical Analysis · Computer Science 2016-09-01 Alexander N. Gorban , Ivan Yu. Tyukin , Danil V. Prokhorov , Konstantin I. Sofeikov

We derive the conjugate prior of the Dirichlet and beta distributions and explore it with numerical examples to gain an intuitive understanding of the distribution itself, its hyperparameters, and conditions concerning its convergence. Due…

Machine Learning · Statistics 2021-07-08 Kaspar Thommen

We propose a straightforward and effective method for discretizing multi-dimensional diffusion processes as an extension of Milstein scheme. The new scheme is explicitly given and can be simulated using Gaussian variates, requiring the same…

Numerical Analysis · Mathematics 2024-09-04 Yuga Iguchi , Toshihiro Yamada

The two parameter Poisson-Dirichlet Process (PDP), a generalisation of the Dirichlet Process, is increasingly being used for probabilistic modelling in discrete areas such as language technology, bioinformatics, and image analysis. There is…

Statistics Theory · Mathematics 2012-02-17 Wray Buntine , Marcus Hutter

The Dirichlet process mixture (DPM) is a ubiquitous, flexible Bayesian nonparametric statistical model. However, full probabilistic inference in this model is analytically intractable, so that computationally intensive techniques such as…

Machine Learning · Statistics 2014-11-05 Yordan P. Raykov , Alexis Boukouvalas , Max A. Little

Given an orthogonal lattice with mesh length h on a bounded convex domain, we propose to approximate the Aleksandrov solution of the Monge-Ampere equation by regularizing the data and discretizing the equation in a subdomain using the…

Numerical Analysis · Mathematics 2015-07-31 Gerard Awanou
‹ Prev 1 2 3 10 Next ›