Related papers: R\'enyi entropy and pattern matching for run-lengt…
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…
In this paper, we study the behaviour of the longest common substring for random subshifts of finite type (for dynamicists) or of the longest common substring for random sequences in random environments (for probabilists). We prove that,…
Maximal repetition of a string is the maximal length of a repeated substring. This paper investigates maximal repetition of strings drawn from stochastic processes. Strengthening previous results, two new bounds for the almost sure growth…
R\'enyi entropy is an important measure in the context of information theory as a generalization of Shannon entropy. This information measure was often used for uncertainty quantification of dynamical behaviour of stochastic processes. In…
In this paper, we discuss the possibility of unexplored behaviours for the entanglement entropy in extended quantum systems. Namely, we study the R\'enyi entanglement entropy for the ground state of long-range Kitaev chains with slow…
We study the Von Neumann and R\'enyi entanglement entropy of long-range harmonic oscillators (LRHO) by both theoretical and numerical means. We show that the entanglement entropy in massless harmonic oscillators increases logarithmically…
We study systematically resource measures of coherence and entanglement based on R\'enyi relative entropies, which include the logarithmic robustness of coherence, geometric coherence, and conventional relative entropy of coherence together…
Entanglement R\'enyi-$\alpha$ entropy is an entanglement measure. It generalizes the entanglement of formation, and they coincide when $\alpha$ tends to 1. We derive analytical lower and upper bounds for the entanglement R\'enyi-$\alpha$…
Shannon entropy is the shortest average codeword length a lossless compressor can achieve by encoding i.i.d. symbols. However, there are cases in which the objective is to minimize the \textit{exponential} average codeword length, i.e. when…
Via dependence with complete connections we investigate the $\psi$-mixing coefficients of the sequence $(a_n)_{n \in \mathbb{N}}$ of incomplete quotients and also of the doubly infinite sequence $(\overline{a}_l)_{l \in \mathbb{Z}}$ of…
In this work, we study the real-time evolution of pseudo-(R\'enyi) entropy, a generalization of entanglement entropy, in two-dimensional conformal field theories (CFTs). We focus on states obtained by acting primary operators located at…
Entropies must correspond to mean values for them to be measurable. The Shannon entropy corresponds to the weighted arithmetic mean, whereas the Renyi entropy corresponds to the exponential mean. These means refer to code lengths, which are…
Based on the problem of quantum data compression in a lossless way, we present here an operational interpretation for the family of quantum R\'enyi entropies. In order to do this, we appeal to a very general quantum encoding scheme that…
Let $(X, Y) = (X_n, Y_n)_{n \geq 1}$ be the output process generated by a hidden chain $Z = (Z_n)_{n \geq 1}$, where $Z$ is a finite state, aperiodic, time homogeneous, and irreducible Markov chain. Let $LC_n$ be the length of the longest…
We propose and experimentally measure an entropy that quantifies the volume of correlations among qubits. The experiment is carried out on a nearly isolated quantum system composed of a central spin coupled and initially uncorrelated with…
R\'enyi entropy of order \alpha is a general measure of entropy. In this paper we derive estimations for the R\'enyi entropy of the mixture of sources in terms of the entropy of the single sources. These relations allow to compute the…
Subword tokenization is a key part of many NLP pipelines. However, little is known about why some tokenizer and hyperparameter combinations lead to better downstream model performance than others. We propose that good tokenizers lead to…
We consider the two-dimensional (2d) Ising model on a infinitely long cylinder and study the probabilities $p_i$ to observe a given spin configuration $i$ along a circular section of the cylinder. These probabilities also occur as…
The goal of this paper is to develop an estimate for the entropy of random long-range correlated symbolic sequences with elements belonging to a finite alphabet. As a plausible model, we use the high-order additive stationary ergodic Markov…
R\'enyi entropies are conceptually valuable and experimentally relevant generalisations of the celebrated von Neumann entanglement entropy. After a quantum quench in a clean quantum many-body system they generically display a universal…