scholarly journals Nonequilibrium entropy, Lyapounov variables, and ergodic properties of classical systems

1978 ◽  
Vol 75 (4) ◽  
pp. 1627-1631 ◽  
Author(s):  
B. Misra
2020 ◽  
pp. 1-14
Author(s):  
SHOTA OSADA

Abstract We prove the Bernoulli property for determinantal point processes on $ \mathbb{R}^d $ with translation-invariant kernels. For the determinantal point processes on $ \mathbb{Z}^d $ with translation-invariant kernels, the Bernoulli property was proved by Lyons and Steif [Stationary determinantal processes: phase multiplicity, bernoullicity, and domination. Duke Math. J.120 (2003), 515–575] and Shirai and Takahashi [Random point fields associated with certain Fredholm determinants II: fermion shifts and their ergodic properties. Ann. Probab.31 (2003), 1533–1564]. We prove its continuum version. For this purpose, we also prove the Bernoulli property for the tree representations of the determinantal point processes.


2021 ◽  
Vol 182 (3) ◽  
Author(s):  
Christian B. Mendl ◽  
Folkmar Bornemann

AbstractThis work presents an efficient numerical method to evaluate the free energy density and associated thermodynamic quantities of (quasi) one-dimensional classical systems, by combining the transfer operator approach with a numerical discretization of integral kernels using quadrature rules. For analytic kernels, the technique exhibits exponential convergence in the number of quadrature points. As demonstration, we apply the method to a classical particle chain, to the semiclassical nonlinear Schrödinger (NLS) equation and to a classical system on a cylindrical lattice. A comparison with molecular dynamics simulations performed for the NLS model shows very good agreement.


1998 ◽  
Vol 181 (2) ◽  
pp. 245-282 ◽  
Author(s):  
Vojkan Jakšić ◽  
Claude-Alain Pillet

1997 ◽  
Vol 55 (6) ◽  
pp. 6384-6390 ◽  
Author(s):  
Roberto Artuso ◽  
Giulio Casati ◽  
Italo Guarneri

2000 ◽  
Vol 32 (01) ◽  
pp. 1-18 ◽  
Author(s):  
F. Baccelli ◽  
K. Tchoumatchenko ◽  
S. Zuyev

Consider the Delaunay graph and the Voronoi tessellation constructed with respect to a Poisson point process. The sequence of nuclei of the Voronoi cells that are crossed by a line defines a path on the Delaunay graph. We show that the evolution of this path is governed by a Markov chain. We study the ergodic properties of the chain and find its stationary distribution. As a corollary, we obtain the ratio of the mean path length to the Euclidean distance between the end points, and hence a bound for the mean asymptotic length of the shortest path. We apply these results to define a family of simple incremental algorithms for constructing short paths on the Delaunay graph and discuss potential applications to routeing in mobile communication networks.


Sign in / Sign up

Export Citation Format

Share Document