Related papers: Asymptotic analysis of average case approximation …
The classical heuristic complexity of the Number Field Sieve (NFS) is the solution of an optimization problem that involves an unknown function, usually noted $o(1)$ and called $\xi(N)$ throughout this paper, which tends to zero as the…
This work provides new results for the analysis of random sequences in terms of $\ell_p$-compressibility. The results characterize the degree in which a random sequence can be approximated by its best $k$-sparse version under different…
In this note, we present an abstract approach to study asymptotic orders for adaptive approximations with respect to a monotone set function $\mathfrak{J}$ defined on dyadic cubes. We determine the exact upper order in terms of the critical…
We develop an advanced mean field method for approximating averages in probabilistic data models that is based on the TAP approach of disorder physics. In contrast to conventional TAP, where the knowledge of the distribution of couplings…
We study random skew 3D partitions weighted by $q^{\textup{vol}}$ and, specifically, the $q\to 1$ asymptotics of local correlations near various points of the limit shape. We obtain sine-kernel asymptotics for correlations in the bulk of…
A nonuniform Neumann boundary-value problem is considered for the Poisson equation in a thin $3D$ aneurysm-type domain that consists of thin curvilinear cylinders that are joined through an aneurysm of diameter $\mathcal{O}(\varepsilon).$ A…
In this paper, we define a class of additive random growth models whose growth is at least and at most linear and prove an asymptotic shape theorem for these models. This proof generalizes already known proofs for the classical contact…
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact representation, inference in such models is intractable even…
Continuous determinantal point processes (DPPs) are a class of repulsive point processes on $\mathbb{R}^d$ with many statistical applications. Although an explicit expression of their density is known, it is too complicated to be used…
We study the $d$-dimensional Vector Bin Packing ($d$VBP) problem, a generalization of Bin Packing with central applications in resource allocation and scheduling. In $d$VBP, we are given a set of items, each of which is characterized by a…
We established and estimate the full asymptotic expansion in integer powers of 1 N of the [ $\sqrt$ N ] first marginals of N-body evolutions lying in a general paradigm containing Kac models and non-relativistic quantum evolution. We prove…
Nested sampling is a simulation method for approximating marginal likelihoods proposed by Skilling (2006). We establish that nested sampling has an approximation error that vanishes at the standard Monte Carlo rate and that this error is…
We study the asymptotic behaviour of Markov processes on large weighted Erdos-Renyi graphs where the transition rates of the vertices are only influenced by the state of their neighbours and the corresponding weight on the edges. We find…
We consider the Helmholtz equation in an angular sector partially covered by a homogeneous layer of small thickness, denoted $\varepsilon$. We propose in this work an asymptotic expansion of the solution with respect to $\varepsilon$ at any…
We establish the asymptotic normality of the regression estimator in a fixed-design setting when the errors are given by a field of dependent random variables. The result applies to martingale-difference or strongly mixing random fields. On…
Consider a uniformly sampled random $d$-regular graph on $n$ vertices. If $d$ is fixed and $n$ goes to $\infty$ then we can relate typical (large probability) properties of such random graph to a family of invariant random processes (called…
This paper concerns the asymptotic behavior of a random variable $W_\lambda$ resulting from the summation of the functionals of a Gibbsian spatial point process over windows $Q_\lambda \uparrow R^d$. We establish conditions ensuring that…
Near-Gaussian probability densities are common in many important physical applications. Here we develop an asymptotic expansion methodology for computing entropic functionals for such densities. The expansion proposed is a close relative of…
It is well known that any pair of random variables $(X,Y)$ with values in Polish spaces, provided that $Y$ is nonatomic, can be approximated in joint law by random variables of the form $(X',Y)$ where $X'$ is $Y$-measurable and $X'…
The parametric complexity is the key quantity in the minimum description length (MDL) approach to statistical model selection. Rissanen and others have shown that the parametric complexity of a statistical model approaches a simple function…