scholarly journals Large Deviations for Zeros of Random Polynomials with i.i.d. Exponential Coefficients

2015 ◽  
Vol 2016 (5) ◽  
pp. 1308-1347 ◽  
Author(s):  
Subhroshekhar Ghosh ◽  
Ofer Zeitouni
Keyword(s):  
Large Deviations ◽  
Random Polynomials

scholarly journals Large Deviations for Zeros of P(ϕ)2 Random Polynomials

2011 ◽  
Vol 143 (4) ◽  
pp. 619-635 ◽  
Author(s):  
Renjie Feng ◽  
Steve Zelditch
Keyword(s):  
Large Deviations ◽  
Random Polynomials

scholarly journals Run-and-Tumble Motion: The Role of Reversibility

2021 ◽  
Vol 183 (3) ◽  
Author(s):  
Bart van Ginkel ◽  
Bart van Gisbergen ◽  
Frank Redig
Keyword(s):  
Free Energy ◽  
Diffusion Coefficient ◽  
Large Deviations ◽  
Energy Function ◽  
Internal State ◽  
Rate Function ◽  
Free Energy Function ◽  
Large Deviations Principle ◽  
Preferred Direction ◽  
State Process

AbstractWe study a model of active particles that perform a simple random walk and on top of that have a preferred direction determined by an internal state which is modelled by a stationary Markov process. First we calculate the limiting diffusion coefficient. Then we show that the ‘active part’ of the diffusion coefficient is in some sense maximal for reversible state processes. Further, we obtain a large deviations principle for the active particle in terms of the large deviations rate function of the empirical process corresponding to the state process. Again we show that the rate function and free energy function are (pointwise) optimal for reversible state processes. Finally, we show that in the case with two states, the Fourier–Laplace transform of the distribution, the moment generating function and the free energy function can be computed explicitly. Along the way we provide several examples.

scholarly journals Weighted approximate Bayesian computation via Sanov’s theorem

2021 ◽  
Author(s):  
Cecilia Viscardi ◽  
Michele Boreale ◽  
Fabio Corradi
Keyword(s):  
Large Deviations ◽  
Posterior Distribution ◽  
Approximate Bayesian Computation ◽  
Bayesian Computation ◽  
Information Theoretic ◽  
Discrete Random Variables ◽  
Positive Weights ◽  
Approximate Bayesian ◽  
Information Theoretic Method ◽  
Computational Resources

AbstractWe consider the problem of sample degeneracy in Approximate Bayesian Computation. It arises when proposed values of the parameters, once given as input to the generative model, rarely lead to simulations resembling the observed data and are hence discarded. Such “poor” parameter proposals do not contribute at all to the representation of the parameter’s posterior distribution. This leads to a very large number of required simulations and/or a waste of computational resources, as well as to distortions in the computed posterior distribution. To mitigate this problem, we propose an algorithm, referred to as the Large Deviations Weighted Approximate Bayesian Computation algorithm, where, via Sanov’s Theorem, strictly positive weights are computed for all proposed parameters, thus avoiding the rejection step altogether. In order to derive a computable asymptotic approximation from Sanov’s result, we adopt the information theoretic “method of types” formulation of the method of Large Deviations, thus restricting our attention to models for i.i.d. discrete random variables. Finally, we experimentally evaluate our method through a proof-of-concept implementation.

scholarly journals Optimal sampling of dynamical large deviations via matrix product states

2021 ◽  
Vol 103 (6) ◽  
Author(s):  
Luke Causer ◽  
Mari Carmen Bañuls ◽  
Juan P. Garrahan
Keyword(s):  
Large Deviations ◽  
Matrix Product ◽  
Optimal Sampling ◽  
Matrix Product States
Sign in / Sign up

Export Citation Format

Share Document