Related papers: On random quadratic forms: supports of potential l…
We consider 1-dimensional location estimation, where we estimate a parameter $\lambda$ from $n$ samples $\lambda + \eta_i$, with each $\eta_i$ drawn i.i.d. from a known distribution $f$. For fixed $f$ the maximum-likelihood estimate (MLE)…
Let $G$ be the interior domain of a piecewise analytic Jordan curve without cusps. Let $\{p_n\}_{n=0}^\infty$ be the sequence of polynomials that are orthonormal over $G$ with respect to the area measure, with each $p_n$ having leading…
This paper establishes the asymptotic independence between the quadratic form and maximum of a sequence of independent random variables. Based on this theoretical result, we find the asymptotic joint distribution for the quadratic form and…
This paper presents minimax rates for density estimation when the data dimension $d$ is allowed to grow with the number of observations $n$ rather than remaining fixed as in previous analyses. We prove a non-asymptotic lower bound which…
We study a non-relativistic charged particle on the Euclidean plane R^2 subject to a perpendicular constant magnetic field and an R^2-homogeneous random potential in the approximation that the corresponding random Landau Hamiltonian on the…
In finite mixtures of location-scale distributions, if there is no constraint on the parameters then the maximum likelihood estimate does not exist. But when the ratios of the scale parameters are restricted appropriately, the maximum…
We consider the model of directed polymers in a random environment introduced by Petermann : the random walk is $\mathbb{R}^d$-valued and has independent gaussian $N(0,I_d)$-increments, and the random media is a stationary centred Gaussian…
We develop a probabilistic approach to study the volumetric and geometric properties of unit balls $\mathbb B_{q,1}^n$ of finite-dimensional Lorentz sequences spaces $\ell_{q,1}^n$. More precisely, we show that the empirical distribution of…
\textit{Matching families} are one of the major ingredients in the construction of {\em locally decodable codes} (LDCs) and the best known constructions of LDCs with a constant number of queries are based on matching families. The…
We investigate the behavior of the nonparametric maximum likelihood estimator $\hat{f}_n$ for a decreasing density $f$ near the boundaries of the support of $f$. We establish the limiting distribution of $\hat{f}_n(n^{-\alpha})$, where we…
We investigate the probability that a random quadratic form in ${\mathbb{Z}}[x_1,...,x_n]$ has a totally isotropic subspace of a given dimension. We show that this global probability is a product of local probabilities. Our main result…
Let $\{X_{\mathbf{n}} : \mathbf{n}\in\mathbb{Z}^d\}$ be a weakly dependent stationary field with maxima $M_{A} := \sup\{X_{\mathbf{i}} : \mathbf{i}\in A\}$ for finite $A\subset\mathbb{Z}^d$ and $M_{\mathbf{n}} := \sup\{X_{\mathbf{i}} :…
We present lower estimates for the best constant appearing in the weak $(1,1)$ maximal inequality in the space $(\R^n,\|\cdot\|_{\iy})$. We show that this constant grows to infinity faster than $(\log n)^{1-o(1)}$ when $n$ tends to…
We analyze the $\ell_1$ and $\ell_\infty$ convergence rates of k nearest neighbor density estimation method. Our analysis includes two different cases depending on whether the support set is bounded or not. In the first case, the…
We study a specific convex maximization problem in n-dimensional space. The conjectured solution is proved to be a vertex of the polyhedral feasible region, but only a partial proof of local maximality is known. Integer sequences with…
We study the flexible piecewise exponential model in a high dimensional setting where the number of covariates $p$ grows proportionally to the number of observations $n$ and under the hypothesis of random uncorrelated Gaussian designs. We…
Let $P_N$ be a uniform random $N\times N$ permutation matrix and let $\chi_N(z)=\det(zI_N- P_N)$ denote its characteristic polynomial. We prove a law of large numbers for the maximum modulus of $\chi_N$ on the unit circle, specifically, \[…
A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…
Let $G_n$ be the partition graph whose vertices are the partitions of $n$, with adjacency given by elementary transfers of one cell between parts, followed by reordering. We study the support of a partition -- the set of distinct part sizes…
The Johnson-type upper bound on the maximum size of a code of length $n$, distance $d=2w-1$ and constant composition ${\overline{w}}$ is $\lfloor\dfrac{n}{w_1}\rfloor$, where $w$ is the total weight and $w_1$ is the largest component of…