English
Related papers

Related papers: Weak randomness and Kamae's theorem on normal numb…

200 papers

In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (rho-) names of x. A real number x is computable if it has a computable name, and a real function f is computable if there…

Computational Complexity · Computer Science 2010-06-03 Matthew S. Bauer , Xizhong Zheng

In this paper, weakly homogeneous generalized functions in the special Colombeau algebras are determined up to equality in the sense of generalized distributions. This yields characterizations that are formally similar to distribution…

Functional Analysis · Mathematics 2014-04-01 Hans Vernaeve

Weak superimposed codes are combinatorial structures related closely to generalized cover-free families, superimposed codes, and disjunct matrices in that they are only required to satisfy similar but less stringent conditions. This class…

Information Theory · Computer Science 2024-09-17 Yu Tsunoda , Yuichiro Fujiwara

Though the ability of human beings to deal with probabilities has been put into question, the assessment of rarity is a crucial competence underlying much of human decision-making and is pervasive in spontaneous narrative behaviour. This…

Other Computer Science · Computer Science 2011-08-25 Jean-Louis Dessalles

In quantum theory, a weak value is a complex number with a somewhat technical definition: it is a ratio whose numerator is the matrix element of a self-adjoint operator and whose denominator is the inner product of a corresponding pair of…

Quantum Physics · Physics 2026-02-11 Jacob A. Barandes

We provide general formulation of weak identification in semiparametric models and an efficiency concept. Weak identification occurs when a parameter is weakly regular, i.e., when it is locally homogeneous of degree zero. When this happens,…

Econometrics · Economics 2022-01-24 Tetsuya Kaji

In assignment problems, the rank distribution of assigned objects is often used to evaluate match quality. Rank-minimizing (RM) mechanisms directly optimize for average rank. While appealing, a drawback is RM mechanisms are not…

Theoretical Economics · Economics 2024-06-19 Peter Troyan

In this paper, we establish the theory of weak convergence (toward a normal distribution) for both single-chain and population stochastic approximation MCMC algorithms. Based on the theory, we give an explicit ratio of convergence rates for…

Statistics Theory · Mathematics 2013-10-29 Qifan Song , Mingqi Wu , Faming Liang

The univariate extreme value theory deals with the convergence in type of powers of elements of sequences of cumulative distribution functions on the real line when the power index gets infinite. In terms of convergence of random variables,…

Probability · Mathematics 2018-10-04 Gane Samb Lo , Modou Ngom , Tchilabola Abozou Kpanzou , Mouminou Diallo

For a branching process in random environment it is assumed that the offspring distribution of the individuals varies in a random fashion, independently from one generation to the other. Interestingly there is the possibility that the…

Probability · Mathematics 2012-09-07 V. I. Afanasyev , C. Boeinghoff , G. Kersting , V. A. Vatutin

In the past decades, weak convergence theory for stochastic processes has become a standard tool for analyzing the asymptotic properties of various statistics. Routinely, weak convergence is considered in the space of bounded functions…

Statistics Theory · Mathematics 2014-08-15 Axel Bücher , Johan Segers , Stanislav Volgushev

A simple formula to read out the weak value from the wave function of the measuring device after the postselection with the initial Gaussian profile is proposed. We apply this formula for the weak value to the classical experiment of the…

Quantum Physics · Physics 2016-11-25 Kouji Nakamura

Weak-type quasi-norms are defined using the mean oscillation or the mean of a function on dyadic cubes, providing discrete analogues and variants of the corresponding quasi-norms on the upper half-space previously considered in the…

Functional Analysis · Mathematics 2025-06-27 Galia Dafni , Shahaboddin Shaabani

The average result of a weak measurement of some observable $A$ can, under post-selection of the measured quantum system, exceed the largest eigenvalue of $A$. The nature of weak measurements, as well as the presence of post-selection and…

Quantum Physics · Physics 2014-11-13 Matthew F. Pusey

This paper explores the well known approximation approach to decide weak bisimilarity of Basic Parallel Processes. We look into how different refinement functions can be used to prove weak bisimilarity decidable for certain subclasses. We…

Formal Languages and Automata Theory · Computer Science 2012-08-15 Piotr Hofman , Patrick Totzke

Current discrete randomness and information conservation inequalities are over total recursive functions, i.e. restricted to deterministic processing. This restriction implies that an algorithm can break algorithmic randomness conservation…

Computational Complexity · Computer Science 2013-10-15 Samuel Epstein

Algorithmic theories of randomness can be related to theories of probabilistic sequence prediction through the notion of a predictor, defined as a function which supplies lower bounds on initial-segment probabilities of infinite sequences.…

Information Theory · Computer Science 2024-01-25 Lenhart K. Schubert

We extend the definition of weak symmetric continuity to be applicable for functions defined on any nonempty subset of $\R$. Then we investigate basic properties of weakly symmetrically continuous functions and compare them with those of…

Classical Analysis and ODEs · Mathematics 2014-05-29 Prapanpong Pongsriiam , Teraporn Thongsiri

In a recent paper, M. Green and P. Griffiths used R. Thomas' works on nodal hypersurfaces to establish the equivalence of the Hodge conjecture and the existence of certain singular admissible normal functions. Inspired by their work, we…

Algebraic Geometry · Mathematics 2008-02-19 Patrick Brosnan , Hao Fang , Zhaohu Nie , Gregory Pearlstein

A classical Kamae-Weiss theorem states that an increasing sequence $(n_i)_{i\in\mathbb N}$ of positive lower density is \emph{normality preserving}, i.e. has the property that for any normal binary sequence $(b_n)_{n\in\mathbb N}$, the…

Dynamical Systems · Mathematics 2020-04-07 Vitaly Bergelson , Tomasz Downarowicz , Joseph Vandehey