English
Related papers

Related papers: Approximating mixed H\"older functions using rando…

200 papers

We will show in this paper that if $\lambda$ is very close to 1, then $$I(M,\lambda,m)= \sup_{u\in H^{1,n}_0(M) ,\int_M|\nabla u|^ndV=1}\int_\Omega (e^{\alpha_n |u|^\frac{n}{n-1}}-\lambda\sum\limits_{k=1}^m\frac{|\alpha_nu^\frac{n}{n-1}|^k}…

Analysis of PDEs · Mathematics 2007-05-23 Yuxiang Li

The paper concerns a particular example of the Gibbs sampler and its mixing efficiency. Coordinates of a point are rerandomized in the unit square $[0,1]^2$ to approach a stationary distribution with density proportional to…

Probability · Mathematics 2018-10-09 Balázs Gerencsér

In this paper we show that a methodology based on a sampling with the Gaussian function of kind $h\,{e^{ - {{\left( {t/c} \right)}^2}}}/\left( {{c}\sqrt \pi } \right)$, where ${c}$ and $h$ are some constants, leads to the Fourier transform…

General Mathematics · Mathematics 2015-08-06 S. M. Abrarov , B. M. Quine

The {\em Total Influence} ({\em Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function \ifnum\plusminus=1 $f: \{\pm1\}^n…

Data Structures and Algorithms · Computer Science 2011-01-28 Dana Ron , Ronitt Rubinfeld , Muli Safra , Omri Weinstein

We derive a simple and precise approximation to probability density functions in sampling distributions based on the Fourier cosine series. After clarifying the required conditions, we illustrate the approximation on two examples: the…

Statistics Theory · Mathematics 2021-04-27 Shigekazu Nakagawa , Hiroki Hashiguchi , Yoko Ono

This work presents a novel matrix-based method for constructing an approximation Hessian using only function evaluations. The method requires less computational power than interpolation-based methods and is easy to implement in matrix-based…

Numerical Analysis · Mathematics 2023-04-07 W. Hare , G. Jarry-Bolduc , C. Planiden

Let g : $\Omega$ = [0, 1] d $\rightarrow$ R denote a Lipschitz function that can be evaluated at each point, but at the price of a heavy computational time. Let X stand for a random variable with values in $\Omega$ such that one is able to…

Probability · Mathematics 2021-07-29 Lucie Bernard , Albert Cohen , Arnaud Guyader , Florent Malrieu

We consider conditional tests for non-negative discrete exponential families. We develop two Markov Chain Monte Carlo (MCMC) algorithms which allow us to sample from the conditional space and to perform approximated tests. The first…

Computation · Statistics 2017-07-27 Roberto Fontana , Francesca Romana Crucinio

We study fast approximation of integrals with respect to stationary probability measures associated to iterated functions systems on the unit interval. We provide an algorithm for approximating the integrals under certain conditions on the…

Dynamical Systems · Mathematics 2019-07-11 Italo Cipriano , Natalia Jurga

We provide examples of multiplicative functions $f$ supported on the $k$-free integers such that at primes $f(p)=\pm 1$ and such that the partial sums of $f$ up to $x$ are $o(x^{1/k})$. Further, if we assume the Generalized Riemann…

Number Theory · Mathematics 2022-06-15 Marco Aymone , Caio Bueno , Kevin Medeiros

Let $f$ be a $C^{2+\epsilon}$ expanding map of the circle and $v$ be a $C^{1+\epsilon}$ real function of the circle. Consider the twisted cohomological equation $v(x) = \alpha (f(x)) - Df(x) \alpha (x)$ which has a unique bounded solution…

Dynamical Systems · Mathematics 2020-01-22 Amanda de Lima , Daniel Smania

There has been a great deal of recent interest in methods for performing lifted inference; however, most of this work assumes that the first-order model is given as input to the system. Here, we describe lifted inference algorithms that…

Artificial Intelligence · Computer Science 2012-05-14 Prithviraj Sen , Amol Deshpande , Lise Getoor

Define {\em the Liouville function for $A$}, a subset of the primes $P$, by $\lambda_{A}(n) =(-1)^{\Omega_A(n)}$ where $\Omega_A(n)$ is the number of prime factors of $n$ coming from $A$ counting multiplicity. For the traditional Liouville…

Number Theory · Mathematics 2008-09-11 Peter Borwein , Stephen K. K. Choi , Michael Coons

In this paper, we study the problem of multivariate $L_2$-approximation of functions belonging to a weighted Korobov space. We propose and analyze a median lattice-based algorithm, inspired by median integration rules, which have attracted…

Numerical Analysis · Mathematics 2025-11-04 Zexin Pan , Peter Kritzer , Takashi Goda

We show that alpha stable L\'evy motions can be simulated by any ergodic and aperiodic probability preserving transformation. Namely we show: - for $0<\alpha<1$ and every $\alpha$ stable L\'evy motion $\mathbb{W}$, there exists a function f…

Dynamical Systems · Mathematics 2023-09-13 Zemer Kosloff , Dalibor Volný

We consider random multiplicative functions taking the values $\pm 1$. Using Stein's method for normal approximation, we prove a central limit theorem for the sum of such multiplicative functions in appropriate short intervals.

Number Theory · Mathematics 2011-02-03 Sourav Chatterjee , Kannan Soundararajan

We study the recovery of multivariate functions from reproducing kernel Hilbert spaces in the uniform norm. Our main interest is to obtain preasymptotic estimates for the corresponding sampling numbers. We obtain results in terms of the…

Numerical Analysis · Mathematics 2024-10-29 Kateryna Pozharska , Tino Ullrich

For $\alpha>-1$, let $A^2_{\alpha}$ be the corresponding weighted Bergman space of the unit ball in $\mathbb{C}^n$. For a bounded measurable function $f$, let $T_f$ be the Toeplitz operator with symbol $f$ on $A^2_{\alpha}$. This paper…

Functional Analysis · Mathematics 2015-05-13 Trieu Le

We consider the problem of reconstructing an unknown function $u\in L^2(D,\mu)$ from its evaluations at given sampling points $x^1,\dots,x^m\in D$, where $D\subset \mathbb R^d$ is a general domain and $\mu$ a probability measure. The…

Numerical Analysis · Mathematics 2020-10-29 Albert Cohen , Matthieu Dolbeault

Let $f$ be a Rademacher random multiplicative function. Let $$M_f(u):=\sum_{n \leq u} f(n)$$ be the partial sum of $f$. Let $V_f(x)$ denote the number of sign changes of $M_f(u)$ up to $x$. We show that for any constant $c > 2$, $$V_f(x) =…

Number Theory · Mathematics 2023-11-29 Nick Geis , Ghaith Hiary