A lower bound for topological entropy of generic non-Anosov symplectic diffeomorphisms [PDF]
AbstractWe prove that a${C}^{1} $generic symplectic diffeomorphism is either Anosov or its topological entropy is bounded from below by the supremum over the smallest positive Lyapunov exponent of its periodic points. We also prove that${C}^{1} $generic symplectic diffeomorphisms outside the Anosov ones do not admit symbolic extension and, finally, we ...
Catalan, Thiago, Tahzibi, Ali
openaire +3 more sources
A Generalized Topological Entropy for Analyzing the Complexity of DNA Sequences
Topological entropy is one of the most difficult entropies to be used to analyze the DNA sequences, due to the finite sample and high-dimensionality problems. In order to overcome these problems, a generalized topological entropy is introduced. The relationship between the topological entropy and the generalized topological entropy is compared, which ...
Shuilin Jin +6 more
openaire +4 more sources
C1-Genericity of symplectic diffeomorphisms and lower bounds for topological entropy [PDF]
There is a $C^1$-residual (Baire second class) subset $\mathcal{R}$ of symplectic diffeomorphisms on $2d$-dimensional manifold, $d\geq 1$, such that for every non-Anosov $f$ in $\mathcal{R}$ its topological entropy is lower bounded by the supremum of the Lyapunov exponents of their hyperbolic periodic points in the \emph{unbreakable central subbundle} (
Catalan, Thiago, Horita, Vanderlei
openaire +4 more sources
On the conditional entropy of wireless networks [PDF]
The characterization of topological uncertainty in wireless networks using the formalism of graph entropy has received interest in the spatial networks community. In this paper, we develop lower bounds on the entropy of a wireless network by conditioning
J. P. Coon +11 more
core +1 more source
Information transfer in signaling pathways : a study using coupled simulated and experimental data [PDF]
Background: The topology of signaling cascades has been studied in quite some detail. However, how information is processed exactly is still relatively unknown.
Kummer, U. (Ursula) +7 more
core +1 more source
Nonlinear walkers and efficient exploration of congested networks
Random walks are the simplest way to explore or search a graph and have revealed a very useful tool to investigate and characterize the structural properties of complex networks from the real world.
Timoteo Carletti +3 more
doaj +1 more source
Q-entropy for general topological dynamical systems
The paper extends the \(q\)-entropy theory from symbolic to general topological dynamical systems. Specifically, by means of a weak Gibbs measure, the authors define the \(q\)-topological entropy and the \(q\)-metric entropy, and then study their basic properties.
Zhao, Y (Zhao, Yun) +2 more
openaire +3 more sources
Holonomic and Non-Holonomic Geometric Models Associated to the Gibbs–Helmholtz Equation [PDF]
By replacing the internal energy with the free energy, as coordinates in a “space of observables”, we slightly modify (the known three) non-holonomic geometrizations from Udriste’s et al. work.
Vasile Preda +3 more
core +1 more source
Multi-boundary entanglement in Chern-Simons theory and link invariants
We consider Chern-Simons theory for gauge group G at level k on 3-manifolds M n with boundary consisting of n topologically linked tori. The Euclidean path integral on M n defines a quantum state on the boundary, in the n-fold tensor product of the torus
Vijay Balasubramanian +3 more
doaj +1 more source
A commutative noncommutative fractal geometry [PDF]
In this thesis examples of spectral triples, which represent fractal sets, are examined and new insights into their noncommutative geometries are obtained.
Samuel, Tony; id_orcid, Samuel, Anthony
core +1 more source

