Related papers: Getting even with CLE
Stochastic reaction networks governed by Chemical Langevin Equations (CLE) exhibit pronounced multiscale dynamics spanning fast molecular reactions, intermediate transport, and slow cellular regulation, posing significant challenges for…
We investigate the universality of multi-spin systems in architectures of various symmetries of coupling type and topology. Explicit reachability sets under symmetry constraints are provided. Thus for a given (possibly symmetric)…
A method for relaxing the CFL-condition, which limits the time step size in explicit methods in computational fluid dynamics, is presented. The method is based on re-formulating explicit methods in matrix form, and considering them as a…
Achieving backward compatibility when rolling out new models can highly reduce costs or even bypass feature re-encoding of existing gallery images for in-production visual retrieval systems. Previous related works usually leverage losses…
With a sufficiently fine discretisation, the Lattice Boltzmann Method (LBM) mimics a second order Crank-Nicolson scheme for certain types of balance laws (Farag et al. [2021]). This allows the explicit, highly parallelisable LBM to…
Fourier acceleration has been successfully applied to the simulation of lattice field theories for more than a decade. In this paper, we extend the method to the dynamics of discrete particles moving in continuum. Although our method is…
In this short note, we discuss the basic approach to computational modeling of dynamical systems. If a dynamical system contains multiple time scales, ranging from very fast to slow, computational solution of the dynamical system can be…
We apply the coupled cluster method (CCM) to the Hamiltonian version of the latticised O(4) non-linear sigma model. The method, which was initially developed for the accurate description of quantum many-body systems, gives rise to two…
Many robotics applications require alignment and fusion of observations obtained at multiple views to form a global model of the environment. Multi-way data association methods provide a mechanism to improve alignment accuracy of pairwise…
Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…
This study explores the utility of a kernel in complex Langevin simulations of quantum real-time dynamics on the Schwinger-Keldysh contour. We give several examples where we use a systematic scheme to find kernels that restore correct…
The deformability of soft condensed matter often requires modelling of hydrodynamical aspects to gain quantitative understanding. This, however, requires specialised methods that can resolve the multiscale nature of soft matter systems. We…
Lattice systems with certain Lie algebraic or quantum Lie algebraic symmetries are constructed. These symmetric models give rise to series of integrable systems. As examples the $A_n$-symmetric chain models and the SU(2)-invariant ladder…
General-purpose robots coexisting with humans in their environment must learn to relate human language to their perceptions and actions to be useful in a range of daily tasks. Moreover, they need to acquire a diverse repertoire of…
This article presents a comparison of various implementations of the Lattice Discrete Particle Model (LDPM) for the numerical simulation of concrete and other heterogeneous quasibrittle materials. The comparison involves the use of…
The three-dimensional SU(3) spin model is an effective Polyakov loop model for QCD at nonzero temperature and density. It suffers from a sign problem at nonzero chemical potential. We revisit this model using complex Langevin dynamics and…
Starting from the Maxwell-Juettner equilibrium distribution, we develop a relativistic lattice Boltzmann (LB) algorithm capable of handling ultrarelativistic systems with flat, but expanding, spacetimes. The algorithm is validated through…
We present an application of the standard Langevin dynamics to the problem of weak coupling perturbative expansions for Lattice QCD. This method can be applied to the computation of the most general observables. In this preliminary work we…
Continual Learning (CL) strives to learn incrementally across tasks while mitigating catastrophic forgetting. A key challenge in CL is balancing stability (retaining prior knowledge) and plasticity (learning new tasks). While representative…
In this paper we initiate the study of the computational complexity of learning linear temporal logic (LTL) formulas from examples. We construct approximation algorithms for fragments of LTL and prove hardness results; in particular we…