Electron Kinetic Entropy across Quasi-Perpendicular Shocks

We use Magnetospheric Multiscale (MMS) data to study electron kinetic entropy per particle Se across Earth’s quasi-perpendicular bow shock. We have selected 22 shock crossings covering a wide range of shock conditions. Measured distribution functions are calibrated and corrected for spacecraft potential, secondary electron contamination, lack of measurements at the lowest energies and electron density measurements based on plasma frequency measurements. All crossings display an increase in electron kinetic entropy across the shock ΔSe being positive or zero within their error margin. There is a strong dependence of ΔSe on the change in electron temperature, ΔTe, and the upstream electron plasma beta, βe. Shocks with large ΔTe have large ΔSe. Shocks with smaller βe are associated with larger ΔSe. We use the values of ΔSe, ΔTe and density change Δne to determine the effective adiabatic index of electrons for each shock crossing. The average effective adiabatic index is 〈γe〉=1.64±0.07.     

A Generalization of the Concavity of Rényi Entropy Power

Recently, Savaré-Toscani proved that the Rényi entropy power of general probability densities solving the p-nonlinear heat equation in Rn is a concave function of time under certain conditions of three parameters n,p,μ , which extends Costa’s concavity inequality for Shannon’s entropy power to the Rényi entropy power. In this paper, we give a condition Φ(n,p,μ) of n,p,μ under which the concavity of the Rényi entropy power is valid. The condition Φ(n,p,μ) contains Savaré-Toscani’s condition as a special case and much more cases. Precisely, the points (n,p,μ) satisfying Savaré-Toscani’s condition consist of a two-dimensional subset of R3 , and the points satisfying the condition Φ(n,p,μ) consist a three-dimensional subset of R3 . Furthermore, Φ(n,p,μ) gives the necessary and sufficient condition in a certain sense. Finally, the conditions are obtained with a systematic approach.     

A Review of the System-Intrinsic Nonequilibrium Thermodynamics in Extended Space (MNEQT) with Applications

The review deals with a novel approach (MNEQT) to nonequilibrium thermodynamics (NEQT) that is based on the concept of internal equilibrium (IEQ) in an enlarged state space SZ involving internal variables as additional state variables. The IEQ macrostates are unique in SZ and have no memory just as EQ macrostates are in the EQ state space SX⊂SZ. The approach provides a clear strategy to identify the internal variables for any model through several examples. The MNEQT deals directly with system-intrinsic quantities, which are very useful as they fully describe irreversibility. Because of this, MNEQT solves a long-standing problem in NEQT of identifying a unique global temperature T of a system, thus fulfilling Planck’s dream of a global temperature for any system, even if it is not uniform such as when it is driven between two heat baths; T has the conventional interpretation of satisfying the Clausius statement that the exchange macroheatdeQflows from hot to cold, and other sensible criteria expected of a temperature. The concept of the generalized macroheat dQ=deQ+diQ converts the Clausius inequality dS≥deQ/T0 for a system in a medium at temperature T0 into the Clausius equalitydS≡dQ/T, which also covers macrostates with memory, and follows from the extensivity property. The equality also holds for a NEQ isolated system. The novel approach is extremely useful as it also works when no internal state variables are used to study nonunique macrostates in the EQ state space SX at the expense of explicit time dependence in the entropy that gives rise to memory effects. To show the usefulness of the novel approach, we give several examples such as irreversible Carnot cycle, friction and Brownian motion, the free expansion, etc.     

Evaluating Temporal Correlations in Time Series Using Permutation Entropy,Ordinal Probabilities and Machine Learning

Time series analysis comprises a wide repertoire of methods for extracting information from data sets. Despite great advances in time series analysis, identifying and quantifying the strength of nonlinear temporal correlations remain a challenge. We have recently proposed a new method based on training a machine learning algorithm to predict the temporal correlation parameter, α, of flicker noise (FN) time series. The algorithm is trained using as input features the probabilities of ordinal patterns computed from FN time series, xαFN(t), generated with different values of α. Then, the ordinal probabilities computed from the time series of interest, x(t), are used as input features to the trained algorithm and that returns a value, αe, that contains meaningful information about the temporal correlations present in x(t). We have also shown that the difference, Ω, of the permutation entropy (PE) of the time series of interest, x(t), and the PE of a FN time series generated with α=αe, xαeFN(t), allows the identification of the underlying determinism in x(t). Here, we apply our methodology to different datasets and analyze how αe and Ω correlate with well-known quantifiers of chaos and complexity. We also discuss the limitations for identifying determinism in highly chaotic time series and in periodic time series contaminated by noise. The open source algorithm is available on Github.     

Construction of a Family of Maximally Entangled Bases in ℂd ⊗ ℂd′

In this paper, we present a new method for the construction of maximally entangled states in Cd⊗Cd′ when d′≥2d. A systematic way of constructing a set of maximally entangled bases (MEBs) in Cd⊗Cd′ was established. Both cases when d′ is divisible by d and not divisible by d are discussed. We give two examples of maximally entangled bases in C2⊗C4, which are mutually unbiased bases. Finally, we found a new example of an unextendible maximally entangled basis (UMEB) in C2⊗C5.     

An Information-Theoretic Perspective on Proper Quaternion Variational Autoencoders

Variational autoencoders are deep generative models that have recently received a great deal of attention due to their ability to model the latent distribution of any kind of input such as images and audio signals, among others. A novel variational autoncoder in the quaternion domain H, namely the QVAE, has been recently proposed, leveraging the augmented second order statics of H-proper signals. In this paper, we analyze the QVAE under an information-theoretic perspective, studying the ability of the H-proper model to approximate improper distributions as well as the built-in H-proper ones and the loss of entropy due to the improperness of the input signal. We conduct experiments on a substantial set of quaternion signals, for each of which the QVAE shows the ability of modelling the input distribution, while learning the improperness and increasing the entropy of the latent space. The proposed analysis will prove that proper QVAEs can be employed with a good approximation even when the quaternion input data are improper.     

On Conditional Tsallis Entropy

There is no generally accepted definition for conditional Tsallis entropy. The standard definition of (unconditional) Tsallis entropy depends on a parameter α that converges to the Shannon entropy as α approaches 1. In this paper, we describe three proposed definitions of conditional Tsallis entropy suggested in the literature—their properties are studied and their values, as a function of α, are compared. We also consider another natural proposal for conditional Tsallis entropy and compare it with the existing ones. Lastly, we present an online tool to compute the four conditional Tsallis entropies, given the probability distributions and the value of the parameter α.     

New Bounds and a Generalization for Share Conversion for 3-Server PIR

Private Information Retrieval (PIR) protocols, which allow the client to obtain data from servers without revealing its request, have many applications such as anonymous communication, media streaming, blockchain security, advertisement, etc. Multi-server PIR protocols, where the database is replicated among the non-colluding servers, provide high efficiency in the information-theoretic setting. Beimel et al. in CCC 12’ (further referred to as BIKO) put forward a paradigm for constructing multi-server PIR, capturing several previous constructions for k≥3 servers, as well as improving the best-known share complexity for 3-server PIR. A key component there is a share conversion scheme from corresponding linear three-party secret sharing schemes with respect to a certain type of “modified universal” relation. In a useful particular instantiation of the paradigm, they used a share conversion from (2,3)-CNF over Zm to three-additive sharing over Zpβ for primes p1,p2,p where p1≠p2 and m=p1·p2, and the relation is modified universal relation CSm. They reduced the question of the existence of the share conversion for a triple (p1,p2,p) to the (in)solvability of a certain linear system over Zp, and provided an efficient (in m,logp) construction of such a sharing scheme. Unfortunately, the size of the system is Θ(m2) which entails the infeasibility of a direct solution for big m’s in practice. Paskin-Cherniavsky and Schmerler in 2019 proved the existence of the conversion for the case of odd p1, p2 when p=p1, obtaining in this way infinitely many parameters for which the conversion exists, but also for infinitely many of them it remained open. In this work, using some algebraic techniques from the work of Paskin-Cherniavsky and Schmerler, we prove the existence of the conversion for even m’s in case p=2 (we computed β in this case) and the absence of the conversion for even m’s in case p>2. This does not improve the concrete efficiency of 3-server PIR; however, our result is promising in a broader context of constructing PIR through composition techniques with k≥3 servers, using the relation CSm where m has more than two prime divisors. Another our suggestion about 3-server PIR is that it’s possible to achieve a shorter server’s response using the relation CSm′ for extended Sm′⊃Sm. By computer search, in BIKO framework we found several such sets for small m’s which result in share conversion from (2,3)-CNF over Zm to 3-additive secret sharing over Zpβ′, where β′>0 is several times less than β, which implies several times shorter server’s response. We also suggest that such extended sets Sm′ can result in better PIR due to the potential existence of matching vector families with the higher Vapnik-Chervonenkis dimension.     

On α-Limit Sets in Lorenz Maps

The aim of this paper is to show that α-limit sets in Lorenz maps do not have to be completely invariant. This highlights unexpected dynamical behavior in these maps, showing gaps existing in the literature. Similar result is obtained for unimodal maps on [0,1]. On the basis of provided examples, we also present how the performed study on the structure of α-limit sets is closely connected with the calculation of the topological entropy.     

Dirichlet Polynomials and Entropy

A Dirichlet polynomial d in one variable y is a function of the form d(y)=anny+⋯+a22y+a11y+a00y for some n,a0,…,an∈N. We will show how to think of a Dirichlet polynomial as a set-theoretic bundle, and thus as an empirical distribution. We can then consider the Shannon entropy H(d) of the corresponding probability distribution, and we define its length (or, classically, its perplexity) by L(d)=2H(d). On the other hand, we will define a rig homomorphism h:Dir→Rect from the rig of Dirichlet polynomials to the so-called rectangle rig, whose underlying set is R⩾0×R⩾0 and whose additive structure involves the weighted geometric mean; we write h(d)=(A(d),W(d)), and call the two components area and width (respectively). The main result of this paper is the following: the rectangle-area formula A(d)=L(d)W(d) holds for any Dirichlet polynomial d. In other words, the entropy of an empirical distribution can be calculated entirely in terms of the homomorphism h applied to its corresponding Dirichlet polynomial. We also show that similar results hold for the cross entropy.     

Constraints on Non-Flat Starobinsky f(R) Dark Energy Model

We study the viable Starobinsky f(R) dark energy model in spatially non-flat FLRW backgrounds, where f(R)=R−λRch[1−(1+R2/Rch2)−1] with Rch and λ representing the characteristic curvature scale and model parameter, respectively. We modify CAMB and CosmoMC packages with the recent observational data to constrain Starobinsky f(R) gravity and the density parameter of curvature ΩK. In particular, we find the model and density parameters to be λ−1<0.283 at 68% C.L. and ΩK=−0.00099−0.0042+0.0044 at 95% C.L., respectively. The best χ2 fitting result shows that χf(R)2≲χΛCDM2, indicating that the viable f(R) gravity model is consistent with ΛCDM when ΩK is set as a free parameter. We also evaluate the values of AIC, BIC and DIC for the best fitting results of f(R) and ΛCDM models in the non-flat universe.     

Estimating Drift Parameters in a Sub-Fractional Vasicek-Type Process

This study deals with drift parameters estimation problems in the sub-fractional Vasicek process given by dxt=θ(μ−xt)dt+dStH, with θ>0, μ∈R being unknown and t≥0; here, SH represents a sub-fractional Brownian motion (sfBm). We introduce new estimators θ^ for θ and μ^ for μ based on discrete time observations and use techniques from Nordin–Peccati analysis. For the proposed estimators θ^ and μ^, strong consistency and the asymptotic normality were established by employing the properties of SH. Moreover, we provide numerical simulations for sfBm and related Vasicek-type process with different values of the Hurst index H.     

Ischemic Stroke Risk Assessment by Multiscale Entropy Analysis of Heart Rate Variability in Patients with Persistent Atrial Fibrillation

It has been recognized that heart rate variability (HRV), defined as the fluctuation of ventricular response intervals in atrial fibrillation (AFib) patients, is not completely random, and its nonlinear characteristics, such as multiscale entropy (MSE), contain clinically significant information. We investigated the relationship between ischemic stroke risk and HRV with a large number of stroke-naïve AFib patients (628 patients), focusing on those who had never developed an ischemic/hemorrhagic stroke before the heart rate measurement. The CHA2DS2−VASc score was calculated from the baseline clinical characteristics, while the HRV analysis was made from the recording of morning, afternoon, and evening. Subsequently, we performed Kaplan–Meier method and cumulative incidence function with mortality as a competing risk to estimate the survival time function. We found that patients with sample entropy (SE(s)) ≥ 0.68 at 210 s had a significantly higher risk of an ischemic stroke occurrence in the morning recording. Meanwhile, the afternoon recording showed that those with SE(s) ≥ 0.76 at 240 s and SE(s) ≥ 0.78 at 270 s had a significantly lower risk of ischemic stroke occurrence. Therefore, SE(s) at 210 s (morning) and 240 s ≤ s ≤ 270 s (afternoon) demonstrated a statistically significant predictive value for ischemic stroke in stroke-naïve AFib patients.