English
Related papers

Related papers: Partial randomness and dimension of recursively en…

200 papers

A probabilistic characterization of the dominance partial order on the set of partitions is presented. This extends work in "Symmetric polynomials and symmetric mean inequalities". Electron. J. Combin., 20(3): Paper 34, 2013. Let $n$ be a…

Combinatorics · Mathematics 2015-12-15 Clifford Smyth

We establish that constructive continued fraction dimension originally defined using $s$-gales is robust, but surprisingly, that the effective continued fraction dimension and effective (base-$b$) Hausdorff dimension of the same real can be…

Information Theory · Computer Science 2023-08-16 Satyadev Nandakumar , Akhil S , Prateek Vishnoi

Random serial dictatorship (RSD) is a randomized assignment rule that - given a set of $n$ agents with strict preferences over $n$ houses - satisfies equal treatment of equals, ex post efficiency, and strategyproofness. For $n \le 3$,…

Theoretical Economics · Economics 2024-07-12 Felix Brandt , Matthias Greger , René Romen

We apply a probabilistic approach to study the computational complexity of analog computers which solve linear programming problems. We analyze numerically various ensembles of linear programming problems and obtain, for each of these…

Other Condensed Matter · Physics 2009-11-11 Yaniv Avizrats , Joshua Feinberg , Shmuel Fishman

Pseudorandmness plays an important role in number theory, complexity theory and cryptography. Our aim is to use models of arithmetic to explain pseudorandomness by randomness. To this end we construct a set of models $\cal M$, a common…

Logic · Mathematics 2012-10-18 Pavel Pudlak

The randomization of a complete first order theory T is the complete continuous theory T^R with two sorts, a sort for random elements of models of T, and a sort for events in an underlying probability space. We give necessary and sufficient…

Logic · Mathematics 2013-05-01 Uri Andrews , Isaac Goldbring , H. Jerome Keisler

If $S$ is an infinite sequence over a finite alphabet $\Sigma$ and $\beta$ is a probability measure on $\Sigma$, then the {\it dimension} of $ S$ with respect to $\beta$, written $\dim^\beta(S)$, is a constructive version of Billingsley…

Computational Complexity · Computer Science 2008-11-13 Jack H. Lutz

This paper introduces a novel extension of Fr\'{e}chet means, called \textit{generalized Fr\'{e}chet means} as a comprehensive framework for characterizing features in probability distributions in general topological spaces. The generalized…

Statistics Theory · Mathematics 2025-12-09 Jaesung Park , Sungkyu Jung

For pairs, omega, rho, of density operators on a finite dimensional Hilbert space of dimension d I call k-fidelity the d - k smallest eigenvalues of | omega^1/2 rho^1/2 |. k-fidelities are jointly concave in omega, rho. This follows by…

Quantum Physics · Physics 2009-10-31 Armin Uhlmann

The probability density function (PDF) of a random variable associated with the solution of a partial differential equation (PDE) with random parameters is approximated using a truncated series expansion. The random PDE is solved using two…

Numerical Analysis · Mathematics 2021-01-25 Giacomo Capodaglio , Max Gunzburger , Henry P. Wynn

The notion of a normal bit sequence was introduced by Borel in 1909; it was the first definition of an individual random object. Normality is a weak notion of randomness requiring only that all $2^n$ factors (substrings) of arbitrary…

Information Theory · Computer Science 2025-10-07 Alexander Shen

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

The probability of a random walker to return to its starting point in dimensions one and two is unity, a theorem first proven by G. Polya. The recurrence probability -- the probability to be found at the origin at a time t, is a power law…

Statistical Mechanics · Physics 2009-04-22 R. Pugatch , O. Firstenberg , M. Shuker , N. Davidson

This paper, broadly speaking, covers the use of randomness in two main areas: low-rank approximation and kernel methods. Low-rank approximation is very important in numerical linear algebra. Many applications depend on matrix decomposition…

Numerical Analysis · Mathematics 2020-08-12 Rishi Advani , Madison Crim , Sean O'Hagan

Given a self-similar set $\Lambda$ that is the attractor of an iterated function system (IFS) $\{f_1,\dots,f_N\}$, consider the following method for constructing a random subset of $\Lambda$: Let $\mathbf{p}=(p_1,\dots,p_N)$ be a…

Classical Analysis and ODEs · Mathematics 2026-05-26 Pieter Allaart , Lauritz Streck

Partial Rejection Sampling is an algorithmic approach to obtaining a perfect sample from a specified distribution. The objects to be sampled are assumed to be represented by a number of random variables. In contrast to classical rejection…

Data Structures and Algorithms · Computer Science 2024-09-18 Mark Jerrum

We look at the rate of growth of the partial quotients of the infinite continued fraction expansion of an irrational number relative to the rate of approximation of the number by its convergents. In non-generic cases the Hausdorff dimension…

Number Theory · Mathematics 2008-06-30 Andrew Haas

Let $\mathcal{A}$ be a random set constructed by picking independently each element of $\{1, \dots, n\}$ with probability $\alpha \in (0, 1)$. We give a formula for the probability that a rational number $q$ belong to the random ratio set…

Number Theory · Mathematics 2021-06-07 Carlo Sanna

In this paper, we present an abstract framework to obtain convergence rates for the approximation of random evolution equations corresponding to a random family of forms determined by finite-dimensional noise. The full discretization error…

Functional Analysis · Mathematics 2024-12-19 Katharina Klioba , Christian Seifert

We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n, all but countably many reals are n-random for such a measure,…

Logic · Mathematics 2021-04-06 Jan Reimann , Theodore A. Slaman