Related papers: The Randomness Deficiency Function and the Shift O…
A concept of randomness for infinite time register machines (ITRMs), resembling Martin-L\"of-randomness, is defined and studied. In particular, we show that for this notion of randomness, computability from mutually random reals implies…
For a discrete function $f\left( x\right) $ on a discrete set, the finite difference can be either forward and backward. If $f\left( x\right) $ is a sum of two such functions $f\left( x\right) =f_{1}\left( x\right) +f_{2}\left( x\right) $,…
In this paper, we primarily deal with approximately monotone and convex sequences. We start by showing that any sequence can be expressed as the difference between two nondecreasing sequences. One of these two monotone sequences act as the…
Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs. Unfortunately, such discrete counters often lead to…
For the model of two-dimensional random interlacements in the critical regime (i.e., $\alpha=1$), we prove that the vacant set is a.s.\ infinite, thus solving an open problem from arXiv:1502.03470. Also, we prove that the entrance measure…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
De Finetti's theorem, also called the de Finetti-Hewitt-Savage theorem, is a foundational result in probability and statistics. Roughly, it says that an infinite sequence of exchangeable random variables can always be written as a mixture…
Second order asymptotics of fixed-length source coding and intrinsic randomness is discussed with a constant error constraint. There was a difference between optimal rates of fixed-length source coding and intrinsic randomness, which never…
We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…
The problem of guessing a random string is revisited. A close relation between guessing and compression is first established. Then it is shown that if the sequence of distributions of the information spectrum satisfies the large deviation…
Let $S_N$ be the sum of vector-valued functions defined on a finite Markov chain. An analogue of the Bernstein--Hoeffding inequality is derived for the probability of large deviations of $S_N$ and relates the probability to the spectral gap…
Recently for a class of critically intermittent random systems a phase transition was found for the finiteness of the absolutely continuous invariant measure. The systems for which this result holds are characterized by the interplay…
Randomness comes in two qualitatively different forms. Apparent randomness can result both from ignorance or lack of control of degrees of freedom in the system. In contrast, intrinsic randomness should not be ascribable to any such cause.…
The notion of supershift generalizes that one of superoscillation and expresses the fact that the sampling of a function in an interval allows to compute the values of the function outside the interval. In a previous paper we discussed the…
We study the effect of finite difference operators of finite order on the distribution of zeros of polynomials and entire functions.
This paper introduces and investigates decision problems for numberless probabilistic automata, i.e. probabilistic automata where the support of each probabilistic transitions is specified, but the exact values of the probabilities are not.…
Mixing dependency lengths from sequences of different length is a common practice in language research. However, the empirical distribution of dependency lengths of sentences of the same length differs from that of sentences of varying…
Partial operators can have void or unbounded spectra. Contrarily to what is written in Dunford-Schwarz, the reason is not in the fact they are unounded operators.
We study how we can leverage only a handful of characteristics of a transformer's architecture to closely predict the number of different sequences it can output, both qualitatively and quantitatively. We provide an upper bound depending on…
One of my recent papers transforms an NP-Complete problem into the question of whether or not a feasible real solution exists to some Linear Program. The unique feature of this Linear Program is that though there is no explicit bound on the…