English
Related papers

Related papers: On Semimeasures Predicting Martin-Loef Random Sequ…

200 papers

By a Cantor-like measure we mean the unique self-similar probability measure $\mu $ satisfying $\mu =\sum_{i=0}^{m-1}p_{i}\mu \circ S_{i}^{-1}$ where $% S_{i}(x)=\frac{x}{d}+\frac{i}{d}\cdot \frac{d-1}{m-1}$ for integers $2\leq d<m\le 2d-1$…

Metric Geometry · Mathematics 2018-10-02 Kathryn E. Hare , Kevin G. Hare , Brian P. M. Morris , Wanchun Shen

The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncountably many) distributions are not, this imposes a strong…

Quantum Physics · Physics 2007-05-23 Juergen Schmidhuber

The free convolution is the binary operation on the set of probability measures on the real line which allows to deduce, from the individual spectral distributions, the spectral distribution of a sum of independent unitarily invariant…

Probability · Mathematics 2008-06-05 Serban Belinschi , Florent Benaych-Georges , Alice Guionnet

The wrapping transformation $W$ is a homomorphism from the semigroup of probability measures on the real line, with the convolution operation, to the semigroup of probability measures on the circle, with the multiplicative convolution…

Probability · Mathematics 2016-08-05 Michael Anshelevich , Octavio Arizmendi

This paper contributes to the study of the free additive convolution of probability measures. It shows that under some conditions, if measures $\mu_i$ and $\nu_i, i=1,2$, are close to each other in terms of the L\'{e}vy metric and if the…

Probability · Mathematics 2013-10-04 V. Kargin

Nies and Scholz introduced the notion of a state to describe an infinite sequence of qubits and defined quantum-Martin-Lof randomness for states, analogously to the well known concept of Martin-L\"of randomness for elements of Cantor space…

Information Theory · Computer Science 2020-05-04 Tejas Bhojraj

Sequential Monte Carlo Samplers are a class of stochastic algorithms for Monte Carlo integral estimation w.r.t. probability distributions, which combine elements of Markov chain Monte Carlo methods and importance sampling/resampling…

Probability · Mathematics 2007-05-23 Andreas Eberle , Carlo Marinelli

We consider ensembles of real symmetric band matrices with entries drawn from an infinite sequence of exchangeable random variables, as far as the symmetry of the matrices permits. In general the entries of the upper triangular parts of…

Probability · Mathematics 2020-01-22 Werner Kirsch , Thomas Kriecherbauer

We explore the asymptotic convergence and nonasymptotic maximal inequalities of supermartingales and backward submartingales in the space of positive semidefinite matrices. These are natural matrix analogs of scalar nonnegative…

Probability · Mathematics 2025-10-21 Hongjian Wang , Aaditya Ramdas

This work establishes computable bounds between f-divergences for probability measures within a generalized quasi-$\varepsilon_{(M,m)}$-neighborhood framework. We make the following key contributions. (1) a unified characterization of local…

Information Theory · Computer Science 2025-08-12 Xinchun Yu , Shuangqing Wei , Xiao-Ping Zhang

Suppose that we are given an infinite binary sequence which is random for a Bernoulli measure of parameter $p$. By the law of large numbers, the frequency of zeros in the sequence tends to~$p$, and thus we can get better and better…

Logic · Mathematics 2018-10-18 Laurent Bienvenu , Santiago Figueira , Benoit Monin , Alexander Shen

We define a Gaussian measure on the space $H^0_J(M, L^N)$ of almost holomorphic sections of powers of an ample line bundle $L$ over a symplectic manifold $(M, \omega)$, and calculate the joint probability densities of sections taking…

Symplectic Geometry · Mathematics 2007-05-23 B. Shiffman , S. Zelditch

Wasserman et al. (2020, PNAS, vol. 117, pp. 16880-16890) constructed estimator agnostic and finite-sample valid confidence sets and hypothesis tests, using split-data likelihood ratio-based statistics. We demonstrate that the same approach…

Statistics Theory · Mathematics 2020-09-24 Hien Duy Nguyen

Good robust estimators can be tuned to combine a high breakdown point and a specified asymptotic efficiency at a central model. This happens in regression with MM- and tau-estimators among others. However, the finite-sample efficiency of…

Statistics Theory · Mathematics 2013-11-21 Ricardo Maronna , Víctor Yohai

We prove the existence of codebooks for d-semifaithful lossy compression that are simultaneously universal with respect to both the class of finite-alphabet memoryless sources and the class of all bounded additive distortion measures. By…

Information Theory · Computer Science 2022-03-08 Neri Merhav

We introduce a randomized iterative fragmentation procedure for finite metric spaces, which is guaranteed to result in a polynomially large subset that is $D$-equivalent to an ultrametric, where $D\in (2,\infty)$ is a prescribed target…

Metric Geometry · Mathematics 2010-03-23 Assaf Naor , Terence Tao

By a classical result of Weyl, for any increasing sequence $(n_k)_{k \geq 1}$ of integers the sequence of fractional parts $(\{n_k x\})_{k \geq 1}$ is uniformly distributed modulo 1 for almost all $x \in [0,1]$. Except for a few special…

Number Theory · Mathematics 2013-07-26 Christoph Aistleitner

Inference in expressive probabilistic models is generally intractable, which makes them difficult to learn and limits their applicability. Sum-product networks are a class of deep models where, surprisingly, inference remains tractable even…

Machine Learning · Computer Science 2016-11-14 Abram L. Friesen , Pedro Domingos

We exhibit a one to one correspondence between some universal probabilistic properties of the ordering coordinate of one-dimensional Ising-like models and a class of continuous time random walks. This correspondence provides an new…

Statistical Mechanics · Physics 2007-05-23 Michel Droz , Max-Olivier Hongler

This paper proposes a new method for determining similarity and anomalies between time series, most practically effective in large collections of (likely related) time series, by measuring distances between structural breaks within such a…

Machine Learning · Computer Science 2020-12-01 Nick James , Max Menzies , Lamiae Azizi , Jennifer Chan