Related papers: The expected Euler characteristic approximation to…
In this paper we construct uniformly expanding random walks on smooth manifolds. In higher dimensions, our definition of uniform expansion measures the growth of subspaces rather than single vectors. Potrie showed that given any open set…
The excursion set theory, where density perturbations evolve stochastically with the smoothing scale, provides a method for computing the dark matter halo mass function. The computation of the mass function is mapped into the so-called…
Bayesian inference is a popular method to build learning algorithms but it is hampered by the fact that its key object, the posterior probability distribution, is often uncomputable. Expectation Propagation (EP) (Minka (2001)) is a popular…
We show that the maximum likelihood degree of a smooth very affine variety is equal to the signed topological Euler characteristic. This generalizes Orlik and Terao's solution to Varchenko's conjecture on complements of hyperplane…
We investigate Lipschitz-Killing curvatures for excursion sets of random fields on $\mathbb R^2$ under small spatial-invariant random perturbations. An expansion formula for mean curvatures is derived when the magnitude of the perturbation…
A new class of explicit Euler schemes, which approximate stochastic differential equations (SDEs) with superlinearly growing drift and diffusion coefficients, is proposed in this article. It is shown, under very mild conditions, that these…
Improving and optimizing oceanographic sampling is a crucial task for marine science and maritime resource management. Faced with limited resources in understanding processes in the water-column, the combination of statistics and autonomous…
We consider a d-dimensional random walk in random scenery X(n), where the scenery consists of i.i.d. with exponential moments but a tail decay of the form exp(-c t^a) with a<d/2. We study the probability, when averaged over both randomness,…
We establish here a Quantitative Central Limit Theorem (in Wasserstein distance) for the Euler-Poincar\'{e} Characteristic of excursion sets of random spherical eigenfunctions in dimension 2. Our proof is based upon a decomposition of the…
We analyze a tour-uncrossing heuristic for the Travelling Salesperson Problem, showing that its worst-case approximation ratio is $\Omega(n)$ and its average-case approximation ratio is $\Omega(\sqrt{n})$ in expectation. We furthermore…
In this paper, we give a very accurate description of the way the simple exclusion process relaxes to equilibrium. Let $P_t$ denote the semi-group associated the exclusion on the circle with $2N$ sites and $N$ particles. For any initial…
This paper presents likelihood-based inference methods for the family of univariate gamma-normal distributions GN({\alpha}, r, {\mu}, {\sigma}^2 ) that result from summing independent gamma({\alpha}, r) and N({\mu}, {\sigma}^2 ) random…
We derive exact tail asymptotics of sojourn time above the level $u\geq 0$ $$ \mathbb{P}\left(v(u)\int_0^T \mathbb{I}(X(t)-ct>u)d t>x\right), \quad x\geq 0 $$ as $u\to\infty$, where $X$ is a Gaussian process with continuous sample paths,…
We present an approximated maximum likelihood method for the multifractal random walk processes of [E. Bacry et al., Phys. Rev. E 64, 026103 (2001)]. The likelihood is computed using a Laplace approximation and a truncation in the…
A method is introduced for approximate marginal likelihood inference via adaptive Gaussian quadrature in mixed models with a single grouping factor. The core technical contribution is an algorithm for computing the exact gradient of the…
This paper aims to derive accurate asymptotic estimates for the exit time probabilities of scalar Ornstein-Uhlenbeck (OU) bridges. The exit time probabilities are expressed as an asymptotic series in powers of a small parameter that…
In this paper we provide explicit upper bounds on some distances between the (law of the) output of a random Gaussian NN and (the law of) a random Gaussian vector. Our results concern both shallow random Gaussian neural networks with…
Rue and Held (2005) proposed a method for efficiently computing the Gaussian likelihood for stationary Markov random field models, when the data locations fall on a complete regular grid, and the model has no additive error term. The…
We establish an expression of the \EC~of a $r$-regular planar set in function of some variographic quantities. The usual $\mathcal{C} ^{2}$ framework is relaxed to a $\mathcal{C} ^{1,1}$ regularity assumption, generalising existing local…
Consider a branching random walk $(G_u)_{u\in \mathbb T}$ on the general linear group $\textrm{GL}(V)$ of a finite dimensional space $V$, where $\mathbb T$ is the associated genealogical tree with nodes $u$. For any starting point $v \in V…