Absolutely continuous invariant measures for piecewise \nconvex maps of an interval with countable (infinite) \nnumber of branches
Notice bibliographique
Résumé
This thesis delves into three areas of research on dynamical systems. First, it explores the existence and exactness of Absolutely Continuous Invariant Measures (ACIM) for piecewise convex maps with countable (infinite) number of branches. Second, it employs Ulam’s method to approximate the density function of these ACIMs. Third, it investigates the existence of Absolutely Continuous Invariant Measures for piecewise concave maps using the technique of conjugation. For the first topic, we examine the existence and uniqueness of ACIMs within two distinct classes, denoted as T ∞ \npc (I) and T ∞,0 pc (I), which together encompass piecewise convex maps τ : I =[0, 1] → [0, 1] with countable number of branches. We establish the necessary conditions under which these maps possess a unique ACIM, presenting multiple illustrative examples of ACIM existence. \nOur findings are based on the analysis of the Frobenius-Perron operator associated with these maps, utilizing analytical techniques to gain insights into the Frobenius-Perron operator’s properties. \nThe main purpose of the second part of this thesis is to approximate τ by the map τn, where we construct a sequence τn with a finite number of branches. Then, approximate τn by Ulam’s method. Since piecewise convex maps have countable (infinite) number of branches, the convergence of Ulam’s method becomes more challenging, and complexity makes it harder to find a suitable sequence of approximating functions that can accurately analyze the behavior of this system across all branches. \nThe primary contribution of this Ph.D. thesis lies in the generalization of the existence of absolutely continuous invariant measures for piecewise convex maps defined on an interval with an infinite number of branches. In the case of T ∞pc (I), we examine piecewise convex maps with an infinite number of branches and arbitrary countable number of limit points for partition points separated from 0. For T ∞,0pc (I), we consider piecewise convex maps with countable number of branches and partition points that converge to 0. Throughout the thesis, we investigate Absolutely Continuous Invariant Measures (ACIM) for τ ∈ T ∞pc (I) and τ ∈ T ∞,0pc (I), along with exploring non-autonomous dynamical systems of maps within these classes and scrutinize the existence of ACIMs for their limit maps. \nFurthermore, we investigate the approximation for ACIMs associated with piecewise convex maps with an infinite number of branches by employing Ulam’s method. This computational approach is a practical way to estimate the density functions of ACIMs and thereby facilitate their numerical analysis. We then extended our research area on ACIM for piecewise concave maps with countable number of branches. We examine the existence and uniqueness of ACIMs for two distinct classes, T ∞pcv(I) and T ∞,1pcv (I), which encompass piecewise concave mappings denoted as σ. We utilize the concept of conjugation with piecewise convex maps τ to demonstrate that σ conserves a normalized absolutely continuous invariant measure with a density that exhibits increasing behavior.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction machine sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.
Scores du classifieur distillé par catégorie (deux têtes)
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,001 | 0,004 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,001 |
| Bibliométrie | 0,001 | 0,001 |
| Études des sciences et des technologies | 0,001 | 0,002 |
| Communication savante | 0,001 | 0,002 |
| Science ouverte | 0,001 | 0,001 |
| Intégrité de la recherche | 0,000 | 0,001 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,002 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».