Related papers: On a dynamical approach to some prime number seque…
The spectral moments of ensembles of sparse random block matrices are analytically evaluated in the limit of large order. The structure of the sparse matrix corresponds to the Erd\"os-Renyi random graph. The blocks are i.i.d. random…
An approach to generate the pseudorandom-bit sequence from the asymptotic deterministic randomness system is proposed in this Letter. We study the characteristic of multi-value correspondence of the asymptotic deterministic randomness…
We deal here with the issue of determinism versus randomness in time series. One wishes to identify their relative importance in a given time series. To this end we extend i) the use of ordinal patterns-based probability distribution…
Consider $ m $ copies of an irreducible, aperiodic Markov chain $ Y $ taking values in a finite state space. The asymptotics as $ m $ tends to infinity, of the first time from which on the trajectories of the $ m $ copies differ, have been…
A distinguishing feature of certain intractable problems in prime number theory is the sparsity of the underlying sequence. Motivated by the general problem of finding primes in sparse polynomial sequences, we give an estimate for the…
Stochastic chains represent a wide and key variety of phenomena in many branches of science within the context of Information Theory and Thermodynamics. They are typically approached by a sequence of independent events or by a memoryless…
Let $(a_n)_{n \geq 1}$ be a sequence of distinct positive integers. In a recent paper Rudnick established asymptotic upper bounds for the minimal gaps of $\{a_n \alpha \bmod 1, 1 \leq n \leq N\}$ as $N \to \infty$, valid for Lebesgue-almost…
We consider limit probabilities of first order properties in random graphs with a given degree sequence. Under mild conditions on the degree sequence, we show that the closure set of limit probabilities is a finite union of closed…
We investigate the longest common substring problem for encoded sequences and its asymptotic behaviour. The main result is a strong law of large numbers for a re-scaled version of this quantity, which presents an explicit relation with the…
This paper is concerned with the problem of designing distributed control protocols for network systems affected by delays and disturbances consisting of a first-order polynomial component and a residual signal. Specifically, we propose the…
Flow-based generative models parameterize probability distributions through an invertible transformation and can be trained by maximum likelihood. Invertible residual networks provide a flexible family of transformations where only…
Forbidden ordinal patterns are ordinal patterns (or `rank blocks') that cannot appear in the orbits generated by a map taking values on a linearly ordered space, in which case we say that the map has forbidden patterns. Once a map has a…
Analytical expressions for the width and conductance peak distributions of irregularly shaped quantum dots in the Coulomb blockade regime are presented in the limits of conserved and broken time-reversal symmetry. The results are obtained…
The paper deals with the convergence properties of the products of random (row-)stochastic matrices. The limiting behavior of such products is studied from a dynamical system point of view. In particular, by appropriately defining a dynamic…
We assume that the energy spectrum of a chaotic system undergoing symmetry breaking transitions can be represented as a superposition of independent level sequences, one increasing on the expense of the others. The relation between the…
An interesting open conjecture asks whether it is possible to walk to infinity along primes, where each term in the sequence has one digit more than the previous. We present different greedy models for prime walks to predict the long-time…
In this paper we show the distributions of sliding block patterns for Bernoulli processes with finite alphabet, which is not based on the induction on sample size. We show a new inclusion-exclusion formula in multivariate generating…
We study Piatetski-Shapiro sequences $(\lfloor n^c\rfloor)_n$ modulo m, for non-integer $c >1$ and positive $m$, and we are particularly interested in subword occurrences in those sequences. We prove that each block $\in\{0,1\}^k$ of length…
Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…
In this paper we develop a method to transfer density results for primitive automatic sequences to logarithmic-density results for general automatic sequences. As an application we show that the logarithmic densities of any automatic…