Related papers: A Matrix Bernstein Inequality for Strong Rayleigh …
A transfer matrix method is presented for solving the scattering problem for the quasi one-dimensional massless Dirac equation applied to graphene in the presence of an arbitrary inhomogeneous electric and perpendicular magnetic field. It…
We propose a multilevel Markov chain Monte Carlo (MCMC) method for the Bayesian inference of random field parameters in PDEs using high-resolution data. Compared to existing multilevel MCMC methods, we additionally consider level-dependent…
We present a new, very short proof of a conjecture by I. Ra\c{s}a, which is an inequality involving basic Bernstein polynomials and convex functions. It was affirmed positively very recently by J. Mrowiec, T. Rajba and S. W\k{a}sowicz…
The theory of matrix splitting is a useful tool for finding solution of rectangular linear system of equations, iteratively. The purpose of this paper is two-fold. Firstly, we revisit theory of weak regular splittings for rectangular…
We investigate an application of a mathematically robust minimization method -- the gradient method -- to the consistencization problem of a pairwise comparisons (PC) matrix. Our approach sheds new light on the notion of a priority vector…
Uniform sampling of binary matrix with fixed margins is an important and difficult problem in statistics, computer science, ecology and so on. The well-known swap algorithm would be inefficient when the size of the matrix becomes large or…
Beckner's inequality is a family of inequalities that interpolates the two fundamental functional inequalities, the logarithmic Sobolev and Poincar\'e's inequalities. It is parametrized by exponent $p\in (1,2]$ and it implies the…
We prove a martingale triangular array generalization of the Chow-Birnbaum-Marshall's inequality. The result is used to derive a strong law of large numbers for martingale triangular arrays whose rows are asymptotically stable in a certain…
Entropy estimation is a fundamental problem in information theory that has applications in various fields, including physics, biology, and computer science. Estimating the entropy of discrete sequences can be challenging due to limited data…
In this paper we introduce and study a weakened form of logarithmic Sobolev inequalities in connection with various others functional inequalities (weak Poincar\'{e} inequalities, general Beckner inequalities...). We also discuss the…
We obtain entropy formulas for SRB measures with finite entropy given by inducing schemes. In the first part of the work, we obtain Pesin entropy formula for the class of noninvertible systems whose SRB measures are given by Gibbs-Markov…
The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one…
Probabilistic model checking traditionally verifies properties on the expected value of a measure of interest. This restriction may fail to capture the quality of service of a significant proportion of a system's runs, especially when the…
This paper develops a methodology for robust Bayesian inference through the use of disparities. Metrics such as Hellinger distance and negative exponential disparity have a long history in robust estimation in frequentist inference. We…
The goal of this paper is to go further in the analysis of the behavior of the number of descents in a random permutation. Via two different approaches relying on a suitable martingale decomposition or on the Irwin-Hall distribution, we…
We explore alternative functional or transport-entropy formulations of the Blaschke-Santal{\'o} inequality and of its conjectured counterpart due to Mahler. In particular, we obtain new direct and reverse Blaschke-Santal{\'o} inequalities…
In this paper we propose a method for proving some exponential inequalities based on power series expansion and analysis of derivations of the corresponding functions. Our approach provides a simple proof and generates a new class of…
An infinite urn scheme is defined by a probability mass function $(p_j)_{j\geq1}$ over positive integers. A random allocation consists of a sample of $N$ independent drawings according to this probability distribution where $N$ may be…
We analyse diffusion dynamics on weakly-coupled networks (interconnected networks) by means of separation of time scales. Using an adiabatic approximation we reduced the system dynamics to a Markov chain with aggregated variables and…
Classically, the continuous-time Langevin diffusion converges exponentially fast to its stationary distribution $\pi$ under the sole assumption that $\pi$ satisfies a Poincar\'e inequality. Using this fact to provide guarantees for the…