Sökning: "Discrete dynamical systems"

Visar resultat 1 - 5 av 15 uppsatser innehållade orden Discrete dynamical systems.

  1. 1. A Borel-Cantelli lemma for non-stationary dynamical systems

    Master-uppsats, Lunds universitet/Matematik LTH

    Författare :Teodor Åberg; [2023]
    Nyckelord :Borel-Cantelli lemmas; Dynamical systems; Mathematics and Statistics;

    Sammanfattning : In this thesis we present a Borel–Cantelli lemma for dynamical systems such that the dynamics driving the system varies with time. These results are largely based on a decomposition of transfer operators produced by Rychlik. Some limitations on the structure of sequences that is necessary for the results is given some discussion. LÄS MER

  2. 2. A Continuous-time ODE Framework to Centrality in Dynamic Networks

    Kandidat-uppsats, Lunds universitet/Matematikcentrum; Lunds universitet/Matematik (naturvetenskapliga fakulteten)

    Författare :Francisco Garcia Atienza; [2023]
    Nyckelord :networks; centrality; continuous-time; matrix logarithm; ode framework; katz; resolvent; Mathematics and Statistics;

    Sammanfattning : The present study discusses and evaluates a novel continuous-time approach to network centrality, a fundamental concept in network analysis. Static methods based on discrete snapshots or time slices for measuring node interaction in networks that change over time do not fully capture the dynamical nature of network evolution. LÄS MER

  3. 3. Investigating Multi-Objective Reinforcement Learning for Combinatorial Optimization and Scheduling Problems : Feature Identification for multi-objective Reinforcement Learning models

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Rikard Fridsén Skogsberg; [2022]
    Nyckelord :Multi-Objective Reinforcement Learning; Radio Resource Scheduling; Deep Q-Networks; Single-policy; Multi-policy; Scalarization.; Flermåls förstärkningsinlärning; Radio resurs schemaläggning; Djupa Q-nätverk; Enskilt mål; Flermål;

    Sammanfattning : Reinforcement Learning (RL) has in recent years become a core method for sequential decision making in complex dynamical systems, being of great interest to support improvements in scheduling problems. This could prove important to areas in the newer generation of cellular networks. LÄS MER

  4. 4. Data-Driven Learning for Approximating Dynamical Systems Using Deep Neural Networks

    Kandidat-uppsats, KTH/Skolan för teknikvetenskap (SCI)

    Författare :Axel Dernsjö; Max Berg Wahlström; [2021]
    Nyckelord :;

    Sammanfattning : In this thesis, a one-step approximation method has been used to produce approximations of two dynamical systems. The two systems considered are a pendulum and a damped dual-mass-spring system. LÄS MER

  5. 5. Ramification of polynomials

    Master-uppsats, Linnéuniversitetet/Institutionen för matematik (MA)

    Författare :Ana Strikic; [2021]
    Nyckelord :non-pleasantly ramified polynomials; minimally ramified polynomial; lower ramification numbers; minimal ramification; discrete dynamical systems; iterating polynomials; ultrametric fields;

    Sammanfattning : In this research,we study iterations of non-pleasantly ramified polynomials over fields of positive characteristic and subsequently, their lower ramification numbers. Of particular interest for this thesis are polynomials for which both the multiplicity and  the degree of its iterates grow exponentially. LÄS MER