SearcharxivSearch

arXiv · 2010.03580

Propagation of minimality in the supercooled Stefan problem

Abstract

Supercooled Stefan problems describe the evolution of the boundary between the solid and liquid phases of a substance, where the liquid is assumed to be cooled below its freezing point. Following the methodology of Delarue, Nadtochiy and Shkolnikov, we construct solutions to the one-phase one-dimensional supercooled Stefan problem through a certain McKean-Vlasov equation, which allows to define global solutions even in the presence of blow-ups. Solutions to the McKean-Vlasov equation arise as mean-field limits of particle systems interacting through hitting times, which is important for systemic risk modeling. Our main contributions are: (i) we prove a general tightness theorem for the Skorokhod M1-topology which applies to processes that can be decomposed into a continuous and a monotone part. (ii) We prove propagation of chaos for a perturbed version of the particle system for general initial conditions. (iii) We prove a conjecture of Delarue, Nadtochiy and Shkolnikov, relating the solution concepts of so-called minimal and physical solutions, showing that minimal solutions of the McKean-Vlasov equation are physical whenever the initial condition is integrable.

Explore related subjects

Keep this discovery

BibTeXRIS

Christa Cuchiero, Stefan Rigger, Sara Svaluto-Ferro. 2020-10-07. Propagation of minimality in the supercooled Stefan problem. https://arxiv.org/abs/2010.03580

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