PubMed Health⌕ Search

PubMed · 16252983

Multiple returns for some regular and mixing maps.

Abstract

We study the distributions of the number of visits for some noteworthy dynamical systems, considering whether limit laws exist by taking domains that shrink around points of the phase space. It is well known that for highly mixing systems such limit distributions exhibit a Poissonian behavior. We analyze instead a skew integrable map defined on a cylinder that models a shear flow. Since almost all fibers are given by irrational rotations, we at first investigate the distributions of the number of visits for irrational rotations on the circle. In this last case the numerical results strongly suggest the existence of limit laws when the shrinking domain is chosen in a descending chain of renormalization intervals. On the other hand, the numerical analysis performed for the skew map shows that limit distributions exist even if we take domains shrinking in an arbitrary way around a point, and these distributions appear to follow a power law decay of which we propose a theoretical explanation. It is interesting to note that we observe a similar behavior for domains wholly contained in the integrable region of the standard map. We also consider the case of two or more systems coupled together, proving that the distributions of the number of visits for domains intersecting the boundary between different regions are a linear superposition of the distributions characteristic of each region. Using this result we show that the real limit distributions can be hidden by some finite-size effects. In particular, when a chaotic and a regular region are glued together, the limit distributions follow a Poisson-like law, but as long as the measure of the shrinking domain is not zero, the polynomial behavior of the regular component dominates for large times. Such an analysis seems helpful to understand the dynamics in the regions where ergodic and regular motions are intertwined, as it may occur for the standard map. Finally, we study the distributions of the number of visits around generic and periodic points of the dissipative Henon map. Although this map is not uniformly hyperbolic, the distributions computed for generic points show a Poissonian behavior, as usually occurs for systems with highly mixing dynamics, whereas for periodic points the distributions follow a different law that is obtained from the statistics of first return times by assuming that subsequent returns are independent. These results are consistent with a possible rapid decay of the correlations for the Henon map.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

N Haydn, E Lunedei, L Rossi, G Turchetti, S Vaienti. 2005. Multiple returns for some regular and mixing maps.. https://doi.org/10.1063/1.2005507

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗