Related papers: Coalescing and branching simple symmetric exclusio…
The present paper is devoted to the convergence analysis of a class of asymptotic preserving particle schemes [Filbet \& Rodrigues, SIAM J. Numer. Anal., 54 (2) (2016)] for the Vlasov equation with a strong external magnetic field. In this…
We consider the one-dimensional partially asymmetric exclusion process with random hopping rates, in which a fraction of particles (or sites) have a preferential jumping direction against the global drift. In this case the accumulated…
In this paper, we analyze the iteration-complexity of Generalized Forward--Backward (GFB) splitting algorithm, as proposed in \cite{gfb2011}, for minimizing a large class of composite objectives $f + \sum_{i=1}^n h_i$ on a Hilbert space,…
We address the dynamics of interacting particles on a disordered lattice formed by a random comb. The dynamics comprises that of the asymmetric simple exclusion process, whereby motion to nearest-neighour sites that are empty is more likely…
This paper presents a grid-free simulation algorithm for the fully three-dimensional Vlasov--Poisson system for collisionless electron plasmas. We employ a standard particle method for the numerical approximation of the distribution…
Sampling equilibrium ensembles of dense polymer mixtures is a paradigmatically hard problem in computational physics, even in lattice-based models. Here, we develop a formalism based on interacting binary tensors that allows for tackling…
Density-driven segregations, extensively studied in a simple rotating drum, are enriched with a wide range of underlying physics. Diverse symmetrical segregation patterns formed by mixing two types of dry mono-sized grains have been…
We consider the simple exclusion process with $k$ particles on a segment of length $N$ performing random walks with transition $p>1/2$ to the right and $q=1-p$ to the left. We focus on the case where the asymmetry in the jump rates…
We investigate the convergence towards equilibrium of the noisy voter model, evolving in the complete graph with n vertices. The noisy voter model is a version of the voter model, on which individuals change their opinions randomly due to…
We present a simple theory accounting for two central observations in a recent experiment on quantum coarsening and collective dynamics on a programmable quantum simulator [T. Manovitz et al., Nature \textbf{638}, 86 (2025)]: an apparent…
We give an efficient perfect sampling algorithm for weighted, connected induced subgraphs (or graphlets) of rooted, bounded degree graphs. Our algorithm utilizes a vertex-percolation process with a carefully chosen rejection filter and…
We study asymptotic behaviour of the correlation functions of bipartite sparse random $N\times N$ matrices. We assume that the graphs have $N$ vertices, the ratio of parts is $\displaystyle\frac{\alpha}{1-\alpha}$ and the average number of…
We consider a family of McKean--Vlasov equations arising as the large particle limit of a system of interacting particles on the positive half-line with common noise and feedback. Such systems are motivated by structural models for systemic…
Causal Graph Dynamics extend Cellular Automata to arbitrary, bounded-degree, time-varying graphs. The whole graph evolves in discrete time steps, and this global evolution is required to have a number of physics-like symmetries:…
A central problem in the theory of the dynamics of open quantum systems is the derivation of a rigorous and computationally tractable master equation for the reduced system density matrix. Most generally, the evolution of an open quantum…
Birkner et al. obtained necessary and sufficient conditions for the frequency between two independent and identically distributed continuous-state branching processes time-changed by a functional of the total mass process to be a Markov…
It has long been known, since the classical work of (Arora, Karger, Karpinski, JCSS~99), that \MC\ admits a PTAS on dense graphs, and more generally, \kCSP\ admits a PTAS on "dense" instances with $\Omega(n^k)$ constraints. In this paper we…
The multispecies asymmetric simple exclusion process (mASEP) is a Markov chain in which particles of different species hop along a one-dimensional lattice. This paper studies the doubly asymmetric simple exclusion process…
Several important learning tasks can be formulated as minimizing an entropy-regularized objective over an appropriate space of probability distributions. Mean-field Langevin dynamics (MFLD) facilitate computation in this general context,…
In the family of clustering problems, we are given a set of objects (vertices of the graph), together with some observed pairwise similarities (edges). The goal is to identify clusters of similar objects by slightly modifying the graph to…