相关论文: Virial Expansion Bounds

The problem of analyzing the number of number field extensions $L/K$ with bounded (relative) discriminant has been the subject of renewed interest in recent years, with significant advances made by Schmidt, Ellenberg-Venkatesh, Bhargava,…

In this paper, we establish the first large deviation bounds for the Airy point process. The proof is based on a novel approach which relies upon the approximation of the Airy point process using the Gaussian unitary ensemble (GUE) up to an…

The Bochner-Riesz multipliers $ B_{\delta }$ on $ \mathbb R ^{n}$ are shown to satisfy a range of sparse bounds, for all $0< \delta < \frac {n-1}2 $. The range of sparse bounds increases to the optimal range, as $ \delta $ increases to the…

Let $(M, g)$ be a closed Riemannian manifold, where g is $C^1$-smooth metric. Consider the sequence of eigenfunctions $u_k$ of the Laplace operator on M. Let $B$ be a ball on $M$. We prove a sharp estimate of the number of nodal domains of…

This article is inspired from the work of M Krithika and P Vanchinathan on Cluster Magnification and the work of Alexander Perlis on Cluster Size. We establish the existence of polynomials for given degree and cluster size over number…

We investigate the differential calculus defined by Ashtekar and Lewandowski on projective limits of manifolds by means of cylindrical smooth functions and compare it with the C^infty calculus proposed by Froehlicher and Kriegl in more…

We prove that any weakly differentiable function with square integrable gradient can be extended to a capacitary boundary of any simply connected plane domain $\Omega\ne\mathbb R^2$ except a set of a conformal capacity zero. For locally…

We show the validity of the cluster expansion in the canonical ensemble for the Ising model. We compare the lower bound of its radius of convergence with the one computed by the virial expansion working in the grand-canonical ensemble.…

We augment the method of Wooley (2015) by some new ideas and in a series of results, improve his metric bounds on the Weyl sums and the discrepancy of fractional parts of real polynomials with partially prescribed coefficients. We also…

In 1985, Boshernitzan showed that a minimal (sub)shift satisfying a linear block growth condition must have a bounded number of ergodic probability measures. Recently, this bound was shown to be sharp through examples constructed by Cyr and…

It is proposed to revisit the inverse problem associated with Smoluchowski's coagulation equation. The objective is to reconstruct the functional form of the collision kernel from observations of the time evolution of the cluster size…

The seminal result of Johnson and Lindenstrauss on random embeddings has been intensively studied in applied and theoretical computer science. Despite that vast body of literature, we still lack of complete understanding of statistical…

It is common practice in empirical work to employ cluster-robust standard errors when using the linear regression model to estimate some structural/causal effect of interest. Researchers also often include a large set of regressors in their…

We consider a multivariate distributional recursion of sum-type as arising in the probabilistic analysis of algorithms and random trees. We prove an upper tail bound for the solution using Chernoff's bounding technique by estimating the…

This paper presents an improved exponential tail bound for Beta distributions, refining a result in [15]. This improvement is achieved by interpreting their bound as a regular Kullback-Leibler (KL) divergence one, while introducing a…

We study generalisations of a simple, combinatorial proof of a Chernoff bound similar to the one by Impagliazzo and Kabanets (RANDOM, 2010). In particular, we prove a randomized version of the hitting property of expander random walks and…

We show sharp bounds for probabilities of large deviations for sums of independent random variables satisfying Bernstein's condition. One such bound is very close to the tail of the standard Gaussian law in certain case; other bounds…

We first consider the growth of trees by probabilistic attachment of new vertices to leaves. This leads to a growth model based on vertex clusters and probabilities assigned to clusters. This model turns out to be readily applicable to…

We present a general method for obtaining strong bounds for discrete optimization problems that is based on a concept of branching duality. It can be applied when no useful integer programming model is available, and we illustrate this with…

We give a solution to the Poincar\'e Problem, in the formulation of Cerveau and Lins Neto. We obtain a bound on the degree of general leaves of foliations of general type, which is linear in $g$. To achieve this we study the birational…