Related papers: Random Permutations in Computational Complexity
The notion of probability plays an important role in almost all areas of science and technology. In modern mathematics, however, probability theory means nothing other than measure theory, and the operational characterization of the notion…
Within the last fifteen years, a program of establishing relationships between algorithmic randomness and almost-everywhere theorems in analysis and ergodic theory has developed. In harmonic analysis, Franklin, McNicholl, and Rute…
Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential, and manipulators may know the already cast votes but may not know the future votes. We…
This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for…
While it is well known that a Turing machine equipped with the ability to flip a fair coin cannot compute more that a standard Turing machine, we show that this is not true for a biased coin. Indeed, any oracle set $X$ may be coded as a…
Let $P_n^{\text{sep}}$ denote the uniform probability measure on the set of separable permutations in $S_n$. Let $\mathbb{N}^*=\mathbb{N}\cup\{\infty\}$ with an appropriate metric and denote by $S(\mathbb{N},\mathbb{N}^*)$ the compact…
A reformulation of the Kelly Criterion is presented. Let $\mathfrak{G}$ be a generic stochastic Bernoulli binary game with outcomes $\mathscr{Z}(I)\in\lbrace -1,1\rbrace$ of N trials for $I=1...N$. The binomial probabilities are…
I present here some results on the statistical behaviour of large random matrices in an ensemble where the probability distribution is not a function of the eigenvalues only. The perturbative expansion can be cast in a closed form and the…
Two sequential estimators are proposed for the odds p/(1-p) and log odds log(p/(1-p)) respectively, using independent Bernoulli random variables with parameter p as inputs. The estimators are unbiased, and guarantee that the variance of the…
This paper extends results of Mortimer and Williams (1991) about changes of probability measure up to a random time under the assumptions that all martingales are continuous and that the random time avoids stopping times. We consider…
There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…
A ballot permutation is a permutation $\pi$ such that in any prefix of $\pi$ the descent number is not more than the ascent number. By using a reversal concatenation map, we give a formula for the joint distribution (pk, des) of the peak…
It is known that if $x\in[0,1]$ is polynomial time random (i.e. no polynomial time computable martingale succeeds on the binary fractional expansion of $x$) then $x$ is normal in any integer base greater than one. We show that if $x$ is…
In a recent work, Baladi and Demers constructed a measure of maximal entropy for finite horizon dispersing billiard maps and proved that it is unique, mixing and moreover Bernoulli. We show that this measure enjoys natural probabilistic…
Unlike Martin-L\"of randomness and Schnorr randomness, computable randomness has not been defined, except for a few ad hoc cases, outside of Cantor space. This paper offers such a definition (actually, several equivalent definitions), and…
We consider finite Bernoulli convolutions with a parameter $1/2 < r < 1$ supported on a discrete point set, generically of size $2^N$. These sequences are uniformly distributed with respect to the infinite Bernoulli convolution measure…
Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential, and manipulators may know the already cast votes but may not know the future votes. We…
One can fix the randomness used by a randomized algorithm, but there is no analogous notion of fixing the quantumness used by a quantum algorithm. Underscoring this fundamental difference, we show that, in the black-box setting, the…
We continue the investigation of algorithmically random functions and closed sets, and in particular the connection with the notion of capacity. We study notions of random continuous functions given in terms of a family of computable…
We study the topology of a random cubical complex associated to Bernoulli site percolation on a cubical grid. We begin by establishing a limit law for homotopy types. More precisely, looking within an expanding window, we define a sequence…