Related papers: Density functions for QuickQuant and QuickVal
We study sampling from a target distribution ${\nu_* = e^{-f}}$ using the unadjusted Langevin Monte Carlo (LMC) algorithm. For any potential function $f$ whose tails behave like ${\|x\|^\alpha}$ for ${\alpha \in [1,2]}$, and has…
We study the distribution of dynamical quantities in various one-dimensional, disordered models the critical behavior of which is described by an infinite randomness fixed point. In the {\it disordered contact process}, the quenched…
Finite temperature density functional theory requires representations for the internal energy, entropy, and free energy as functionals of the local density field. A central formal difficulty for an orbital-free representation is…
It is argued that there is a need for fat-tailed distributions that become thin in the extreme tail. A 3-parameter distribution is introduced that visually resembles the t-distribution and interpolates between the normal distribution and…
We study random integer-valued Lipschitz functions on regular trees. It was shown by Peled, Samotij and Yehudayoff that such functions are localized, however, finer questions about the structure of Gibbs measures remain unanswered. Our main…
Let X_1 ,..., X_n be a collection of binary valued random variables and let f : {0,1}^n -> R be a Lipschitz function. Under a negative dependence hypothesis known as the {\em strong Rayleigh} condition, we show that f - E f satisfies a…
We describe algorithms for finding the regression of t, a sequence of values, to the closest sequence s by mean squared error, so that s is always increasing (isotonicity) and so the values of two consecutive points do not increase by too…
In studies involving lifetimes, observed survival times are frequently censored and possibly subject to biased sampling. In this paper, we model survival times under biased sampling (a.k.a., biased survival data) by a semi-parametric model,…
We propose a method to remedy finite sample coverage problems and improve upon the efficiency of commonly employed procedures for the construction of nonparametric confidence intervals in regression kink designs. The proposed interval is…
We establish general limits on how precise a parameter, e.g. frequency or the strength of a magnetic field, can be estimated with the aid of full and fast quantum control. We consider uncorrelated noisy evolutions of N qubits and show that…
We initiate a program of average smoothness analysis for efficiently learning real-valued functions on metric spaces. Rather than using the Lipschitz constant as the regularizer, we define a local slope at each point and gauge the function…
Suppose that $(Z_n)_{n\geq0}$ is a supercritical branching process in independent and identically distributed random environment. The right tail function of the scaled growth rate for $(Z_n)_{n\geq0}$ is studied. The upper bounds for…
We have analysed the optical luminosity-redshift distribution properties of bright QSOs, using a new large sample from the Hamburg/ESO survey. The sample provides insight into the hitherto poorly sampled bright tail of the luminosity…
We study a new estimator for the tail index of a distribution in the Frechet domain of attraction that arises naturally by computing subsample maxima. This estimator is equivalent to taking a U-statistic over a Hill estimator with two order…
The construction by Du et al. (2019) implies that even if a learner is given linear features in $\mathbb R^d$ that approximate the rewards in a bandit with a uniform error of $\epsilon$, then searching for an action that is optimal up to…
We give some natural sufficient conditions for balls in a metric space to have small intersection. Roughly speaking, this happens when the metric space is (i) expanding and (ii) well-spread, and (iii) a certain random variable on the…
In this paper we apply the $L$-function Ratios Conjecture to compute the one-level density for a symplectic family of $L$-functions attached to Hecke characters of infinite order. When the support of the Fourier transform of the…
We consider solutions to so-called stochastic fixed point equation $R \stackrel{d}{=} \Psi(R)$, where $\Psi $ is a random Lipschitz function and $R$ is a random variable independent of $\Psi$. Under the assumption that $\Psi$ can be…
Concentration inequalities are fundamental tools in probabilistic combinatorics and theoretical computer science for proving that random functions are near their means. Of particular importance is the case where f(X) is a function of…
The happy function $H: \mathbb{N} \rightarrow \mathbb{N}$ sends a positive integer to the sum of the squares of its digits. A number $x$ is said to be happy if the sequence $\{H^n(x)\}^\infty_{n=1}$ eventually reaches one. A basic open…