Related papers: Rotational analysis of ChaCha permutation
We introduce an explicit logarithmic transformation $T(x) = \{\log_6(x + 1/5)\}$ under which the Collatz map becomes a rigid circle rotation by the irrational angle \(\alpha = \log_6 3\), perturbed by a uniformly bounded error term. We…
Normal approximations for descents and inversions of permutations of the set $\{1,2,...,n\}$ are well known. A number of sequences that occur in practice, such as the human genome and other genomes, contain many repeated elements. Motivated…
We present a violation of the CHSH inequality without the fair sampling assumption with a continuously pumped photon pair source combined with two high efficiency superconducting detectors. Due to the continuous nature of the source, the…
In this paper, we focus on a special framework for quantum coin flipping protocols,_bit-commitment based protocols_, within which almost all known protocols fit. We show a lower bound of 1/16 for the bias in any such protocol. We also…
Consider a square matrix with independent and identically distributed entries of zero mean and unit variance. It is well known that if the entries have a finite fourth moment, then, in high dimension, with high probability, the spectral…
Let $A$ be a square random matrix of size $n$, with mean zero, independent but not identically distributed entries, with variance profile $S$. When entries are i.i.d. with unit variance, the spectral radius of $n^{-1/2}A$ converges to $1$…
The present paper addresses the following question: for a geometric random tree in $\R^{2}$, how many semi-infinite branches cross the circle $\CC_{r}$ centered at the origin and with a large radius $r$? We develop a method ensuring that…
In a distributed coin-flipping protocol, Blum [ACM Transactions on Computer Systems '83], the parties try to output a common (close to) uniform bit, even when some adversarially chosen parties try to bias the common output. In an adaptively…
This paper develops an analogy between the cycle structure of, on the one hand, random permutations with cycle lengths restricted to lie in an infinite set $S$ with asymptotic density $\sigma$ and, on the other hand, permutations selected…
A sorting network (also known as a reduced decomposition of the reverse permutation), is a shortest path from $12 \cdots n$ to $n \cdots 21$ in the Cayley graph of the symmetric group $S_n$ generated by adjacent transpositions. We prove…
Grimmett's random-orientation percolation is formulated as follows. The square lattice is used to generate an oriented graph such that each edge is oriented rightwards (resp. upwards) with probability $p$ and leftwards (resp. downwards)…
Using a non-perturbative method developed in a previous article (paper II) we investigate the tails of the probability distribution $P(\rho_R)$ of the overdensity within spherical cells. We show that our results for the low-density tail of…
We develop the theory of cryptographic nondeterministic-secure pseudorandomness beyond the point reached by Rudich's original work (Rudich 1997), and apply it to draw new consequences in average-case complexity and proof complexity.…
Classical probabilistic rounding error analysis is particularly well suited to stochastic rounding (SR), and it yields strong results when dealing with floating-point algorithms that rely heavily on summation. For many numerical linear…
Percolation threshold of a network is the critical value such that when nodes or edges are randomly selected with probability below the value, the network is fragmented but when the probability is above the value, a giant component…
Multiple players are each given one independent sample, about which they can only provide limited information to a central referee. Each player is allowed to describe its observed sample to the referee using a channel from a family of…
The random percolation model can be viewed as the dual of a well defined confining gauge theory; since this theory, having no Monte Carlo dynamics at all, is simple to simulate, it is possible to study the properties of the flux tube with…
We prove some general results about the asymptotics of the distribution of the number of cycles of given length of a random permutation whose distribution is invariant under conjugation. These results were first established to be applied in…
The study of crossing probabilities - i.e. probabilities of existence of paths crossing rectangles - has been at the heart of the theory of two-dimensional percolation since its beginning. They may be used to prove a number of results on…
About 10% of the observed asteroids have rotational periods lower than P = 3 h and they seem to be relatively close to the spin barrier. Yet, the rotation has often been neglected in simulations of asteroid collisions. To determine the…