English
Related papers

Related papers: Low for random reals and positive-measure dominati…

200 papers

A real \alpha is called recursively enumerable ("r.e." for short) if there exists a computable, increasing sequence of rationals which converges to \alpha. It is known that the randomness of an r.e. real \alpha can be characterized in…

Computational Complexity · Computer Science 2015-05-13 Kohtaro Tadaki

This paper describes the construction of a lower bound for the tails of general random variables, using solely knowledge of their moment generating function. The tilting procedure used allows for the construction of lower bounds that are…

Probability · Mathematics 2007-06-13 Ted Theodosopoulos

We consider a system of weak* closed sets of finite-dimensional distributions. We show that a corresponding system of random variables can be defined on a probability space with a probability measure determined up to some set of measures,…

Probability · Mathematics 2016-11-02 Victor Ivanenko , Illia Pasichnichenko

Topological measures and deficient topological measures are defined on open and closed subsets of a topological space, generalize regular Borel measures, and correspond to (non-linear in general) functionals that are linear on singly…

Probability · Mathematics 2020-05-25 Svetlana V. Butler

The aim of this paper is to establish a theory of random variables on domains. Domain theory is a fundamental component of theoretical computer science, providing mathematical models of computational processes. Random variables are the…

Logic in Computer Science · Computer Science 2016-08-30 Michael W. Mislove

We consider two general frameworks for multiple domination, which are called <r,s>-domination and parametric domination. They generalise and unify {k}-domination, k-domination, total k-domination and k-tuple domination. In this paper, known…

Combinatorics · Mathematics 2014-10-08 V. Zverovich

We consider the covering map $\pi:\mathbb{C}^n\to \mathbb{T}$ of a compact complex torus. Given an algebraic variety $X\subseteq \mathbb{C}^n$ we describe the topological closure of $\pi(X)$ in $\mathbb T$. We obtain a similar description…

Algebraic Geometry · Mathematics 2017-04-17 Ya'acov Peterzil , Sergei Starchenko

We investigate quantum tomography in scenarios where prior information restricts the state space to a smooth manifold of lower dimensionality. By considering stability we provide a general framework that relates the topology of the manifold…

Quantum Physics · Physics 2015-06-17 Michael Kech , Péter Vrana , Michael Wolf

In a general class of one dimensional random differential equation the convergence of the distribution function of the solution to stationary state distribution is studied. In particular it is proved the boundedness respectively the…

Probability · Mathematics 2010-07-07 Gyorgy Steinbrecher , Xavier Garbet , Boris Weyssow

Topological loss based on persistent homology has shown promise in various applications. A topological loss enforces the model to achieve certain desired topological property. Despite its empirical success, less is known about the…

Machine Learning · Computer Science 2022-06-14 Yikai Zhang , Jiachen Yao , Yusu Wang , Chao Chen

An important tool to quantify the likeness of two probability measures are f-divergences, which have seen widespread application in statistics and information theory. An example is the total variation, which plays an exceptional role among…

Probability · Mathematics 2009-03-11 Jochen Bröcker

In this work, we provide an analytical proof of the robustness of topological entanglement under a model of random local perturbations. We define a notion of average topological subsystem purity and show that, in the context of quantum…

Quantum Physics · Physics 2022-06-29 Salvatore F. E. Oliviero , Lorenzo Leone , You Zhou , Alioscia Hamma

A fruitful way of obtaining meaningful, possibly concrete, algorithmically random numbers is to consider a potential behaviour of a Turing machine and its probability with respect to a measure (or semi-measure) on the input space of binary…

Computational Complexity · Computer Science 2017-06-13 George Barmpalias , Douglas Cenzer , Christopher P. Porter

A question whether sufficiently regular manifold automorphisms may have wandering domains with controlled geometry is answered in the negative for quasiconformal or smooth homeomorphisms of $n$-tori, $n\ge2$, and hyperbolic surfaces.…

Dynamical Systems · Mathematics 2022-05-25 Sergei Merenkov

In characteristic zero, we construct relative principalization of ideals for logarithmically regular morphisms of logarithmic schemes, and use it to construct logarithmically regular desingularization of morphisms. These constructions are…

Algebraic Geometry · Mathematics 2020-09-01 Dan Abramovich , Michael Temkin , Jarosław Włodarczyk

We study the statistical properties of random numbers under the Martin-L\"of definition of randomness, proving that random numbers obey analogues of Strong Law of Large Numbers, the Law of the Iterated Logarithm, and that they are normal.…

Logic · Mathematics 2014-10-14 Matthew Pancia

We consider the problem of determining whether a monomial ideal is dominant. This property is critical for determining for which monomial ideals the Taylor resolution is minimal. We first analyze dominant ideals with a fixed least common…

This paper considers derivation of $f$-divergence inequalities via the approach of functional domination. Bounds on an $f$-divergence based on one or several other $f$-divergences are introduced, dealing with pairs of probability measures…

Information Theory · Computer Science 2016-10-31 Igal Sason , Sergio Verdú

Recent results concerning the relation of topology and low-lying fermion modes are summarized.

High Energy Physics - Lattice · Physics 2014-11-17 Robert G. Edwards

We discuss the birational geometry of singular surfaces in positive characteristic. More precisely, we establish the minimal model program and the abundance theorem for Q-factorial surfaces and for log canonical surfaces. Moreover, in the…

Algebraic Geometry · Mathematics 2015-03-17 Hiromu Tanaka