Related papers: Maximal Inequalities for Empirical Processes under…
We consider the averaging principle for deterministic or stochastic systems with a fast stochastic component (family of continuous-time Markov chains depending on the state of the system as a parameter). We show that, due to bifurcations in…
This paper presents some new results on the conditional joint probability distributions of phase-type under the mixture of right-continuous Markov jump processes with absorption on the same finite state space $\mathbb{S}$ moving at…
We consider the problem of reconstructing a wide sense stationary band-limited process from its local averages taken either at the Nyquist rate or above. As a result, we obtain a sufficient condition under which average sampling expansions…
All the available results on the approximation of the k-spacings process to Gaussian processes have only used one approach, that is the Shorack and Pyke's one. Here, it is shown that this approach cannot yield a rate better than $% \left(…
The phenomenon of entropy concentration provides strong support for the maximum entropy method, MaxEnt, for inferring a probability vector from information in the form of constraints. Here we extend this phenomenon, in a discrete setting,…
We develop a framework for the average-case analysis of random quadratic problems and derive algorithms that are optimal under this analysis. This yields a new class of methods that achieve acceleration given a model of the Hessian's…
This note is concerned with concentration inequalities for extrema of stationary Gaussian processes. It provides non-asymptotic tail inequalities which fully reflect the fluctuation rate, and as such improve upon standard Gaussian…
We consider a generalized one-dimensional chain in a periodic potential (the Frenkel-Kontorova model), with dissipative, pulsating (or ratchet) dynamics as a model of transport when the average force on the system is zero. We find lower…
We study mixing times of the symmetric and asymmetric simple exclusion process on the segment where particles are allowed to enter and exit at the endpoints. We consider different regimes depending on the entering and exiting rates as well…
We prove an upper bound on the total variation mixing time of a finite Markov chain in terms of the absolute spectral gap and the number of elements in the state space. Unlike results requiring reversibility or irreducibility, this bound is…
Mixture models, such as Gaussian mixture models, are widely used in machine learning to represent complex data distributions. A key challenge, especially in high-dimensional settings, is to determine the mixture order and estimate the…
Effects of the averaging over disorder realizations (samples) on the phase behavior are analyzed in terms of the mean field approximation for the random field Ising model with infinite range interactions. It is found that the averaging is…
This paper considers the problem of sequential empirical coordination, where the objective is to achieve a given value of the expected uniform deviation between state-action empirical averages and statistical expectations under a given…
Experimental comparisons of performance represent an important aspect of research on optimization algorithms. In this work we present a methodology for defining the required sample sizes for designing experiments with desired statistical…
In Markov Chain Monte Carlo (MCMC) simulations, the thermal equilibria quantities are estimated by ensemble average over a sample set containing a large number of correlated samples. These samples are selected in accordance with the…
Importance sampling is a widely used technique to reduce the variance of a Monte Carlo estimator by an appropriate change of measure. In this work, we study importance sam- pling in the framework of diffusion process and consider the change…
We derive universal thermodynamic inequalities that bound from below the moments of first-passage times of stochastic currents in nonequilibrium stationary states of Markov jump processes in the limit where the thresholds that define the…
Entropy rate of sequential data-streams naturally quantifies the complexity of the generative process. Thus entropy rate fluctuations could be used as a tool to recognize dynamical perturbations in signal sources, and could potentially be…
Adaptive Markov chains are an important class of Monte Carlo methods for sampling from probability distributions. The time evolution of adaptive algorithms depends on past samples, and thus these algorithms are non-Markovian. Although there…
We show how to use the Malliavin calculus to obtain density estimates of the law of general centered random variables. In particular, under a non-degeneracy condition, we prove and use a new formula for the density of a random variable…