相关论文: Gain coefficients for scrambled Halton points

Let $\alpha(\mathbb{F}_q^d,p)$ denote the maximum size of a general position set in a $p$-random subset of $\mathbb{F}_q^d$. We determine the order of magnitude of $\alpha(\mathbb{F}_q^2,p)$ up to polylogarithmic factors for all possible…

Markov chain Monte Carlo (MCMC) methods generate samples that are asymptotically distributed from a target distribution of interest as the number of iterations goes to infinity. Various theoretical results provide upper bounds on the…

The Cram\'er-Granville conjecture is an upper bound on prime gaps, $g_n = p_{n+1} - p_n < \cCramer \, \log^2 p_n$ for some constant $\cCramer \geq 1$. Using a formula of Selberg, we first prove the weaker summed version: $\sum_{n=1}^N g_n <…

Recently, Ma, Shen and Xie broke the Erd\H{o}s barrier for off-diagonal Ramsey numbers $R(\ell,C\ell)$, achieving the first exponential improvement over the classical lower bound for every $C>1$ and sufficiently large $\ell$. Hunter,…

We consider the problem of performing linear regression over a stream of $d$-dimensional examples, and show that any algorithm that uses a subquadratic amount of memory exhibits a slower rate of convergence than can be achieved without…

If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…

Three possibilities to speed up the Hybrid Monte Carlo algorithm are investigated. Changing the step-size adaptively brings no practical gain. On the other hand, substantial improvements result from using an approximate Hamiltonian or a…

Monte Carlo data simulating phase transitions in Ising strips $D\times L,$ ($D\llL) $ with periodic boundary conditions show that $T_{c}(D)=0$ for $D\leq D^{\ast}\simeq 6$ and $0<T_{c}(D)<T_{c}(d=2)$ for $D>D^{\ast}.$ Regular scaling of…

Let $M_n$ be the maximum of $n$ zero-mean gaussian variables $X_1,..,X_n$ with covariance matrix of minimum eigenvalue $\lambda$ and maximum eigenvalue $\Lambda$. Then, for $n \ge 70$, $$\Pr\{M_n \ge \lambda \left (2 \log n - 2.5 - \log(2…

We study the sample median of independently generated quasi-Monte Carlo estimators based on randomized digital nets and prove it approximates the target integral value at almost the optimal convergence rate for various function spaces. In…

This paper studies the rate of convergence for conditional quasi-Monte Carlo (QMC), which is a counterpart of conditional Monte Carlo. We focus on discontinuous integrands defined on the whole of $R^d$, which can be unbounded. Under…

We provide lower bounds on the gonality of a graph in terms of its spectral and edge expansion. As a consequence, we see that the gonality of a random 3-regular graph is asymptotically almost surely greater than one seventh its genus.

We study the approximation of expectations $\E(f(X))$ for Gaussian random elements $X$ with values in a separable Hilbert space $H$ and Lipschitz continuous functionals $f \colon H \to \R$. We consider restricted Monte Carlo algorithms,…

We consider the problem $(\mathrm{P})$ of fitting $n$ standard Gaussian random vectors in $\mathbb{R}^d$ to the boundary of a centered ellipsoid, as $n, d \to \infty$. This problem is conjectured to have a sharp feasibility transition: for…

We give a simple proof of a well-known theorem of G\'al and of the recent related results of Aistleitner, Berkes and Seip [1] regarding the size of GCD sums. In fact, our method obtains the asymptotically sharp constant in G\'al's theorem,…

We have studied the conformational properties of a flexible end-grafted chain (length $N$) with a rigid side chain (length $S$) by means of Monte Carlo simulations. Depending on the lengths $N$ and $S$ and the branching site, $b$, we…

We study entanglement growth in a harmonic oscillator chain subjected to the weak measurement of observables which have been smeared-out over a length scale $R$. We find that entanglement grows diffusively ($S \sim t^{1/2}$) for a large…

Monte Carlo algorithms are barely considered in spin foam quantum gravity. Due to the quantum nature of spin foam amplitudes one cannot readily apply them, and the present sign problem is a threat to convergence and thus efficiency. Yet,…

We develop a first-principle approach to compute the counting statistics in the ground-state of $N$ noninteracting spinless fermions in a general potential in arbitrary dimensions $d$ (central for $d>1$). In a confining potential, the Fermi…

Designing distributed and scalable algorithms to improve network connectivity is a central topic in peer-to-peer networks. In this paper we focus on the following well-known problem: given an $n$-node $d$-regular network for $d=\Omega(\log…