SearcharxivSearch

arXiv · 1801.07703

A McKean--Vlasov equation with positive feedback and blow-ups

Abstract

We study a McKean--Vlasov equation arising from a mean-field model of a particle system with positive feedback. As particles hit a barrier they cause the other particles to jump in the direction of the barrier and this feedback mechanism leads to the possibility that the system can exhibit contagious blow-ups. Using a fixed-point argument we construct a differentiable solution up to a first explosion time. Our main contribution is a proof of uniqueness in the class of c\`{a}dl\`{a}g functions, which confirms the validity of related propagation-of-chaos results in the literature. We extend the allowed initial conditions to include densities with any power law decay at the boundary, and connect the exponent of decay with the growth exponent of the solution in small time in a precise way. This takes us asymptotically close to the control on initial conditions required for a global solution theory. A novel minimality result and trapping technique are introduced to prove uniqueness.

Explore related subjects

Keep this discovery

BibTeXRIS

Ben Hambly, Sean Ledger, Andreas Sojmark. 2018-01-23. A McKean--Vlasov equation with positive feedback and blow-ups. https://arxiv.org/abs/1801.07703

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