相关论文: On Entropy and Monotonicity for Real Cubic Maps
In real-world systems, the relationships and connections between components are highly complex. Real systems are often described as networks, where nodes represent objects in the system and edges represent relationships or connections…
The relationships between port-Hamiltonian systems modeling and the notion of monotonicity are explored. The earlier introduced notion of incrementally port-Hamiltonian systems is extended to maximal cyclically monotone relations, together…
We investigate linear parabolic maps on the torus. In a generic case these maps are non-invertible and discontinuous. Although the metric entropy of these systems is equal to zero, their dynamics is non-trivial due to folding of the image…
The von Neumann entropy of a graph is a spectral complexity measure that has recently found applications in complex networks analysis and pattern recognition. Two variants of the von Neumann entropy exist based on the graph Laplacian and…
The paper is devoted to establishing relationships between global and local monotonicity, as well as their maximality versions, for single-valued and set-valued mappings between finite-dimensional and infinite-dimensional spaces. We first…
We work with combinatorial maps to represent graph embeddings into surfaces up to isotopy. The surface in which the graph is embedded is left implicit in this approach. The constructions herein are proof-relevant and stated with a subset of…
Bowen showed that a continuous expansive map with specification has a unique measure of maximal entropy. We show that the conclusion remains true under weaker non-uniform versions of these hypotheses. To this end, we introduce the notions…
We introduce the notion of a one-way horseshoe and show that the polynomial entropy of an interval map is given by one-way horseshoes of iterates of the map, obtaining in such a way an analogue of Misiurewicz's theorem on topological…
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.
We study the inverse problem of inferring the state of a finite-level quantum system from expected values of a fixed set of observables, by maximizing a continuous ranking function. We have proved earlier that the maximum-entropy inference…
We define link and graph invariants from entropic magmas modeling them on the Kauffman bracket and Tutte polynomial. We define the homology of entropic magmas. We also consider groups that can be assigned to the families of compatible…
In this work we introduce a topological method for the search of fixed points and periodic points for continuous maps defined on generalized rectangles in finite dimensional Euclidean spaces. We name our technique "Stretching Along the…
Two-dimensional mappings obtained by coupling two piecewise increasing expanding maps are considered. Their dynamics is described when the coupling parameter increases in the expanding domain. By introducing a coding and by analysing an…
We consider infinite sequences of superstable orbits (cascades) generated by systematic substitutions of letters in the symbolic dynamics of one-dimensional nonlinear systems in the logistic map universality class. We identify the…
We study independent and identically distributed random iterations of continuous maps defined on a connected closed subset $S$ of the Euclidean space $\mathbb{R}^{k}$. We assume the maps are monotone (with respect to a suitable partial…
We establish that a mode-coupling approximation for the dynamics of multi-component systems obeying Smoluchowski dynamics preserves a subtle yet fundamental property: the matrices of partial density correlation functions are completely…
Many trace inequalities can be expressed either as concavity/convexity theorems or as monotonicity theorems. A classic example is the joint convexity of the quantum relative entropy which is equivalent to the Data Processing Inequality. The…
We define a notion of entropy for an infinite family $\mathcal{C}$ of measurable sets in a probability space. We show that the mean ergodic theorem holds uniformly for $\mathcal{C}$ under every ergodic transformation if and only if…
In this review we establish various connections between complex networks and symmetry. While special types of symmetries (e.g., automorphisms) are studied in detail within discrete mathematics for particular classes of deterministic graphs,…
From a two-agent, two-strategy congestion game where both agents apply the multiplicative weights update algorithm, we obtain a two-parameter family of maps of the unit square to itself. Interesting dynamics arise on the invariant diagonal,…