Given a set of standard binary patterns and a defective pattern, the pattern retrieval task is to find the closest pattern to the defective one among these standard patterns. The Hebbian network of Kuramoto oscillators with second-order coupling provides a dynamical model for this task, and the mutual orthogonality in memorised patterns enables us to distinguish these memorised patterns from most others in terms of stability. For the sake of error-free retrieval for general problems lacking orthogonality, a unified approach was proposed which transforms the problem into a series of subproblems with orthogonality using the orthogonal lift for two patterns. In this work, we propose the least orthogonal lift for three patterns, which evidently reduces the time of solving subproblems and even the dimensions of subproblems. Furthermore, we provide an estimate for the critical strength for stability/instability of binary patterns, which is convenient in practical use. Simulation results are presented to illustrate the effectiveness of the proposed approach.

The purpose of this paper is to derive anisotropic mean curvature flow as the limit of the anisotropic Allen–Cahn equation. We rely on distributional solution concepts for both the diffuse and sharp interface models and prove convergence using relative entropy methods, which have recently proven to be a powerful tool in interface evolution problems. With the same relative entropy, we prove a weak–strong uniqueness result, which relies on the construction of gradient flow calibrations for our anisotropic energy functionals.

$c$-cyclical monotonicity is the most important optimality condition for an optimal transport plan. While the proof of necessity is relatively easy, the proof of sufficiency is often more difficult or even elusive. We present here a new approach, and we show how known results are derived in this new framework and how this approach allows to prove sufficiency in situations previously not treatable.

This paper investigates the separation property in binary phase-segregation processes modelled by Cahn-Hilliard type equations with constant mobility, singular entropy densities and different particle interactions. Under general assumptions on the entropy potential, we prove the strict separation property in both two and three-space dimensions. Namely, in 2D, we notably extend the minimal assumptions on the potential adopted so far in the literature, by only requiring a mild growth condition of its first derivative near the singular points $\pm 1$, without any pointwise additional assumption on its second derivative. For all cases, we provide a compact proof using De Giorgi’s iterations. In 3D, we also extend the validity of the asymptotic strict separation property to the case of fractional Cahn-Hilliard equation, as well as show the validity of the separation when the initial datum is close to an ‘energy minimizer’. Our framework offers insights into statistical factors like particle interactions, entropy choices and correlations governing separation, with broad applicability.

We introduce a new non-abelian quantum synchronisation model over the unitary group, represented as a gradient flow, where state matrices asymptotically converge to a common one up to phase translation. We provide a sufficient framework leading to quantum synchronisation based on Riccati-type differential inequalities. In addition, uniform time-delayed interaction is considered for modelling realistic communication, and we demonstrate that quantum synchronisation is persistent when a small time delay is allowed. Finally, numerical simulation is performed to visualise qualitative behaviours and support theoretical results.

In this paper, we present a sufficient framework to exhibit the sample path-wise asymptotic flocking dynamics of the Cucker–Smale model with unit-speed constraint and the randomly switching network topology. We employ a matrix formulation of the given equation, which allows us to evaluate the diameter of velocities with respect to the adjacency matrix of the network. Unlike the previous result on the randomly switching Cucker–Smale model, the unit-speed constraint disallows the system to be considered as a nonautonomous linear ordinary differential equation on velocity vector, which forces us to get a weaker form of the flocking estimate than the result for the original Cucker–Smale model.

We study the poor-biased model for money exchange introduced in Cao & Motsch ((2023) Kinet. Relat. Models 16(5), 764–794.): agents are being randomly picked at a rate proportional to their current wealth, and then the selected agent gives a dollar to another agent picked uniformly at random. Simulations of a stochastic system of finitely many agents as well as a rigorous analysis carried out in Cao & Motsch ((2023) Kinet. Relat. Models 16(5), 764–794.), Lanchier ((2017) J. Stat. Phys. 167(1), 160–172.) suggest that, when both the number of agents and time become large enough, the distribution of money among the agents converges to a Poisson distribution. In this manuscript, we establish a uniform-in-time propagation of chaos result as the number of agents goes to infinity, which justifies the validity of the mean-field deterministic infinite system of ordinary differential equations as an approximation of the underlying stochastic agent-based dynamics.

We consider self-propelled rigid bodies interacting through local body-attitude alignment modelled by stochastic differential equations. We derive a hydrodynamic model of this system at large spatio-temporal scales and particle numbers in any dimension $n \geq 3$. This goal was already achieved in dimension $n=3$ or in any dimension $n \geq 3$ for a different system involving jump processes. However, the present work corresponds to huge conceptual and technical gaps compared with earlier ones. The key difficulty is to determine an auxiliary but essential object, the generalised collision invariant. We achieve this aim by using the geometrical structure of the rotation group, namely its maximal torus, Cartan subalgebra and Weyl group as well as other concepts of representation theory and Weyl’s integration formula. The resulting hydrodynamic model appears as a hyperbolic system whose coefficients depend on the generalised collision invariant.

We propose a new fractional Laplacian for bounded domains, expressed as a conservation law and thus particularly suited to finite-volume schemes. Our approach permits the direct prescription of no-flux boundary conditions. We first show the well-posedness theory for the fractional heat equation. We also develop a numerical scheme, which correctly captures the action of the fractional Laplacian and its anomalous diffusion effect. We benchmark numerical solutions for the Lévy–Fokker–Planck equation against known analytical solutions. We conclude by numerically exploring properties of these equations with respect to their stationary states and long-time asymptotics.

Motivated by the impact of worsening climate conditions on vegetation patches, we study dynamic instabilities in an idealised Ginzburg–Landau model. Our main results predict time instances of sudden drops in wavenumber and the resulting target states. The changes in wavenumber correspond to the annihilation of individual vegetation patches when resources are scarce and cannot support the original number of patches. Drops happen well after the primary pattern has destabilised at the Eckhaus boundary and key to distinguishing between the disappearance of 1,2 or more patches during the drop are complex spatio-temporal resonances in the linearisation at the unstable pattern. We support our results with numerical simulations and expect our results to be conceptually applicable universally near the Eckhaus boundary, in particular in more realistic models.

Consensus-based optimisation (CBO) is a versatile multi-particle metaheuristic optimisation method suitable for performing non-convex and non-smooth global optimisations in high dimensions. It has proven effective in various applications while at the same time being amenable to a theoretical convergence analysis. In this paper, we explore a variant of CBO, which incorporates truncated noise in order to enhance the well-behavedness of the statistics of the law of the dynamics. By introducing this additional truncation in the noise term of the CBO dynamics, we achieve that, in contrast to the original version, higher moments of the law of the particle system can be effectively bounded. As a result, our proposed variant exhibits enhanced convergence performance, allowing in particular for wider flexibility in choosing the noise parameter of the method as we confirm experimentally. By analysing the time evolution of the Wasserstein-$2$ distance between the empirical measure of the interacting particle system and the global minimiser of the objective function, we rigorously prove convergence in expectation of the proposed CBO variant requiring only minimal assumptions on the objective function and on the initialisation. Numerical evidences demonstrate the benefit of truncating the noise in CBO.

Measuring inequalities in a multidimensional framework is a challenging problem, which is common to most field of science and engineering. Nevertheless, despite the enormous amount of researches illustrating the fields of application of inequality indices, and of the Gini index in particular, very few consider the case of a multidimensional variable. In this paper, we consider in some details a new inequality index, based on the Fourier transform, that can be fruitfully applied to measure the degree of inhomogeneity of multivariate probability distributions. This index exhibits a number of interesting properties that make it very promising in quantifying the degree of inequality in datasets of complex and multifaceted social phenomena.

We formulate haptotaxis models of cancer invasion wherein the infiltrating cancer cells can occupy a spectrum of states in phenotype space, ranging from ‘fully mesenchymal’ to ‘fully epithelial’. The more mesenchymal cells are those that display stronger haptotaxis responses and have greater capacity to modify the extracellular matrix (ECM) through enhanced secretion of matrix-degrading enzymes (MDEs). However, as a trade-off, they have lower proliferative capacity than the more epithelial cells. The framework is multiscale in that we start with an individual-based model that tracks the dynamics of single cells, which is based on a branching random walk over a lattice representing both physical and phenotype space. We formally derive the corresponding continuum model, which takes the form of a coupled system comprising a partial integro-differential equation for the local cell population density function, a partial differential equation for the MDE concentration and an infinite-dimensional ordinary differential equation for the ECM density. Despite the intricacy of the model, we show, through formal asymptotic techniques, that for certain parameter regimes it is possible to carry out a detailed travelling wave analysis and obtain invading fronts with spatial structuring of phenotypes. Precisely, the most mesenchymal cells dominate the leading edge of the invasion wave and the most epithelial (and most proliferative) dominate the rear, representing a bulk tumour population. As such, the model recapitulates similar observations into a front to back structuring of invasion waves into leader-type and follower-type cells, witnessed in an increasing number of experimental studies over recent years.

Opinion dynamics is an important and very active area of research that delves into the complex processes through which individuals form and modify their opinions within a social context. The ability to comprehend and unravel the mechanisms that drive opinion formation is of great significance for predicting a wide range of social phenomena such as political polarisation, the diffusion of misinformation, the formation of public consensus and the emergence of collective behaviours. In this paper, we aim to contribute to that field by introducing a novel mathematical model that specifically accounts for the influence of social media networks on opinion dynamics. With the rise of platforms such as Twitter, Facebook, and Instagram and many others, social networks have become significant arenas where opinions are shared, discussed and potentially altered. To this aim after an analytical construction of our new model and through incorporation of real-life data from Twitter, we calibrate the model parameters to accurately reflect the dynamics that unfold in social media, showing in particular the role played by the so-called influencers in driving individual opinions towards predetermined directions.

The connection between Residual Neural Networks (ResNets) and continuous-time control systems (known as NeurODEs) has led to a mathematical analysis of neural networks, which has provided interesting results of both theoretical and practical significance. However, by construction, NeurODEs have been limited to describing constant-width layers, making them unsuitable for modelling deep learning architectures with layers of variable width. In this paper, we propose a continuous-time Autoencoder, which we call AutoencODE, based on a modification of the controlled field that drives the dynamics. This adaptation enables the extension of the mean-field control framework originally devised for conventional NeurODEs. In this setting, we tackle the case of low Tikhonov regularisation, resulting in potentially non-convex cost landscapes. While the global results obtained for high Tikhonov regularisation may not hold globally, we show that many of them can be recovered in regions where the loss function is locally convex. Inspired by our theoretical findings, we develop a training method tailored to this specific type of Autoencoders with residual connections, and we validate our approach through numerical experiments conducted on various examples.

In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific classes of interactions a statistical description of the graph topology, given in terms of the degree distribution embedded in a Boltzmann-type kinetic equation, is sufficient to capture the collective trends of networked interacting systems. This proves the validity of a commonly accepted heuristic assumption in statistically structured graph models, namely that the so-called connectivity of the agents is the only relevant parameter to be retained in a statistical description of the graph topology. Then, we validate our results by testing them numerically against real social network data.