SearcharxivSearch

arXiv · 2511.05223

Kac's Program and Relative Entropy Decay for Nonlinear Spin-Exchange Dynamics

Abstract

We introduce and analyze a nonlinear exchange dynamics for Ising spin systems with arbitrary interactions. The evolution is governed by a quadratic Boltzmann-type equation that conserves the mean magnetization. Collisions are encoded through a spin-exchange kernel chosen so that the dynamics converge to the Ising model with the prescribed interaction and mean magnetization profile determined by the initial state. We prove a general convergence theorem, valid for any interaction and any transport kernel. Moreover, we show that, for sufficiently weak interactions, the system relaxes exponentially fast to equilibrium in relative entropy, with optimal decay rate independent of the initial condition. The proof relies on establishing a strong version of the Kac program from kinetic theory. In particular, we show that the associated Kac particle system satisfies a modified logarithmic Sobolev inequality with constants uniform in the number of particles. This is achieved by adapting the method of stochastic localization to the present conservative setting.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pietro Caputo, Mario Morellini. 2025-11-07. Kac's Program and Relative Entropy Decay for Nonlinear Spin-Exchange Dynamics. https://arxiv.org/abs/2511.05223

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR