scholarly journals Lattice reduction in two dimensions: analyses under realistic probabilistic models

2007 ◽  
Vol DMTCS Proceedings vol. AH,... (Proceedings) ◽  
Author(s):  
Brigitte Vallée ◽  
Antonio Vera
Keyword(s):  
Dynamical Systems ◽  
Probabilistic Models ◽  
Two Dimensions ◽  
Lattice Reduction ◽  
Lll Algorithm ◽  
Transfer Operators ◽  
International Audience ◽  
Dimension 2

International audience The Gaussian algorithm for lattice reduction in dimension 2 is precisely analysed under a class of realistic probabilistic models, which are of interest when applying the Gauss algorithm "inside'' the LLL algorithm. The proofs deal with the underlying dynamical systems and transfer operators. All the main parameters are studied: execution parameters which describe the behaviour of the algorithm itself as well as output parameters, which describe the geometry of reduced bases.

CHAOTIC DYNAMICS FOR MAPS IN ONE AND TWO DIMENSIONS: A GEOMETRICAL METHOD AND APPLICATIONS TO ECONOMICS

2009 ◽  
Vol 19 (10) ◽  
pp. 3283-3309 ◽  
Author(s):  
ALFREDO MEDIO ◽  
MARINA PIREDDU ◽  
FABIO ZANOLIN
Keyword(s):  
Dynamical Systems ◽  
Discrete Time ◽  
Chaotic Dynamics ◽  
Economic Models ◽  
Two Dimensions ◽  
Geometrical Method ◽  
Mathematical Ideas ◽  
Definition Of ◽  
Applications To Economics ◽  
Discrete Time Dynamical Systems

This article describes a method — called here "the method of Stretching Along the Paths" (SAP) — to prove the existence of chaotic sets in discrete-time dynamical systems. The method of SAP, although mathematically rigorous, is based on some elementary geometrical considerations and is relatively easy to apply to models arising in applications. The paper provides a description of the basic mathematical ideas behind the method, as well as three applications to economic models. Incidentally, the paper also discusses some questions concerning the definition of chaos and some problems arising from economic models in which the dynamics are defined only implicitly.

PARTICLE FILTER OPTIMIZATION TOOLS FOR DYNAMICAL SYSTEMS PROBABILISTIC MODELS

2021 ◽  
pp. 4-10
Author(s):  
П.В. Полухин
Keyword(s):  
Dynamical Systems ◽  
Distributed Computing ◽  
Particle Filter ◽  
Dynamic Systems ◽  
Probabilistic Models ◽  
Sufficient Statistics ◽  
Voice Synthesis ◽  
Sample Decomposition ◽  
Speed Up ◽  
Filtering Procedure

В работе предложены математические инструменты на основе достаточных статистик и декомпозиции выборок в сочетании с алгоритмами распределенных вычислений, позволяющие существенно повысить эффективность процедуры фильтрации. Filtering algorithms are used to assess the state of dynamic systems when solving various practical problems, such as voice synthesis and determining the geo-position and monitoring the movement of objects. In the case of complex hierarchical dynamic systems with a large number of time slices, the process of calculating probabilistic characteristics becomes very time-consuming due to the need to generate a large number of samples. The essence of optimization is to reduce the number of samples generated by the filter, increase their consistency and speed up computational operations. The paper offers mathematical tools based on sufficient statistics and sample decomposition in combination with distributed computing algorithms that can significantly improve the efficiency of the filtering procedure.

scholarly journals On the bialgebra of functional graphs and differential algebras

1997 ◽  
Vol Vol. 1 ◽  
Author(s):  
Maurice Ginocchio
Keyword(s):  
Dynamical Systems ◽  
Differential Operators ◽  
Discrete Dynamical Systems ◽  
Rooted Trees ◽  
Connected Components ◽  
Differential Algebras ◽  
Noncommutative Polynomials ◽  
International Audience

International audience We develop the bialgebraic structure based on the set of functional graphs, which generalize the case of the forests of rooted trees. We use noncommutative polynomials as generating monomials of the functional graphs, and we introduce circular and arborescent brackets in accordance with the decomposition in connected components of the graph of a mapping of \1, 2, \ldots, n\ in itself as in the frame of the discrete dynamical systems. We give applications fordifferential algebras and algebras of differential operators.

scholarly journals Digital Trees and Memoryless Sources: from Arithmetics to Analysis

2010 ◽  
Vol DMTCS Proceedings vol. AM,... (Proceedings) ◽  
Author(s):  
Philippe Flajolet ◽  
Mathieu Roux ◽  
Brigitte Vallée
Keyword(s):  
Probabilistic Models ◽  
Asymptotic Form ◽  
Leader Election ◽  
Text Compression ◽  
Digital Trees ◽  
Arithmetic Properties ◽  
International Audience ◽  
Error Terms ◽  
Dynamic Hashing

International audience Digital trees, also known as $\textit{"tries''}$, are fundamental to a number of algorithmic schemes, including radix-based searching and sorting, lossless text compression, dynamic hashing algorithms, communication protocols of the tree or stack type, distributed leader election, and so on. This extended abstract develops the asymptotic form of expectations of the main parameters of interest, such as tree size and path length. The analysis is conducted under the simplest of all probabilistic models; namely, the $\textit{memoryless source}$, under which letters that data items are comprised of are drawn independently from a fixed (finite) probability distribution. The precise asymptotic structure of the parameters' expectations is shown to depend on fine singular properties in the complex plane of a ubiquitous $\textit{Dirichlet series}$. Consequences include the characterization of a broad range of asymptotic regimes for error terms associated with trie parameters, as well as a classification that depends on specific $\textit{arithmetic properties}$, especially irrationality measures, of the sources under consideration.

Sign in / Sign up

Export Citation Format

Share Document