Related papers: Deterministic particle approximation of the Hughes…
We design a deterministic particle method for the solution of the spatially homogeneous Landau equation with uncertainty. The deterministic particle approximation is based on the reformulation of the Landau equation as a formal gradient…
We propose a finite-dimensional control-based method to approximate solution operators for evolutional partial differential equations (PDEs), particularly in high-dimensions. By employing a general reduced-order model, such as a deep neural…
We introduce a (linear) positive and asymptotic preserving method or solving the one-group radiation transport equation. The approximation in space is discretization agnostic: the space approximation can be done with continuous or…
In this paper we create a model of particle motion on a three-dimensional lattice using discrete random walk with small steps. We rigorously construct a probability space of the particle trajectories. Unlike deterministic approach in…
We propose in this paper a minimal speed-based pedestrian model for which particle dynamics are intrinsically collision-free. The speed model is an optimal velocity function depending on the agent length (i.e.\ particle diameter), maximum…
We study the discretization of generalized Wasserstein distances with nonlinear mobilities on the real line via suitable discrete metrics on the cone of N ordered particles, a setting which naturally appears in the framework of…
We investigate the existence of weak type solutions for a class of aggregation-diffusion PDEs with nonlinear mobility obtained as large particle limit of a suitable nonlocal version of the follow-the-leader scheme, which is interpreted as…
We construct the detection rate for particle detectors moving along non-inertial trajectories and interacting with quantum fields. The detectors described here are characterized by the presence of records of observation throughout their…
Recurrent neural networks are able to learn complex long-term relationships from sequential data and output a pdf over the state space. Therefore, recurrent models are a natural choice to address path prediction tasks, where a trained model…
We use a deterministic particle method to produce numerical approximations to the solutions of an evolution cross-diffusion problem for two populations. According to the values of the diffusion parameters related to the intra and…
In this paper we deal with pedestrian modeling, aiming at simulating crowd behavior in normal and emergency scenarios, including highly congested mass events. We are specifically concerned with a new agent-based, continuous-in-space,…
Optimization techniques are at the core of many scientific and engineering disciplines. The steepest descent methods play a foundational role in this area. In this paper we studied a generalized steepest descent method on Riemannian…
We consider a class of aggregation-diffusion equations on unbounded one dimensional domains with Lipschitz nonincreasing mobility function. We show strong $L^1$-convergence of a suitable deterministic particle approximation to weak…
We consider a class of nonlocal conservation laws with an interaction kernel supported on the negative real half-line and featuring a decreasing jump at the origin. We provide, for the first time, an existence and uniqueness theory for said…
We present a new approach for search of coexisting classes of localised modes admitted by the repulsive (defocusing) scalar or vector nonlinear Schr\"odinger-type equations. The approach is based on the observation that generic solutions of…
Denoising diffusion models have become ubiquitous for generative modeling. The core idea is to transport the data distribution to a Gaussian by using a diffusion. Approximate samples from the data distribution are then obtained by…
The length of the geodesic between two data points along a Riemannian manifold, induced by a deep generative model, yields a principled measure of similarity. Current approaches are limited to low-dimensional latent spaces, due to the…
This work proposes a unified $hp$-adaptivity framework for hybridized discontinuous Galerkin (HDG) method for a large class of partial differential equations (PDEs) of Friedrichs' type. In particular, we present unified $hp$-HDG…
When tracking a large number of targets, it is often computationally expensive to represent the full joint distribution over target states. In cases where the targets move independently, each target can instead be tracked with a separate…
We provide a numerical realisation of an optimal control problem for pedestrian motion with agents that was analysed in Herzog, Pietschmann, Winkler: "Optimal Control of Hughes' Model for Pedestrian Flow via Local Attraction.", arXiv…