Searcharxiv⌕ Search

arXiv subjects

Gustavo Posta

Publications and source records attributed to Gustavo Posta.

17 recordsLinked to original sources
arXiv2025

Spectral Gap for the Stochastic Exchange Model

We prove a spectral gap inequality for the stochastic exchange model studied by Gaspard and Gilbert and by Grigo, Khanin and Sz\'asz in connection with understanding heat conduction in a deterministic billiards model. The bound on the spectral gap that we prove is uniform in the number of particles, as had been conjectured. We adapt techniques that were originally developed to prove spectral gap bounds for the Kac model with hard sphere collisions, which, like the stochastic exchange model, has degenerate jump rates.

math.PR↗
arXiv2024

Perturbative criteria for the ergodicity of interacting dissipative quantum lattice systems

We introduce a class of quantum Markov semigroups describing the evolution of interacting quantum lattice systems, specified either as generic qudits or as fermions. The corresponding generators, which include both conservative and dissipative evolutions, are given by the superposition of local generators in the Lindblad form. Under general conditions, we show that the associated infinite volume dynamics is well defined and can be obtained as the strong limit of the finite volume dynamics. By regarding the interacting evolution as a perturbation of a non-interacting dissipative dynamics, we further obtain a quantitative criterion that yields the ergodicity of the quantum Markov semigroup together with the exponential convergence of local observables. The analysis is based on suitable a priori bounds on the resolvent equation which yield quantitive estimates on the evolution of local observables.

math-ph↗
arXiv2022

Trace distance ergodicity for quantum Markov semigroups

We discuss the quantitative ergodicity of quantum Markov semigroups in terms of the trace distance from the stationary state, providing a general criterion based on the spectral decomposition of the Lindblad generator. We then apply this criterion to the bosonic and fermionic Ornstein-Uhlenbeck semigroups and to a family of quantum Markov semigroups parametrized by semisimple Lie algebras and their irreducible representations, in which the Lindblad generator is given by the adjoint action of the Casimir element.

math-ph↗
arXiv2020

Mixing time for the Repeated Balls into Bins dynamics

We estimate the mixing time of the a nonreversible finite Markov chain called Repeated Balls-into-Bins (RBB) process. This process is a discrete time conservative interacting particle system with parallel updates. Place initially in $L$ bins $rL$ balls, where $r$ is a fixed positive constant. At each time step a ball is taken from each non-empty bin. Then \emph{all the balls} are uniformly reassigned into bins. We prove that the mixing time of the RBB process depends linearly on the maximum occupation number of balls of the initial state. Thus if the initial configuration is such that the maximum occupation number of balls is of order $L$ then the mixing time is of the same correct order. While if the initial configuration is more diluted then the equilibrium is reached in a time of order $(\log L)^c$.

math.PR↗
arXiv2019

Propagation of chaos for a General Balls into Bins dynamics

Consider $N$ balls initially placed in $L$ bins. At each time step take a ball from each non-empty bin and \emph{randomly} reassign the balls into the bins.We call this finite Markov chain \emph{General Repeated Balls into Bins} process. It is a discrete time interacting particles system with parallel updates. Assuming a \emph{quantitative} chaotic condition on the reassignment rule we prove a \emph{quantitative} propagation of chaos for this model. We furthermore study some equilibrium properties of the limiting nonlinear process.

math.PR↗
arXiv2018

Propagation of Chaos for a Balls into Bins Model

Consider a finite number of balls initially placed in $L$ bins. At each time step a ball is taken from each non-empty bin. Then all the balls are uniformly reassigned into bins. This finite Markov chain is called Repeated Balls-into-Bins process and is a discrete time interacting particle system with parallel updating. We prove that, starting from a suitable (chaotic) set of initial states, as $L\to+\infty$, the numbers of balls in each bin becomes independent from the rest of the system i.e. we have propagation of chaos. We furthermore study some equilibrium properties of the limiting nonlinear process.

math.PR↗
arXiv2017

Boundary driven Brownian gas

We consider a gas of independent Brownian particles on a bounded interval in contact with two particle reservoirs at the endpoints. Due to the Brownian nature of the particles, infinitely many particles enter and leave the system in each time interval. Nonetheless, the dynamics can be constructed as a Markov process with continuous paths on a suitable space. If $\lambda_0$ and $\lambda_1$ are the chemical potentials of the boundary reservoirs, the stationary distribution (reversible if and only if $\lambda_0=\lambda_1$) is a Poisson point process with intensity given by the linear interpolation between $\lambda_0$ and $\lambda_1$. We then analyze the empirical flow that it is defined by counting, in a time interval $[0,t]$, the net number of particles crossing a given point $x$. In the stationary regime we identify its statistics and show that it is given, apart an $x$ dependent correction that is bounded for large $t$, by the difference of two independent Poisson processes with parameters $\lambda_0$ and $\lambda_1$.

math.PR↗
arXiv2015

Self-Stabilizing Repeated Balls-into-Bins

We study the following synchronous process that we call "repeated balls-into-bins". The process is started by assigning $n$ balls to $n$ bins in an arbitrary way. In every subsequent round, from each non-empty bin one ball is chosen according to some fixed strategy (random, FIFO, etc), and re-assigned to one of the $n$ bins uniformly at random. We define a configuration "legitimate" if its maximum load is $\mathcal{O}(\log n)$. We prove that, starting from any configuration, the process will converge to a legitimate configuration in linear time and then it will only take on legitimate configurations over a period of length bounded by any polynomial in $n$, with high probability (w.h.p.). This implies that the process is self-stabilizing and that every ball traverses all bins in $\mathcal{O}(n \log^2 n)$ rounds, w.h.p.

cs.DC↗
arXiv2014

Entropy decay for interacting systems via the Bochner--Bakry--Emery approach

We obtain estimates on the exponential rate of decay of the relative entropy from equilibrium for Markov processes with a non-local infinitesimal generator. We adapt some of the ideas coming from the Bakry-Emery approach to this setting. In particular, we obtain volume-independent lower bounds for the Glauber dynamics of interacting point particles and for various classes of hardcore models.

math.PR↗
arXiv2012

Scaling and multiscaling in financial series: a simple model

We propose a simple stochastic volatility model which is analytically tractable, very easy to simulate and which captures some relevant stylized facts of financial assets, including scaling properties. In particular, the model displays a crossover in the log-return distribution from power-law tails (small time) to a Gaussian behavior (large time), slow decay in the volatility autocorrelation and multiscaling of moments. Despite its few parameters, the model is able to fit several key features of the time series of financial indexes, such as the Dow Jones Industrial Average, with a remarkable accuracy.

q-fin.ST↗
arXiv2007

Convex Entropy Decay via the Bochner-Bakry-Emery approach

We develop a method, based on a Bochner-type identity, to obtain estimates on the exponential rate of decay of the relative entropy from equilibrium of Markov processes in discrete settings. When this method applies the relative entropy decays in a convex way. The method is shown to be rather powerful when applied to a class of birth and death processes. We then consider other examples, including inhomogeneous zero-range processes and Bernoulli-Laplace models. For these two models, known results were limited to the homogeneous case, and obtained via the martingale approach, whose applicability to inhomogeneous models is still unclear.

math.PR↗
arXiv2007

Ecological equilibrium for restrained branching random walks

We study a generalized branching random walk where particles breed at a rate which depends on the number of neighboring particles. Under general assumptions on the breeding rates we prove the existence of a phase where the population survives without exploding. We construct a nontrivial invariant measure for this case.

math.PR↗
arXiv2006

Entropy dissipation estimates in a Zero-Range dynamics

We study the exponential decay of relative entropy functionals for zero-range processes on the complete graph. For the standard model with rates increasing at infinity we prove entropy dissipation estimates, uniformly over the number of particles and the number of vertices.

math.PR↗
arXiv2005

Spectral gap estimates for interacting particle systems via a Bochner-type identity

We develop a general technique, based on a Bochner-type identity, to estimate spectral gaps of a class of Markov operator. We apply this technique to various interacting particle systems. In particular, we give a simple and short proof of the diffusive scaling of the spectral gap of the Kawasaki model at high temperature. Similar results are derived for Kawasaki-type dynamics in the lattice without exclusion, and in the continuum. New estimates for Glauber-type dynamics are also obtained.

math.PR↗
arXiv2005

Equilibrium Fluctuations for a One-Dimensional Interface in the Solid on Solid Approximation

An unbounded one-dimensional solid-on-solid model with integer heights is studied. Unbounded here means that there is no a priori restrictions on the discret e gradient of the interface. The interaction Hamiltonian of the interface is given by a finite range part, pr oportional to the sum of height differences, plus a part of exponentially decaying long range potentials. The evolution of the interface is a reversible Markov process. We prove that if this system is started in the center of a box of size L after a time of order L^3 it reaches, with a very large probability, the top or the bottom of the box.

math.PR↗