Results 21 to 30 of about 12,835 (246)
On the computability properties of topological entropy: a general approach
CoRR, 2019 The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological entropy for this kind of systems turned out to be of computational nature.
Silvère Gangloff +3 more
openaire +2 more sources
New Journal of Physics, 2020 Due to the interconnectedness of financial entities, estimating certain key properties of a complex financial system, including the implied level of systemic risk, requires detailed information about the structure of the underlying network of ...
Federica Parisi +2 more
doaj +1 more source
Task-based differences in brain state dynamics and their relation to cognitive ability
NeuroImage, 2023 Transient patterns of interregional connectivity form and dissipate in response to varying cognitive demands. Yet, it is not clear how different cognitive demands influence brain state dynamics, and whether these dynamics relate to general cognitive ...
Danielle L. Kurtin +4 more
doaj +1 more source
Calculation of Free Energy Consumption in Gene Transcription with Complex Promoter Structure
Complexity, 2020 From the viewpoint of thermodynamics, gene transcription necessarily consumes free energy due to nonequilibrium processes. On the other hand, regulatory molecules present on the core promoter of a gene interact often in a dynamic, highly combinatorial ...
Lifang Huang +3 more
doaj +1 more source
Physical Review Research, 2023 The cycle current is a crucial quantity in stochastic thermodynamics. The absolute and net cycle currents of a Markovian system can be defined in the loop-erased (LE) or spanning tree (ST) manner.
Yuhao Jiang, Bingjie Wu, Chen Jia
doaj +1 more source
A lower bound for topological entropy of generic non-Anosov symplectic diffeomorphisms [PDF]
Ergodic Theory and Dynamical Systems, 2013 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
PLoS ONE, 2014 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]
Dynamical Systems, 2017 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
Q-entropy for general topological dynamical systems
Discrete and Continuous Dynamical Systems, 2019 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
Nonlinear walkers and efficient exploration of congested networks
Physical Review Research, 2020 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