Asymptotic of the number of obstacles visited by the planar Lorentz process (Q1020613): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3934/dcds.2009.24.567 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021188148 / rank | |||
Normal rank | |||
Latest revision as of 02:30, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asymptotic of the number of obstacles visited by the planar Lorentz process |
scientific article |
Statements
Asymptotic of the number of obstacles visited by the planar Lorentz process (English)
0 references
29 May 2009
0 references
The process under consideration is the planar Lorentz one with a periodic configuration of strictly convex obstacles and with finite horizon. The author answers a question posed by Szász about the asymptotic behaviour of the number of visited cells. An estimate is obtained for the expectation as well as an almost sure convergence result.
0 references
planar Lorentz process
0 references
convex obstacles
0 references
billiards
0 references
asymptotic behaviour
0 references
