Related papers: Higher order return times for $\phi$-mixing measur…
The paper concerns a particular example of the Gibbs sampler and its mixing efficiency. Coordinates of a point are rerandomized in the unit square $[0,1]^2$ to approach a stationary distribution with density proportional to…
Meshless methods approximate operators in a specific node as a weighted sum of values in its neighbours. Higher order approximations of derivatives provide more accurate solutions with better convergence characteristics, but they come at…
We consider a ranking problem where we have noisy observations from a matrix with isotonic columns whose rows have been permuted by some permutation $\pi$ *. This encompasses many models, including crowd-labeling and ranking in tournaments…
By exploiting the well-known observation that size-biasing or zero-biasing an infinitely divisible random variable may be achieved by adding an independent increment, combined with tools from Stein's method for compound Poisson and Gaussian…
We exploit a suitable moment-based characterization of the mixture of Poisson distribution for developing Bayesian inference for the unknown size of a finite population whose units are subject to multiple occurrences during an enumeration…
We introduce a non-parametric method to recover physical probability distributions of asset returns based on their European option prices and some other sparse parametric information. Thus the main problem is similar to the one considered…
This paper considers how to obtain MCMC quantitative convergence bounds which can be translated into tight complexity bounds in high-dimensional {settings}. We propose a modified drift-and-minorization approach, which establishes…
We demonstrate that the fraction of sales lost for the (r, q) system under consideration can be conveniently bounded in a manner suitable for quick, back-of-the-envelope estimates. We assume that customer demand arises from a Poisson…
Let $P$ be a bistochastic matrix of size $n$, and let $\Pi$ be a permutation matrix of size $n$. In this paper, we are interested in the mixing time of the Markov chain whose transition matrix is given by $Q=P\Pi$. In other words, the chain…
We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach its equilibrium distribution. One application…
We obtain quenched hitting distributions to be compound Poissonian for a certain class of random dynamical systems. The theory is general and designed to accommodate non-uniformly expanding behavior and targets that do not overlap much with…
In this paper, we present and analyse a class of "filtered" numerical schemes for second order Hamilton-Jacobi-Bellman equations. Our approach follows the ideas introduced in B.D. Froese and A.M. Oberman, Convergent filtered schemes for the…
We consider a linear Hamiltonian system consisting of a classical particle and a scalar field describing by the wave or Klein-Gordon equations with variable coefficients. The initial data of the system are supposed to be a random function…
We continue our study of exponential law for occurrences and returns of patterns in the context of Gibbsian random fields. For the low temperature plus phase of the Ising model, we prove exponential laws with error bounds for occurrence,…
While mixtures of Gaussian distributions have been studied for more than a century (Pearson, 1894), the construction of a reference Bayesian analysis of those models still remains unsolved, with a general prohibition of the usage of…
We analyze a new framework for expressing finite element methods on arbitrarily many intersecting meshes: multimesh finite element methods. The multimesh finite element method, first presented in [40], enables the use of separate meshes to…
We consider some nonuniformly hyperbolic invertible dynamical systems which are modeled by a Gibbs-Markov-Young tower. We assume a polynomial tail for the inducing time and a polynomial control of hyperbolicity, as introduced by Alves,…
We prove two lower bounds for the complexity of non-log-concave sampling within the framework of Balasubramanian et al. (2022), who introduced the use of Fisher information (FI) bounds as a notion of approximate first-order stationarity in…
In this article, the two filter formula is re-examined in the setting of partially observed Gauss--Markov models. It is traditionally formulated as a filter running backward in time, where the Gaussian density is parametrized in…
We propose an experimentally accessible scheme to determine lower bounds on the quantum Fisher information (QFI), which ascertains multipartite entanglement or usefulness for quantum metrology. The scheme is based on comparing the…