SearcharxivSearch

arXiv · nlin/0411012

Fine structure of distributions and central limit theorem in diffusive billiards

Abstract

We investigate deterministic diffusion in periodic billiard models, in terms of the convergence of rescaled distributions to the limiting normal distribution required by the central limit theorem; this is stronger than the usual requirement that the mean square displacement grow asymptotically linearly in time. The main model studied is a chaotic Lorentz gas where the central limit theorem has been rigorously proved. We study one-dimensional position and displacement densities describing the time evolution of statistical ensembles in a channel geometry, using a more refined method than histograms. We find a pronounced oscillatory fine structure, and show that this has its origin in the geometry of the billiard domain. This fine structure prevents the rescaled densities from converging pointwise to gaussian densities; however, demodulating them by the fine structure gives new densities which seem to converge uniformly. We give an analytical estimate of the rate of convergence of the original distributions to the limiting normal distribution, based on the analysis of the fine structure, which agrees well with simulation results. We show that using a Maxwellian (gaussian) distribution of velocities in place of unit speed velocities does not affect the growth of the mean square displacement, but changes the limiting shape of the distributions to a non-gaussian one. Using the same methods, we give numerical evidence that a non-chaotic polygonal channel model also obeys the central limit theorem, but with a slower convergence rate.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David P. Sanders. 2004-11-04. Fine structure of distributions and central limit theorem in diffusive billiards. https://doi.org/10.1103/physreve.71.016220

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

KEEP EXPLORING

Related papers

Linear Response Predicts Cusp-Pair Births in Networks with a Localized Cubic

Linear response is cheap to measure; the bistability boundaries it organizes are not. For a passive network with one localized cubic, the driving-point receptance $G$ fixes the period-one cusp set at fundamental-harmonic order: cusps lie on a fixed phase contour of $G$, a tangency of that contour under parameter variation creates a pair, and its curvature separates a gap opening from an isolated loop. For a two-mode absorber the linear prediction locates a benchmark birth coupling to $0.3\%$, and to $0.03\%$ once a third-harmonic correction of scale $|G(3\Omega)/G(\Omega)|$ is included.

nlin.CD

Dynamics Creation through Neural Dynamical Transfer Learning

Data-driven machine learning has established a robust foundation for reconstructing nonlinear dynamical systems from observations, primarily for the purposes of forecasting and control. However, most existing efforts focus on recovering specific observed dynamics rather than the generative synthesis of new ones. Inspired by image fusion and style transfer, we introduce a neural network framework termed Neural Dynamical Transfer Learning (NDTL) to create new systems with prescribed dynamics from pairs of parent nonlinear dynamical systems. By computing fundamental dynamical signatures, including the intrinsic dimension, the Kaplan-Yorke dimension, the invariant measure statistics, and the Lyapunov spectrum, we demonstrate that NDTL preserves key features inherited from the parent models while simultaneously generating novel dynamics. Beyond these validation examples, NDTL induces a criterion for dynamics classification, creates stable oscillatory coexistence in the Hastings-Powell food chain model, produces interpretable epidemiological models, and provides a chaotic source for image encryption.

nlin.CD

The Spectral Skeleton of Chaos: Koopman Wave Packets on Poincar\'e Sections

A Poincar\'e section replaces a flow by a return map, but for a chaotic system this map is usually known only from sampled crossings. We show that coarse transport can be read directly from Koopman spectral data, without fitting the map. Measure-preserving EDMD retains the isometric structure; riggedDMD then approximates spectral measures and constructs finite regularized wave packets. Packet phase supplies a finite-resolution transport coordinate; low modulus marks a singular skeleton where the phase becomes ill-conditioned. We demonstrate the idea on the R\"ossler system, a 32-mode Kuramoto--Sivashinsky Galerkin system, and the forced Duffing oscillator. The packets yield coarse symbolic models on sections ranging from an almost one-dimensional curve to a visibly thick set. Their graphs organize observed low-period orbits and guide targeted searches for others. In Duffing Regime~II, a seven-region rule accounts for $91\%$--$94\%$ of filtered one-step transitions, while failures in the lowest retained modulus decile occur at $5.08$--$5.20$ times the overall rate. The packets are not Koopman eigenfunctions, nor are the regions exact Markov partitions. Together these computations show how spectral information beyond isolated eigenpairs can expose chaotic transport directly from trajectories.

nlin.CD