News for hackers. Stuff that matters.
Re:Random Attractors – Found Using Lyapunov Exponents (2001) by DeathArrow on Friday May 17, 2024 @07:54AM (#40388894)
Dynamical systems open the door to a fascinating world and have a huge applicability in practice. I feel sorry I don't know much about the subject.
Re:Random Attractors – Found Using Lyapunov Exponents (2001) by metahikari on Friday May 17, 2024 @09:48AM (#40389821)
Perhaps you will find some of these resources helpful: https://sites.math.northwestern.edu/~clark/publications/chao... https://sites.math.northwestern.edu/~clark/dyn-sys/index.htm...

I took a course or two by Prof. Robinson as an undergrad and found the material engaging.

Re:Random Attractors – Found Using Lyapunov Exponents (2001) by ykonstant on Friday May 17, 2024 @02:32PM (#40392900)
Symbolic dynamics is a great gateway to DS for computer scientists. You can start with dynamics on words and group actions on graphs; the basics of these fields don't have too many prerequisites and have an immediate computational component you can exploit to augment your study with interesting code.
Re:Random Attractors – Found Using Lyapunov Exponents (2001) by DeathArrow on Saturday May 18, 2024 @01:57AM (#40396748)
Sounds interesting. Can you point to some problems in this field or some books or courses? Thanks!
Re:Random Attractors – Found Using Lyapunov Exponents (2001) by ykonstant on Saturday May 18, 2024 @08:22AM (#40398412)
A fairly accessible intro (needs Linear Algebra) is Lind's book, An Introduction to Symbolic Dynamics and Coding. For dynamics on graphs, you may begin with any book on Spectral Graph Theory.

A crucial theorem in symbolic dynamics is that entropy alone classifies Bernoulli systems (https://en.wikipedia.org/wiki/Bernoulli_scheme) up to isomorphism: if two Bernoulli systems have different entropies, they are structurally distinct. Starting from this fact, there are many problems trying to classify and distinguish symbolic systems based on computable invariants like entropy.

Perhaps the most famous problem associated to symbolic dynamics is the x2 x3 conjecture. It says that the only probability distribution on [0,1) with 0 identified to 1 (i.e. the flat circle) that is invariant under both multiplication by 2 mod 1 and multiplication by 3 mod 1 is the uniform distribution. This was formulated by H. Furstenberg after he proved an analogous topological statement.