Related papers: Local correlation entropy
We introduce R\'enyi entropy of a subsystem energy as a natural quantity which closely mimics the behavior of the entanglement entropy and can be defined for all the quantum many body systems. For this purpose, consider a quantum chain in…
Let $\mathcal{M}(X)$ be the space of Borel probability measures on a compact metric space $X$ endowed with the weak$^\ast$-topology. In this paper, we prove that if the topological entropy of a nonautonomous dynamical system…
For a closed-loop control system with a digital channel between the sensor and the controller, the notion of invariance entropy quantifies the smallest average rate of information transmission above which a given compact subset of the state…
We derive an upper bound on the maximum balanced bipartite entanglement entropy of ground states of many-body Hamiltonians defined on a graph, agnostic to any particular model, that possesses a nontrivial automorphism group. We show that…
We study the exponential decay of relative entropy functionals for zero-range processes on the complete graph. For the standard model with rates increasing at infinity we prove entropy dissipation estimates, uniformly over the number of…
We generalize the definition of topological entropy given by Adler, Konheim, and McAndrew (AKM) for piecewise continuous self-maps defined on a compact interval (pc-maps). For this notion of entropy, we prove that the properties of the…
The characterizing feature of a many-body localized phase is the existence of an extensive set of quasi-local conserved quantities with an exponentially localized support. This structure endows the system with the signature logarithmic in…
This article presents a local realistic interpretation of quantum entanglement. The entanglement is explained as innate interference between the non-empty state associated with the peaked piece of one particle and the empty states…
The concept of entropy rate for a dynamical process on a graph is introduced. We study diffusion processes where the node degrees are used as a local information by the random walkers. We describe analitically and numerically how the degree…
We set up a new notion of local convergence for permutations and we prove a characterization in terms of proportions of \emph{consecutive} pattern occurrences. We also characterize random limiting objects for this new topology introducing a…
The celebrated Takens' embedding theorem concerns embedding an attractor of a dynamical system in a Euclidean space of appropriate dimension through a generic delay-observation map. The embedding also establishes a topological conjugacy. In…
Two flows defined on a smooth manifold are equivalent if there exists a homeomorphism of the manifold that sends each orbit of one flow onto an orbit of the other flow while preserving the time orientation. The topological entropy of a flow…
In [1], Collins et al. showed that the quantum entropy of random graph states satisfies the so-called area law as the local dimension tends to be large. In this paper, we continue to study the fluctuation of the convergence and thus prove…
Measuring the topological overlap of two graphs becomes important when assessing the changes between temporally adjacent graphs in a time-evolving network. Current methods depend on the fraction of nodes that have persisting edges. This…
The Expectation-Maximization (EM) algorithm is an iterative method to maximize the log-likelihood function for parameter estimation. Previous works on the convergence analysis of the EM algorithm have established results on the asymptotic…
The entanglement and localization in eigenstates of strongly chaotic subsystems are studied as a function of their interaction strength. Excellent measures for this purpose are the von-Neumann entropy, Havrda-Charv{\' a}t-Tsallis entropies,…
We consider topological dynamical systems given by skew products $S\rtimes_{\tau} T$, where $S\colon Y\to Y$ is a subshift, $\tau\colon Y\to\mathbb{Z}$ is a continuous cocycle, and $T$ is an arbitrary invertible topological system. For…
The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph \cite{DM1,M}. After Shannon introduced the definition of entropy to information and communication, many generalizations of the entropy…
A general geometrical structure of the entanglement entropy for spatial partition of a relativistic QFT system is established by using methods of the effective gravity action and the spectral geometry. A special attention is payed to the…
Recurrence plots provide a graphical representation of the recurrent patterns in a timeseries, the quantification of which is a relatively new field. Here we derive analytical expressions which relate the values of key statistics, notably…