SearcharxivSearch

arXiv · 2409.20421

The supercooled Stefan problem with transport noise: weak solutions and blow-up

Abstract

We derive two weak formulations for the supercooled Stefan problem with transport noise on a half-line: one captures a continuously evolving system, while the other resolves blow-ups by allowing for jump discontinuities in the evolution of the temperature profile and the freezing front. For the first formulation, we establish a probabilistic representation in terms of a conditional McKean--Vlasov problem, and we then show that there is finite time blow-up with positive probability when part of the initial temperature profile is supercooled below a critical value. On the other hand, the system is shown to evolve continuously when the initial profile is everywhere above this value. In the presence of blow-ups, we show that the conditional McKean--Vlasov problem provides global solutions of the second weak formulation. Finally, we identify a solution of minimal temperature increase over time and we show that its discontinuities are characterised by a natural resolution of emerging instabilities with respect to an infinitesimal external heat transfer.

Explore related subjects

Keep this discovery

BibTeXRIS

Sean Ledger, Andreas Sojmark. 2024-09-30. The supercooled Stefan problem with transport noise: weak solutions and blow-up. https://arxiv.org/abs/2409.20421

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