English
Related papers

Related papers: Dichotomic random number generators

200 papers

We examine some properties of pseudo-multiplications, which are a special kind of associative binary relations defined on $\bar{\mathbb{R}}_+ \times \bar{\mathbb{R}}_+$.

Rings and Algebras · Mathematics 2013-01-07 Paul Poncet

We propose a generative model termed Deciphering Autoencoders. In this model, we assign a unique random dropout pattern to each data point in the training dataset and then train an autoencoder to reconstruct the corresponding data point…

Machine Learning · Computer Science 2024-07-01 Shunta Maeda

We develop a pseudorandom generator that fools degree-$d$ polynomial threshold functions in $n$ variables with respect to the Gaussian distribution and has seed length $O_{c,d}(\log(n) \epsilon^{-c})$.

Computational Complexity · Computer Science 2012-10-05 Daniel M. Kane

This work studies the problem of separate random number generation from correlated general sources with side information at the tester under the criterion of statistical distance. Tight one-shot lower and upper performance bounds are…

Information Theory · Computer Science 2016-05-02 Shengtian Yang

The order of orbit generation in one-dimensional Lorenz-like maps is presented within a two letter symbolics scheme. This order is derived from the natural order of a set of fractions associated to the binary sequences. Its relation to the…

Chaotic Dynamics · Physics 2007-05-23 Ricardo Lopez-Ruiz

This paper presents a class of random orthogonal sequences associated with the number theoretic Hilbert transform. We present a constructive procedure for finding the random sequences for different modulus values. These random sequences…

Cryptography and Security · Computer Science 2013-11-28 Subhash Kak

The aim of this paper is to present a new design for a pseudorandom number generator (PRNG) that is cryptographically secure, passes all of the usual statistical tests referenced in the literature and hence generates high quality random…

Cryptography and Security · Computer Science 2025-03-25 Juan Di Mauro , Eduardo Salazar , Hugo D. Scolnik

We investigate the directed random walk on hierarchic trees. Two cases are investigated: random variables on deterministic trees with a continuous branching, and random variables on the trees constructed trough the random branching process.…

Statistical Mechanics · Physics 2015-06-12 David B. Saakian

We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…

Combinatorics · Mathematics 2026-01-23 Ziemowit Kostana , Jarosław Swaczyna , Agnieszka Widz

In this paper, we implement a revised pseudo random bit generator based on a rule-90 cellular automaton. For this purpose, we introduce a sequence matrix H_N with the aim of calculating the pseudo random sequences of N bits employing the…

Computational Physics · Physics 2010-12-24 J. S. Murguia , M. Mejia-Carlos , H. C. Rosu , G. Flores-Eraña

In this work, pseudorandom sequence generators based on finite fields have been analyzed from the point of view of their cryptographic application. In fact, a class of nonlinear sequence generators has been modelled in terms of linear…

Cryptography and Security · Computer Science 2010-05-12 Amparo Fuster-Sabater , Pino Caballero-Gil

Successive pairs of pseudo-random numbers generated by standard linear congruential transformations display ordered patterns of parallel lines. We study the ``ordered'' and ``chaotic'' distribution of such pairs by solving the eigenvalue…

chao-dyn · Physics 2015-06-24 Antonio Bonelli , Stefano Ruffo

In this paper we discuss a natural generalization of the Stern Brocot tree which comes from the introduction of weighted mediants. We focus our attention on the case $k = 3$, in which $(2a + c)/(2b + d)$ and $(a + 2c)/(b + 2d)$ are the two…

Number Theory · Mathematics 2016-02-05 Dhroova Aiylam , Tanya Khovanova

In this paper, we provide a general framework for counting geometric structures in pseudo-random graphs. As applications, our theorems recover and improve several results on the finite field analog of questions originally raised in the…

Combinatorics · Mathematics 2025-04-30 Thang Pham , Steven Senger , Michael Tait , Vu Thi Huong Thu

We provide the necessary and sufficient conditions for the edge-binomials of the tree forming a $d$-sequence in terms of the degree sequence notion of a graph. We study the regularity of powers of the binomial edge ideals of trees generated…

Commutative Algebra · Mathematics 2023-05-19 Marie Amalore Nambi , Neeraj Kumar

In this paper we propose a notion of pattern avoidance in binary trees that generalizes the avoidance of contiguous tree patterns studied by Rowland and non-contiguous tree patterns studied by Dairyko, Pudwell, Tyner, and Wynn.…

Discrete Mathematics · Computer Science 2024-06-17 Petr Gregor , Torsten Mütze , Namrata

Multi-label classification is an important yet challenging task in natural language processing. It is more complex than single-label classification in that the labels tend to be correlated. Existing methods tend to ignore the correlations…

Computation and Language · Computer Science 2018-06-18 Pengcheng Yang , Xu Sun , Wei Li , Shuming Ma , Wei Wu , Houfeng Wang

Biological sequences do not come at random. Instead, they appear with particular frequencies that reflect properties of the associated system or phenomenon. Knowing how biological sequences are distributed in sequence space is thus a…

Biological Physics · Physics 2024-04-18 Wei-Chia Chen , Juannan Zhou , David M. McCandlish

This article describes, in elementary terms, a generic approach to produce discrete random tilings and similar random structures by using point process theory. The standard Voronoi and Delone tilings can be constructed in this way. For this…

Metric Geometry · Mathematics 2007-12-12 Kai Matzutt

We introduce a class of stochastic integer sequences. In these sequences, every element is a sum of two previous elements, at least one of which is chosen randomly. The interplay between randomness and memory underlying these sequences…

Statistical Mechanics · Physics 2007-05-23 E. Ben-Naim , P. L. Krapivsky