Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEntropy and chaos in the Kac model
265
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We investigate the behavior in $N$ of the $N$--particle entropy functional for Kacs stochastic model of Boltzmann dynamics, and its relation to the entropy function for solutions of Kacs one dimensional nonlinear model Boltzmann equation. We prove a number of results that bring together the notion of propagation of chaos, which Kac introduced in the context of this model, with the problem of estimating the rate of equilibration in the model in entropic terms, and obtain a bound showing that the entropic rate of convergence can be arbitrarily slow. Results proved here show that one can in fact use entropy production bounds in Kacs stochastic model to obtain entropic convergence bounds for his non linear model Boltzmann equation, though the problem of obtaining optimal lower bounds of this sort for the original Kac model remains open, and the upper bounds obtained here show that this problem is somewhat subtle.
rate research
Read More
We consider Kacs 1D N-particle system coupled to an ideal thermostat at temperature T, introduced by Bonetto, Loss, and Vaidyanathan in 2014. We obtain a propagation of chaos result for this system, with explicit and uniform-in-time rates of order N^(-1/3) in the 2-Wasserstein metric. We also show well-posedness and equilibration for the limit kinetic equation in the space of probability measures. The proofs use a coupling argument previously introduced by Cortez and Fontbona in 2016.
We prove for the rescaled convolution map $fto fcircledast f$ propagation of polynomial, exponential and gaussian localization. The gaussian localization is then used to prove an optimal bound on the rate of entropy production by this map. As an application we prove the convergence of the CLT to be at the optimal rate $1/sqrt{n}$ in the entropy (and $L^1$) sense, for distributions with finite 4th moment.
A rigorous proof is presented of the boundedness of the entanglement entropy of a block of spins for the ground state of the one-dimensional quantum Ising model with sufficiently strong transverse field. This is proved by a refinement of the arguments in the earlier work by the same authors (J. Statist. Phys. 131 (2008) 305-339). The proof is geometrical, and utilises a transformation to a model of classical probability called the continuum random-cluster model. Our method of proof is fairly robust, and applies also to certain disordered systems.
This is the second of two papers devoted to the proof of conformal invariance of the critical double random current and the XOR-Ising model on the square lattice. More precisely, we show the convergence of loop ensembles obtained by taking the cluster boundaries in the sum of two independent currents both with free or wired boundary conditions, and in the XOR-Ising models with free and plus/plus boundary conditions. Therefore we establish Wilsons conjecture on the XOR-Ising model. The strategy, which to the best of our knowledge is different from previous proofs of conformal invariance, is based on the characterization of the scaling limit of these loop ensembles as certain local sets of the continuum Gaussian Free Field. In this paper, we derive crossing properties of the discrete models required to prove this characterization.
Let $O(2n+ell)$ be the group of orthogonal matrices of size $left(2n+ellright)times left(2n+ellright)$ equipped with the probability distribution given by normalized Haar measure. We study the probability begin{equation*} p_{2n}^{left(ellright)} = mathbb{P}left[M_{2n} , mbox{has no real eigenvalues}right], end{equation*} where $M_{2n}$ is the $2ntimes 2n$ left top minor of a $(2n+ell)times(2n+ell)$ orthogonal matrix. We prove that this probability is given in terms of a determinant identity minus a weighted Hankel matrix of size $ntimes n$ that depends on the truncation parameter $ell$. For $ell=1$ the matrix coincides with the Hilbert matrix and we prove begin{equation*} p_{2n}^{left(1right)} sim n^{-3/8}, mbox{ when }n to infty. end{equation*} We also discuss connections of the above to the persistence probability for random Kac polynomials.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
