Related papers: Gap distribution of $\sqrt{n} \,\mathrm{mod}\, 1$ …

We study support recovery for a $k \times k$ principal submatrix with elevated mean $\lambda/N$, hidden in an $N\times N$ symmetric mean zero Gaussian matrix. Here $\lambda>0$ is a universal constant, and we assume $k = N \rho$ for some…

In this paper, we investigate the convergence performance of a cooperative diffusion Gauss-Newton (GN) method, which is widely used to solve the nonlinear least squares problems (NLLS) due to the low computation cost compared with Newton's…

We consider the Erdos-Renyi random graph G(n,p) inside the critical window, that is when p=1/n+ lambda*n^{-4/3}, for some fixed lambda in R. Then, as a metric space with the graph distance rescaled by n^{-1/3}, the sequence of connected…

The perturbation series for the renormalization group functions of the $O(N)-$symmetric $\phi^4$ field theory are divergent but asymptotic. They are usually followed by Resummation calculations to extract reliable results. Although the same…

We revisit the method of small subgraph conditioning, used to establish that random regular graphs are Hamiltonian a.a.s. We refine this method using new technical machinery for random $d$-regular graphs on $n$ vertices that hold not just…

Let $\nu\in M^1([0,\infty[)$ be a fixed probability measure. For each dimension $p\in \mathbb{N}$, let $(X_n^{p})_{n\geq1}$ be i.i.d. $\mathbb{R}^p$-valued random variables with radially symmetric distributions and radial distribution…

The classic lower bound of Kuhn, Moscibroda and Wattenhofer [JACM 2016] states that approximate maximum matching and approximate vertex cover (among other problems) in the LOCAL model require $\Omega(\min\{\sqrt{\frac{\log n}{\log\log n}},…

We consider the well-known method of least squares on an equidistant grid with $N+1$ nodes on the interval $[-1,1]$ with the goal to approximate a function $f\in\mathcal{C}\left[-1,1\right]$ by a polynomial of degree $n$. We investigate the…

We consider sparse inhomogeneous Erd\H{o}s-R\'enyi random graph ensembles where edges are connected independently with probability $p_{ij}$. We assume that $p_{ij}= \varepsilon_N f(w_i, w_j)$ where $(w_i)_{i\ge 1}$ is a sequence of…

We estimate linear functionals in the classical deconvolution problem by kernel estimators. We obtain a uniform central limit theorem with $\sqrt{n}$-rate on the assumption that the smoothness of the functionals is larger than the…

Uncertainty quantification requires efficient summarization of high- or even infinite-dimensional (i.e., non-parametric) distributions based on, e.g., suitable point estimates (modes) for posterior distributions arising from model-specific…

Renormalization Group flows relate the values of couplings at different scales. Here, we go beyond the Renormalization Group flow of individual trajectories and derive an evolution equation for a distribution on the space of couplings. This…

In this work, we mainly study the one-loop effective action for real scalar theories in non-homogeneous backgrounds in odd dimensions. It is shown that through the method studied in Ref. [1], it is possible to obtain a unified result for…

In this manuscript we introduce a generalisation of the log-Normal distribution that is inspired by a modification of the Kaypten multiplicative process using the $q$-product of Borges [Physica A \textbf{340}, 95 (2004)]. Depending on the…

Let $N(L)$ be the number of eigenvalues, in an interval of length $L$, of a matrix chosen at random from the Gaussian Orthogonal, Unitary or Symplectic ensembles of ${\cal N}$ by ${\cal N}$ matrices, in the limit ${\cal…

The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to decide whether the Hamming distance between their $n$-bit…

In this paper, we consider the symmetric KL-divergence between the sum of independent variables and a Gaussian distribution, and obtain a convergence rates of order $O\left( \frac{\ln n}{\sqrt{n}}\right)$. The proof is based on Stein's…

We use computational experiments to find the rectangles of minimum perimeter into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. In many of the packings…

Given a Coxeter system of large type we prove a non--commutative central limit theorem: After normalisation with the square root of n the characteristic function of the set of the first n generators tends in distribution to Wigners…

We develop a systematic perturbative expansion and compute the one-loop two-points, three-points and four-points correlation functions in a non-commutative version of the U(N) Wess-Zumino-Witten model in different regimes of the…