<?xml-model href='http://www.tei-c.org/release/xml/tei/custom/schema/relaxng/tei_all.rng' schematypens='http://relaxng.org/ns/structure/1.0'?><TEI xmlns="http://www.tei-c.org/ns/1.0">
	<teiHeader>
		<fileDesc>
			<titleStmt><title level='a'>Counting the number of stationary solutions of partial differential equations via infinite dimensional sampling</title></titleStmt>
			<publicationStmt>
				<publisher>Royal Society Publishing</publisher>
				<date>06/05/2025</date>
			</publicationStmt>
			<sourceDesc>
				<bibl> 
					<idno type="par_id">10643428</idno>
					<idno type="doi">10.1098/rsta.2024.0239</idno>
					<title level='j'>Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences</title>
<idno>1364-503X</idno>
<biblScope unit="volume">383</biblScope>
<biblScope unit="issue">2298</biblScope>					

					<author>Martin Kolodziejczyk</author><author>Michela Ottobre</author><author>Gideon Simpson</author>
				</bibl>
			</sourceDesc>
		</fileDesc>
		<profileDesc>
			<abstract><ab><![CDATA[<p>This paper is concerned with the problem of counting solutions of stationary nonlinear Partial Differential Equations (PDEs) when the PDE is known to admit more than one solution. We suggest tackling the problem via a sampling-based approach. The method allows one to find solutions that are stable, in the sense that they are stable equilibria of the associated time-dependent PDE. We test our proposed methodology on the McKean–Vlasov PDE, more precisely on the problem of determining the number of stationary solutions of the McKean–Vlasov equation.</p> <p>This article is part of the theme issue ‘Partial differential equations in data science’.</p>]]></ab></abstract>
		</profileDesc>
	</teiHeader>
	<text><body xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink">
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Within the field of Partial Differential Equations (PDEs), a large body of literature is concerned with investigating well-posedness of PDEs. That is, with studying the existence and uniqueness of solutions, in appropriate spaces. It is however the case that many nonlinear PDEs of pivotal importance in applications admit more than one solution. This paper is devoted to the problem of determining the number of solutions of stationary nonlinear PDEs (and then possibly finding properties of such solutions), i.e. solving problems of the form</p><p>where &#8466; is a suitable (nonlinear) operator acting on a given function space. Studying the set of solutions of</p><p>royalsocietypublishing.org/journal/rsta Phil. Trans. R. Soc. A 383: 20240239 ......................................................................................................................... (1.1) is central in at least three broad contexts. First, solutions of (1.1) are candidate equilibria of the associated time-dependent PDE, &#120597; t u = &#8466;u . (1.2)</p><p>This is relevant for both deterministic and stochastic problems. Indeed, when &#8466; is the Fokker-Planck operator associated with a given Stochastic (ordinary) Differential Equation (SDE), the solutions of (1.1) are the invariant measures of the SDE. Second, at least when the solutions of (1.1) are stable-in the sense that they are stable equilibria of (1.2)-one expects them to correspond to metastable states of the associated Stochastic Partial Differential Equation (SPDE), i.e. of the evolution</p><p>where &#120598; &gt; 0 is a small parameter and &#120578; is spatio-temporal noise. Finally, if the problem has a variational structure, solutions of (1.1) are related to extrema of associated functionals, often referred to as energy functionals or potentials. Hence the connection with the many applications of interest in calculus of variations and with energy landscape exploration problems. Many problems in both natural and applied sciences can be recast as one of (1.1), (1.2) and <ref type="bibr">(1.3)</ref>. Let us give some examples. Stochastic processes with multiple invariant measures naturally arise in the study of interacting particle systems and associated mean field limits. Such systems are paradigmatic models in statistical mechanics and kinetic theory, in connection with the study of phase transitions, as well as in the study of collective navigation and consensus formation <ref type="bibr">[1,</ref><ref type="bibr">2]</ref>. The importance of understanding processes with multiple invariant measures cannot be understated. Indeed, while statistical sampling has been one of the main motivations for the study of processes with one invariant measure-ergodic processes-many processes in natural and engineered systems are likely to exhibit multiple invariant measures. This includes the tendency of fireflies to synchronize their flashing or not, the microstructure of nematic crystals aligning to several distinct equilibrium configurations (giving rise to different material properties), the opinion formation process in social media, which can converge towards various possible outcomes, etc. <ref type="bibr">[3]</ref><ref type="bibr">[4]</ref><ref type="bibr">[5]</ref><ref type="bibr">[6]</ref><ref type="bibr">[7]</ref><ref type="bibr">[8]</ref>.</p><p>Related to problems of the form (1.3), metastability theory and landscape exploration are central to molecular dynamics, computational chemistry and condensed matter physics, particularly for the calculation of reaction rates. Indeed, a large number of methods have been proposed to understand transitions between metastable states, including the string method in finite <ref type="bibr">[9]</ref> and infinite dimensions <ref type="bibr">[10]</ref>, the nudged elastic band method <ref type="bibr">[11]</ref>, surface walking approaches such as the dimer method, the gentlest ascent dynamics <ref type="bibr">[12]</ref>, the activation-relaxation technique, and more. All such methods require some prior knowledge of the metastable states (so that one can e.g. 'initialize the string'), which are a subset of the solutions of stationary problems like <ref type="bibr">(1.1)</ref>.</p><p>Despite the pervasiveness of PDEs with multiple solutions, the methods available to find all such solutions are very limited. To the best of our knowledge, aside from the brute force approach of starting the Newton algorithm from a large number of different initial points, there are few systematic strategies that work in full generality. The available tools include deflation <ref type="bibr">[13]</ref> (which only requires pre-knowledge of one solution and can find any stationary solution, irrespective of its stability), continuation and homotopy-continuation <ref type="bibr">[14]</ref> (which have similar requirements). These approaches are all numerical or computational as, except for rare cases, one does not expect to be able to find solutions analytically <ref type="foot">1</ref> . We mention also so-called 'landscape exploration methods' such as the eigenvector-following method <ref type="bibr">[16]</ref> and minimax approaches <ref type="bibr">[17]</ref> to find saddle points, which are also relevant to the study of reaction rates. However, these approaches mostly apply to finite dimensional landscapes.</p><p>We emphasize that the complexity of the problems that arise in this context is high; examples are illustrated in the works <ref type="bibr">[18,</ref><ref type="bibr">19]</ref> concerning the study of nematic crystals (different solutions of the associated stationary PDE problem here correspond to distinct equilibrium configurations of the crystal), in the setting of de Gennes theory. In <ref type="bibr">[19]</ref>, 28 solutions were found for the problem considered there, with no guarantee that all had been found. For semi-linear Schr&#246;dinger equations, there are (at least) countably many soliton type solutions, even after accounting for symmetries <ref type="bibr">[20,</ref><ref type="bibr">21]</ref>.</p><p>There are two challenges to determining the set of solutions to (1.1): determining the number of solutions and then finding the solutions themselves (or at least some properties of such solutions). These challenges should be regarded as distinct. Deflation is a very powerful method, proven useful in many settings. But even by deflation one cannot guarantee all solutions have been found. This limitation is true of all the other methods we have mentioned, and it will certainly be true, also, of the method we propose in this paper. Thus, it is pragmatic to have at one's disposal an array of methods and to exploit synergies between them, to make progress on the specific problem at hand. For example, if by deflation one has found n solutions but some 'solution counting method' reveals that we should expect at least say n + 2 then one can redouble the search. Knowledge of such solutions can, in turn, provide the basis to use paradigms such as e.g. the string method, which requires pre-knowledge of the metastable states (to initialize the string).</p><p>This paper attempts to put forward an approach to address the problem of counting the number of (stable) solutions of a given stationary PDE of the form (1.1). The purpose of this short paper is to present the main idea of this approach though it is undoubtedly the case that further investigation and (non-trivial) analysis will be needed in order to understand its strengths and limitations. We comment on this in &#167;1a below, &#167;2 and at various points throughout.</p><p>The paper is organized as follows: in &#167;1a we present our method and then, in subsequent sections, we apply this method to find the number of stable stationary solutions of the McKean-Vlasov (or porous media) equation. Such stationary solutions correspond to invariant measures of stochastic processes that are nonlinear in the sense of McKean. We do this both for parameter regimes where the number of solutions is, a priori, known and also in settings where the issue of finding the number of solutions is yet to be settled. In &#167;2, we provide background material on the McKean-Vlasov PDE and on the associated McKean-Vlasov SPDE; the latter will be the central tool we employ to find the number of stable solutions of the stationary McKean-Vlasov PDE. Section 2 also serves the purpose of illustrating how determining the number of stationary solutions of a given PDE can be rather non-trivial, even in simple situations. Sections 3 and 4 are devoted to numerical and simulation aspects, respectively (more detail below).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>(a) Our approach</head><p>We propose that in order to count the number of stable solutions of the stationary problem (1.1) one can sample from the invariant measure (assuming it exists and is unique) of the SPDE obtained by perturbing the time-dependent problem (1.2) by additive noise; that is, one can sample from the invariant measure of the SPDE</p><p>where &#120578; is a suitable space-time noise. At least in the case in which the solutions of (1.1) are isolated, we expect the number of modes of the invariant measure of (1.4) to coincide with the number of stable solutions of (1.1) and the number of stable equilibria of (1.2). Further, we expect a correspondence between the metastable states of (1.4), the modes, and the stable stationary solutions of (</p><p>1.1) and (1.2). The noise &#120578; must be appropriately chosen not only to make sure that (1.4) is well posed and has a unique invariant measure, but also to, potentially, satisfy other constraints royalsocietypublishing.org/journal/rsta Phil. Trans. R. Soc. A 383: 20240239 ......................................................................................................................... (a) (b) Figure 1. (a and b) A simple scalar multi-well potential, U, and the associated trajectory of (1.5). As expected, the trajectory tends to persist near one of the two minima. specific to the problem under consideration, see &#167;2 for more detail on this point<ref type="foot">foot_4</ref> . Intuitively, if the noise &#120578; is strong enough we would expect (1.4) to have at most one invariant measure.</p><p>Let us explain the rationale of the approach in a simpler, finite dimensional setting. Consider one-dimensional Langevin dynamics in multi-well potential:</p><p>where Y t &#8712; &#8477;, U &#8758; &#8477; &#8594; &#8477; is a confining potential, &#120572; &gt; 0 and &#120573; t is one dimensional standard Brownian motion. Under very general assumptions on U, as soon as &#120572; &gt; 0, the SDE (1.5) has only one invariant measure, the Maxwellian e -2U&#8725;&#120572; (after choosing U to include the correct normalization constant, which can always be done). By contrast, when &#120572; = 0 this equation is a simple ODE with as many stable stationary states as the number of minima (wells) of the potential U (assuming such minima are isolated). Dirac measures centred around such stationary states can be viewed as the (multiple) stable invariant measures of the ODE. For a double well potential, one has three stationary states, two stable and one unstable. When U has many wells, a naive way to count them is to simulate (1.5) for long enough and count the number of modes of the measure e -2U&#8725;&#120572; , as this measure will concentrate around the minima of U. This is shown in figure <ref type="figure">1</ref>. This approach comes with limitations. First and foremost, one never knows if the whole state space has been adequately sampled; hence there are no guarantees that all the minima of U have been found. This problem is unavoidable, whether in finite or infinite dimensions, and irrespective of the method used to sample. The potential landscape might also be more complex with non-isolated minima, elusive saddle points, etc. All these problems persist in the infinite dimensional setting. This is why we propose this method to be used in conjunction with other methods, as an aid for exploration. We also emphasize, again, that the method we propose will only help count the number of stable solutions of (1.1), in the sense that they are stable in (1.2). It will be far less informative about unstable solutions.</p><p>Analogously with the finite dimensional case, one might see the idea of using the SPDE (1.4) as a landscape exploration method, especially if the deterministic part of the equation has some gradient structure. Some comments on this-and words of caution-can be found in Note 2.1.</p><p>While infinite dimensional Markov Chain Monte Carlo (MCMC) sampling algorithms are now well-developed for many problems of interest, one might not know the invariant measure of (1.4) explicitly, making the use of MCMC algorithms impractical. The option-which we take in the example of this paper-is to simulate the SPDE for a sufficiently long time. Despite all the caveats that we have highlighted, this approach is simple to understand and general, in the sense that, since it relies on a concept that does not hinge on the specific structure of the equation at hand, it can be also applied to equations different from our test case. More comments on this in &#167;2. In the next section, we provide an illustration of its effectiveness in the context of the search of stationary solutions of porous media equations.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Background on the McKean-Vlasov PDE and associated SPDE</head><p>As a test case, we consider the problem of finding the number of stationary solutions of the McKean-Vlasov PDE,</p><p>for the unknown &#120588; = &#120588;(t, x) &#8758; &#8477; + &#215; &#120139; &#8594; &#8477;, where &#120139; denotes the one-dimensional torus given by the interval [0, 2&#120587;] with periodic boundary conditions <ref type="foot">3</ref> . That is, we want to find the stable solutions of the problem (1.1) when the operator &#8466; is the nonlinear differential operator given by the righthand side of (2.1), which we henceforth refer to as the McKean-Vlasov differential V, F &#8758; &#120139; &#8594; &#8477; are given functions, commonly referred to as the environmental and inter-particle potential, respectively, &#8242; denotes derivative with respect to the argument of the function and * denotes convolution. Let us briefly recap what is known about the evolution (2.1).</p><p>The PDE (2.1) is a popular and flexible model in a range of applications and has been studied for decades. It models the evolution of the density of a system of interacting particles. More precisely it is associated to the following interacting particle system</p><p>where, for every i = 1 &#8230; N, X i,N t &#8712; &#120139; is the position of the i-th particle at time t &#8805; 0. Using mean field techniques <ref type="bibr">[2]</ref> one can show that the empirical measure</p><p>of the system converges, as N tends to infinity, to a deterministic probability measure. Such a measure has a density, which is precisely the solution &#120588; of the PDE (2.1). The PDE (2.1) can also be viewed as the Fokker-Planck equation of the following nonlinear SDE</p><p>In the above &#120588; t is the density of the law of X t -so that the SDE is nonlinear in the sense of McKean-and, by It&#244;'s formula, one can see that &#120588; t solves (2.1). Hence the stationary solutions of (2.1) are the invariant measures of (2.3). A key fact to observe is that the evolution equation (2.1) preserves mass and positivity; that is, &#8747; &#120139; &#120588; t (x)dx is a constant, independent of time, and &#120588; 0 &#8805; 0 implies &#120588; t &#8805; 0. This is coherent with the probabilistic interpretation of the PDE. The problem of determining the set of stationary solutions of (2.1) is far from trivial, even when the spatial variable is one-dimensional. Following the seminal paper <ref type="bibr">[1]</ref>, this problem has been tackled in a variety of settings <ref type="bibr">[3,</ref><ref type="bibr">[22]</ref><ref type="bibr">[23]</ref><ref type="bibr">[24]</ref><ref type="bibr">[25]</ref>. In particular, the number of stationary solutions of (2.1) depends on the choice of potentials V and F and on the strength of the noise. Here, to fix ideas, we consider the case where V and F are given by</p><p>(2.4)</p><p>The relevant properties of this choice are that V is non-convex (more specifically, double well and symmetric) and F introduces an attractive force between particles. One can show that with this choice of V and F, there exists a critical value of the noise, &#120590; c &gt; 0, such that if &#120590; &gt; &#120590; c equation (</p><p>2.1) admits exactly one stationary solution, &#120588; 0 , which is bimodal and equally concentrated around the bottom of two wells. The two wells have minima at x 1 = &#120587;&#8725;2 and x 2 = 3&#120587;&#8725;2. For 1&#8725;2 &lt; &#120590; &lt; &#120590; c and royalsocietypublishing.org/journal/rsta Phil. Trans. R. Soc. A 383: 20240239 .........................................................................................................................</p><p>for &#120590; small enough there are exactly three stationary solutions of (2.1)-the conjecture being that for any 0 &lt; &#120590; &#8804; &#120590; c there should be three stationary solutions. One is &#120588; 0 itself; the other two, &#120588; &#177; , are still bimodal with modes around x 1 and x 2 but &#120588; + concentrates most of the mass in x 1 while &#120588; -concentrates most of its mass around x 2 . The reader may find intuition for this property in, among other references, <ref type="bibr">[26]</ref>. Here we briefly recall (as it will be relevant to &#167;4 and for later comments) that this result is obtained by first observing that, irrespective of the choice of V and F, any stationary solution &#120588; &#8734; of (2.1) solves the following fixed point problem</p><p>.</p><p>(2.5)</p><p>Once V and F are chosen as in (2.4), the above, a priori, infinite dimensional fixed point problem, can be reduced to a finite-dimensional, two-parameter fixed point problem. One can indeed observe (see <ref type="bibr">[26, &#167;2]</ref>) that in this case &#120588; &#8734; solves (2.5) if and only if it has the following structure</p><p>where m 1 , m 2 &#8712; &#8477; are fixed points of the following equations</p><p>respectively. To recap, when &#8466; is the McKean-Vlasov differential operator, solving (1.1) corresponds to solving the fixed point problem (2.5). The results we have summarized above on the number of stationary states of the McKean-Vlasov PDE are obtained by using this strategy. More comments on this in Note 2.1. We note in passing that the fact that the PDE (2.1) can admit several stationary solutions is in contrast to the behaviour of the particle system (2.2), which, irrespective of the strength of the noise &#120590; &gt; 0, always admits just one invariant measure (although clearly this invariant measure is made of multiple metastable states). So the particle system is not necessarily helpful to our goals (see Note 2.1).</p><p>While (2.1) has many stationary states, it is natural to imagine that, after adding a strongenough noise to (2.1), we will obtain an SPDE with a unique invariant measure (this invariant measure is a measure on the space of measures). Technical details aside, this turns out to be the case. Indeed, consider the SPDE</p><p>where W t is cylindrical Wiener noise and Q is a trace class operator, so that</p><p>and the w k t 's are independent one-dimensional standard Brownian motions, {e k } k is a basis of L 2 (&#120139;; &#8477;) (in which Q is assumed to diagonalize) and {&#120582; 2 k } k&#8712;&#8469; is the sequence of non-negative eigenvalues of Q. We will assume that the eigenvalues of Q are of the form</p><p>for some &#120574; &gt; 0 and s &gt; 1&#8725;2. Well-posedness and ergodicity of the SPDE (2.8) have been studied in <ref type="bibr">[26]</ref>. Using the results of <ref type="bibr">[26]</ref> one can easily see that with the above choice of Q, the SPDE (2.8)</p><p>, while it is strong Feller and irreducible, respectively, for</p><p>, respectively. This implies that for 1&#8725;2 &lt; s &lt; 1 the SPDE admits at most one invariant measure. Whether such an invariant measure exists or not is still an open problem, but we believe it to be the case. We proceed by assuming (2.8) admits a unique invariant measure, at least under (2.10). Our simulations in &#167;4 will, as a by-product, support this conjecture.</p><p>To our purposes, a more pressing issue is the fact that the SPDE (2.8) does not preserve mass in general and it does not preserve positivity either. This means that sampling from the invariant measure of (2.8) may also result in exploring parts of state space in which we are not interested, as we only want stationary solutions of (2.1) that have mass one and are non-negative. The choice &#120582; 0 = 0 in (2.10) has been made to remedy this issue and guarantee mass conservation-by formally integrating the equation in space and using the fact that &#8747; e k (x) dx = 0 for every k &#8805; 1 one can see that, if &#120582; 0 = 0, then the quantity &#8747; u t (x) dx is constant in time. As for the positivity, a straightforward calculation shows that stationary solutions of (2.1) with mass one are always non-negative <ref type="foot">4</ref> . Therefore, once condition (2.10) is enforced, we expect the solution of (2.8) to concentrate only around the desired (stable) stationary solutions of (2.1), i.e. those that have mass one and are hence positive.</p><p>To the best of our knowledge, when 0 &lt; &#120590; &lt; &#120590; c , there are no results on the global stability of the three stationary states of (2.1) (with V and F as in (2.4))-though some partial results in this direction have been obtained in <ref type="bibr">[27]</ref> and later in <ref type="bibr">[28]</ref>. When 0 &lt; &#120590; &lt; &#120590; c one expects that two of the equilibria (&#120588; &#177; ) will be stable and one unstable (&#120588; 0 ). In appendix A, we numerically show that this is indeed the case. Hence, when sampling from the invariant measure of (2.8), we expect to see bimodal behaviour in our measure. This is confirmed by the simulations of &#167;4; more detail is provided in that section. In general the linearly unstable solutions may be akin to saddle points; they will be challenging to see directly in the simulation of (2.8), but may be critical to understanding transition rates among metastable solutions.</p><p>An explicit form for the invariant measure of (2.8) is not known. This precludes the use of many MCMC sampling strategies as they often depend on evaluating the (unnormalized) invariant density in a Metropolis ratio. Moreover, since we are looking to sample from a measure supported on an infinite dimensional space, it would be advisable to use an MCMC method that is well posed in infinite dimension <ref type="bibr">[29]</ref><ref type="bibr">[30]</ref><ref type="bibr">[31]</ref>. But, again, we do not know of any MCMC method that is well posed in infinite dimension and that can be implemented in absence of information on the analytical form of the target measure <ref type="bibr">[29,</ref><ref type="bibr">32,</ref><ref type="bibr">33]</ref>.</p><p>We therefore take the approach of simulating the SPDE (2.8) for sufficiently long. As the simulation of this SPDE needs care, we present in &#167;3 a numerical scheme that is used for its study. We reserve for future work the proof of the convergence of this numerical scheme. Note 2.1. Some further comments on the SPDE (2.8) and its simulation.</p><p>-The SPDE (2.8) can be obtained as a limit of an appropriate (weighted) interacting particle system. This has been proved in <ref type="bibr">[34]</ref>. Such a particle system could be used as a way of simulating the SPDE. However, similarly to what happens for the particle system (2.2) and its limiting PDE (2.1), it may be the case that the ergodic properties of the SPDE (2.8) are different from those of the associated particle system. Indeed, the work <ref type="bibr">[34]</ref> proves that the particle system converges to the SPDE over finite time horizons, but there is a priori no reason to believe that convergence will hold uniformly in time, i.e. over infinite time horizons. This is why we opted to simulate the SPDE with a numerical discretization scheme. -As we mentioned at the end of &#167;2a, the deterministic part of the evolution (2.8) is in gradient form (see <ref type="bibr">[3]</ref>). So one would expect, in analogy to the finite dimensional setting discussed around equation <ref type="bibr">(1.5)</ref>, that the approach we take here could be interpreted as a landscape exploration method. Heuristically this is perhaps the case. However, there is a subtlety to this point. As we mentioned, there are no rigorous results on the existence</p><p>royalsocietypublishing.org/journal/rsta Phil. Trans. R. Soc. A 383: 20240239 .........................................................................................................................</p><p>of the invariant measure of (2.8). In particular, we do not know if such a measure is of Maxwellian type, and this may be challenging, in view of recent observations <ref type="bibr">[35]</ref>. Interpreting the method we consider here as an infinite dimensional landscape exploration method hinges on making progress on this aspect of the theory. Nonetheless, whether the invariant measure is of Maxwellian type or not, one still expects that such a measure will concentrate around the stable stationary solutions of the McKean-Vlasov PDE (as confirmed by our simulations), and this is all we truly need. -Still, on the matter of potentially using particle systems to solve the problem of interest, it should be noted that the particle system (2.2) has, for each fixed N, a unique invariant measure. Such an invariant measure is metastable and the number of metastable states of this measure coincides with the number of stable stationary states of (2.1) <ref type="bibr">[36]</ref>-and it is expected to be the same as the number of metastable states of the invariant measure of the SPDE (2.8). However the exit time from a potential well for the particle system (2.2) grows exponentially with N <ref type="bibr">[36,</ref><ref type="bibr">37]</ref>, making this approach computationally impractical (if not infeasible), especially in the presence of many wells. By contrast, using the metastability of the SPDE (2.8) is computationally much faster. -Reducing the infinite dimensional fixed point problem (2.5) to a finite dimensional one is only practical when V and F are sufficiently simple. If V and F allow for this drastic reduction in dimensionality (with our choices of potentials this is due to the fact that such potentials are each given by a single Fourier mode), then it is usually possible to solve, numerically, the resulting finite dimensional fixed point problem. For us, this is problem (2.7). However, even in these simple cases, the analytical study of the finite dimensional fixed point problem is challenging, and it tends to offer only partial results (as for the case we have detailed above). See <ref type="bibr">[26]</ref>, references therein and the list of references at the start of this section.</p><p>Even slightly complicating potentials V and F makes the reduction of the infinite dimensional fixed point problem to a finite dimensional one substantially more difficult. Should it succeed, the numerical and analytical study, respectively, of the resulting finite dimensional problem becomes tricky and prohibitive to pursue. In &#167;4, we choose V and F as in <ref type="bibr">(2.4)</ref>; this provides a good test case, as the number of stable stationary states is known in this case (modulo the comments we made above). However, applying our method is not needed in this relatively simple case. We expect our method will be more useful in more complex situations-including complex choices of V and F or, more so, when the PDE part of the evolution is not of McKean-Vlasov type. Indeed, if the PDE part of the evolution is not of McKean-Vlasov type then it is not necessarily the case that the problem (1.1) can be reduced to some form of fixed point equation. In such instances, the method we have presented allows for greater flexibility. An interesting avenue could be the one of using the method we present here for different nonlinear PDEs (using the associated SPDEs), such as Allen-Cahn type equations, Navier-stokes and equations appearing in nonlinear elasticity, such as those in <ref type="bibr">[19]</ref>. This will however require new theoretical efforts in the ergodic theory for SPDEs.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Numerical methods</head><p>Here, we review our computational methods for exploring (2.8).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>(a) Discretization of the SPDE</head><p>To generate sample paths of (2.8), we employ a spectral Galerkin spatial discretization together with Euler-Maruyama time stepping. We refer the reader to, for instance, <ref type="bibr">[38]</ref>. Denoting the total number of resolved Fourier modes J, and using complex trigonometric functions, we will achieve spectral accuracy with O(J ln J) scaling through the Fast Fourier Transform (FFT). Euler-Maruyama time stepping for this problem (having only additive noise) will yield a strong error of O(&#8710;t) in the sample paths. This strategy is entirely standard, and though we do not provide a full numerical analysis of it in the present work, our numerical tests are consistent with what would be expected from this method. We defer such numerical tests to &#167;4b. We expect that a complete analysis of the numerical scheme we present here should be accessible and we hope to pursue this in future work.</p><p>While our example computations will be for the case that F and V are given by (2.4), these methods are expected to work for all sufficiently regular V and F.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>(i) Space discretization: spectral Galerkin method</head><p>The fundamental assumption is that the covariance, Q, of the noise process in (2.8) diagonalizes against the complex trigonometric functions on the &#120139; = [0, 2&#120587;)</p><p>This allows us to express the noise as (2.9). We now represent the solution, u, of (2.8) by</p><p>Substituting in and projecting onto e k , (2.8) becomes</p><p>Symbols &#8497; and &#8497; -1 denote the Fourier transform and its inverse; in software, these are carried out by the FFT algorithm. The above notation is to emphasize that V &#8242; &#8901; u is computed in real space, while F &#8242; * u is first computed in Fourier space, and then (F &#8242; * u) &#8901; u is computed in real space. Using an integrating factor on the linear term, we can write the mild solution (in Fourier coordinates) as &#251;k (t) = e -&#120590;k 2 t &#251;k (0)</p><p>Thus far, we have only formally manipulated (2.8); no approximation has been made. We now truncate to J (assumed to be even) modes, so that</p><p>and let P (J) be the projection onto the J lowest modes. Substituting (3.5) into <ref type="bibr">(3.4)</ref> and applying this projection we obtain our finite dimensional system:</p><p>As is sufficient for problems with a quadratic nonlinearity, the projection operator can be implemented in code by:</p><p>-Simulating with 2J modes, if we wish to resolve J of them; -Zeroing out the J highest frequency modes.</p><p>This corresponds to anti-aliasing, <ref type="bibr">[39]</ref>.</p><p>Downloaded from <ref type="url">https://royalsocietypublishing.org/</ref> on 18 October 2025 royalsocietypublishing.org/journal/rsta Phil. Trans. R. Soc. A 383: 20240239 ......................................................................................................................... x. On the vertical axis of each graph there is time t while on the horizontal axis lies the spatial variable x. The colour bar is common across the three plots. These plots have been obtained by employing CairoMakie <ref type="bibr">[40]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>(ii) Time discretization: Euler-Maruyama</head><p>The fully discretized problem is obtained via an Euler-Maruyama temporal discretization of (3.6). Hence, on top of the spatial approximation, we make the temporal approximation</p><p>with t n = n&#8710;t. After a bit of stochastic calculus on the noise term, the update is</p><p>2 &#8710;t 2&#120590;k 2 &#120585; k,n+1 , &#120585; k,n+1 i.i.d. &#8764; N(0, 1). (3.8) 4. Simulations (a) Computed stationary solutions We now use the numerical discretization method presented in &#167;3 to simulate the dynamics (2.8) for long times. When the stationary solutions of (2.1) are isolated, we expect the process {u t } t&#8805;0 solution of (2.8) to exhibit metastable behaviour, hopping between different stable stationary solution of (2.1). To observe this fact numerically, we show a heat plot of the solution u t , see figure 2; moreover, inspired by (2.7), we consider the quantities royalsocietypublishing.org/journal/rsta Phil. Trans. R. Soc. A 383: 20240239 ......................................................................................................................... u t (x) sin x dx for the solution u t to (2.8) with &#120590; = 0.2, 0.6 and 1. These simulations are run with the same parameters as in figure 2. When V, F are as in (2.4) and &#120590; is either small enough or 1&#8725;2 &lt; &#120590; &lt; &#120590; c , we know that (2.1) has two stable stationary states, &#120588; &#177; . Such stable states correspond to the values of (m 1 , m 2 ) given by the points (&#177;1, 0) (for detail see <ref type="bibr">[26]</ref>). We expect I 1 (t) to be metastable around the values of m 1 = &#177;1 and m 2 to fluctuate around the origin. This is consistent with figures 3 and 4, respectively. When &#120590; &gt; &#120590; c , which is the case for the right-most plot in figure <ref type="figure">2</ref>, we know that (2.1) has a unique stationary solution, which we expect to be bimodal and equally concentrated around the two minima. This is confirmed by the simulation. The value of &#120574; = 10 -2 used in these experiments was found empirically. As we had some foreknowledge of the stationary solutions in the system, we found this value to be a sufficiently small value such that these solutions were metastable on the timescale of the simulation. It is possible that we may miss solutions should this noise level be too large.</p><p>Let us now make a further remark about figure <ref type="figure">2</ref>. The left (&#120590; = 0.2) and right (&#120590; = 1) panels in that figure are consistent with our expectations. Since the value &#120590; = 0.6 is also below the critical threshold, we would have expected to see metastability also in the panel in the middle. That is, we would have expected the central panel to look a bit more like the one on the left. Upon running the simulation for longer, the expected metastability appears also for the value &#120590; = 0.6 (not shown in figures). Nonetheless it is at first sight counterintuitive that a higher value of &#120590; should be slowing down the hopping between metastable states. We do not have a complete explanation of this phenomenon yet, and we intend to carry out further study of this. However, we point out that this result is not wholly unreasonable: in this infinite dimensional scenario the frequency of hopping between metastable states is governed by the parameter &#120574;, which controls the intensity of the infinite dimensional noise, not by &#120590;. Increasing &#120574; does indeed result in faster hopping between metastable states (not shown in figures). We do believe that understanding why an increase of &#120590; slows down metastability is related to the role that &#120590; plays in the (weighted) interacting particle system associated to (2.8)-see <ref type="bibr">[34]</ref>.</p><p>Finally, in figure <ref type="figure">5</ref> we run the simulation for different potentials V and F. In particular the potential V we choose in figure <ref type="figure">5</ref> has four wells. For these potentials no rigorous proofs are available, though the result we find is in line with heuristics.  u t (x) cos x dx for the solution u t to (2.8) with &#120590; = 0.2, 0.6 and 1. These simulations are run with the same parameters as in figure 2. (b) Verification of algorithm  &#120124;[&#8214;u (J,&#8710;t) (t max ) -u(t max )&#8214; 2 L 2 ] &#8776; 1 n trials n trials &#8721; i=1 &#8214;u (J,&#8710;t,i) (t max ) -u ref (t max )&#8214; 2 L 2 (4.2)</p><p>as we vary J and &#8710;t independently, with n trials = 10 4 independent trials in each case. The L 2 norms are computed in Fourier space. For reference solutions, we used &#8710;t ref = 10 -2 and J ref = 2 12 to check J convergence; &#8710;t ref = 10 -6 and J ref = 2 7 to check &#8710;t convergence. The convergence rates of both the number of Fourier modes J the and time-step &#8710;t is consistent with analogous discretizations of semi-linear SPDE (i.e. stochastic Allen-Cahn) <ref type="bibr">[38]</ref>.   The spectral differentiation matrix, D x is dense Toeplitz [41]. F &#8242; corresponds to the discretization of F &#8242; * , and &#120646; is the discrete approximation of &#120588; &#8734; . For the values of J we consider, a standard eigenvsolver suffices. As we see in figure 7-whose numerical simulations have been carried out for different values of &#120590; with the choice (m 1 , m 2 ) = (0, 0), i.e. &#120588; &#8734; (x) = 1 Z &#120590; e -1 &#120590; cos 2x -there is an eigenvalue of positive</p><p>real part for &#120590; in the subcritical regime. This corresponds to a linear instability about this solution, and explains why we do not observe it in our time-dependent simulations. By contrast, for &#120590; in the supercritical regime, the eigenvalue nearest the imaginary axis has negative real part, and it is linearly stable; we do see this solution in the time-dependent simulations. Though the eigenvalues appear stable to numerical refinement, it remains to establish these properties for (A 1). We note that we filtered out zero eigenvalues of L as these corresponded to eigenstates that violated the mean zero condition of (A 1).</p><p>For the non-trivial solution (i.e. (m 1 , m 2 ) &#8800; (0, 0)), in the subcritical regime, figure <ref type="figure">8</ref> implies these are stable solutions. As the images show, the eigenvalue nearest the imaginary axis is negative. Thus, these will become metastable when stochastic forcing is added.</p></div><note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="1" xml:id="foot_0"><p>We note in passing that in differential geometry, the Atiyah-Singer index theorem<ref type="bibr">[15]</ref> serves precisely the purpose of counting solutions of differential equations associated to linear elliptic operators. It might be worth exporting this theorem to computational stochastic analysis and reconciling that framework with what is known in more applied fields. However, such a theorem does not apply to be considered in this paper. Downloaded from https://royalsocietypublishing.org/ on 18 October</p></note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2025" xml:id="foot_1"><p/></note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" xml:id="foot_2"><p>royalsocietypublishing.org/journal/rsta Phil. Trans. R. Soc. A 383: 20240239 .........................................................................................................................</p></note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" xml:id="foot_3"><p>Downloaded from https://royalsocietypublishing.org/ on 18 October 2025</p></note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2" xml:id="foot_4"><p>We consider additive noise because it is straightforward from both an analytical and computational perspective, but the use of other types of noise merits exploration. Downloaded from https://royalsocietypublishing.org/ on 18 October 2025</p></note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="3" xml:id="foot_5"><p>For time-dependent quantities, we use indistinguishably the notation X t and X(t), so throughout &#120588; t (x) = &#120588;(t, x). Downloaded from https://royalsocietypublishing.org/ on 18 October 2025</p></note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="4" xml:id="foot_6"><p>The proof of the non-negativity of stationary solutions of (2.1) is straightforward. One first takes integrates with respect to x the second-order ODE &#120597;x [(V &#8242; (x) + (F &#8242; * &#120588; &#8734; )(x)) &#120588; &#8734; (x) + &#120590;&#120597; x &#120588; &#8734; (x)] =0.After that, one solves via variations of constants the resulting first order ODE. Then imposes the periodic boundary conditions on the solution and the fact that it is a probability measure and finally the expression (2.6) is obtained. It is clear that functions with the expression such as (2.6) are non-negative. Downloaded from https://royalsocietypublishing.org/ on 18 October 2025</p></note>
		</body>
		</text>
</TEI>
