A class of adding machine and Julia sets
Danilo Antonio Caprio

TL;DR
This paper introduces a stochastic Fibonacci-based adding machine modeled as a Markov chain, exploring its probabilistic properties and linking its spectrum to fibered Julia sets in complex dynamics.
Contribution
It defines a new class of stochastic adding machines tied to Fibonacci bases and connects their spectral properties to fibered Julia sets, advancing understanding in complex dynamics and probabilistic processes.
Findings
Markov chain transience and recurrence analyzed
Spectrum connected to fibered Julia sets
New stochastic Fibonacci adding machine model
Abstract
In this work we define a stochastic adding machine associated to the Fibonacci base and to a probabilities sequence . We obtain a Markov chain whose states are the set of nonnegative integers. We study probabilistic properties of this chain, such as transience and recurrence. We also prove that the spectrum associated to this Markov chain is connected to the fibered Julia sets for a class of endomorphisms in .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Computability, Logic, AI Algorithms · Algorithms and Data Compression
