Search arXivSearch

arXiv · 2310.04833

A Stochastic Analysis of Particle Systems with Pairing

Abstract

Motivated by a general principle governing regulation mechanisms in biological cells, we investigate a general interaction scheme between different populations of particles and specific particles, referred to as agents. Assuming that each particle follows a random path in the medium, when a particle and an agent meet, they may bind and form a pair which has some specific functional properties. Such a pair is also subject to random events and it splits after some random amount of time. In a stochastic context, using a Markovian model for the vector of the number of paired particles, and by taking the total number of particles as a scaling parameter, we study the asymptotic behavior of the time evolution of the number of paired particles. Two scenarios are investigated: one with a large but fixed number of agents, and the other one, the dynamic case, when agents are created at a bounded rate and may die after some time when they are not paired. A first order limit theorem is established for the time evolution of the system in both cases. The proof of an averaging principle of the dynamic case is one of the main contributions of the paper. Limit theorems for fluctuations are obtained in the case of a fixed number agents. The impact of dynamical arrivals of agents on the level of pairing of the system is discussed.

Explore related subjects

Keep this discovery

BibTeXRIS

Vincent Fromion, Philippe Robert, Jana Zaherddine. 2023-10-07. A Stochastic Analysis of Particle Systems with Pairing. https://arxiv.org/abs/2310.04833

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