Related papers: Dynamic Space Filling
Distribution functions (DFs) for dynamically warm thin stellar disks residing in arbitrary axisymmetric potentials are presented which approximately reproduce pre-described surface-density and velocity-dispersion profiles. The functional…
In this paper we consider the \emph{fully-dynamic} All-Pairs Effective Resistance problem, where the goal is to maintain effective resistances on a graph $G$ among any pair of query vertices under an intermixed sequence of edge insertions…
We consider an infinite system of coupled stochastic differential equations (SDE) describing dynamics of the following infinite particle system. Each partricle is characterised by its position $x\in \mathbb{R}^{d}$ and internal parameter…
The stochastic sandpile model (SSM) is a generalisation of the standard Abelian sandpile model (ASM), in which topplings of unstable vertices are made random. When unstable, a vertex sends one grain to each of its neighbours independently…
We explore the stationary densities in totally asymmetric exclusion processes (TASEP) with open boundary conditions and spatially inhomogeneous hopping rates. We calculate the steady state density profiles that characterise the associated…
We find conditions for stationary measures of random dynamical systems on surfaces having dissipative diffeomorphisms to be absolutely continuous. These conditions involve a uniformly expanding on average property in the future (UEF) and…
Dynamic graphs refer to graphs whose structure dynamically changes over time. Despite the benefits of learning vertex representations (i.e., embeddings) for dynamic graphs, existing works merely view a dynamic graph as a sequence of changes…
We consider the stochastic sandpile model with uniform toppling rule on the integer line. During a uniform toppling, with probability $1/3$ one particle is sent to the right of the toppled vertex, with probability $1/3$ one particle is sent…
In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…
We study a coupled dynamics of a network and a particle system. Particles of density $\rho$ diffuse freely along edges, each of which is rewired at a rate given by a decreasing function of particle flux. We find that the coupled dynamics…
Contemporary automatic first break (FB) picking methods typically analyze 1D signals, 2D source gathers, or 3D source-receiver gathers. Utilizing higher-dimensional data, such as 2D or 3D, incorporates global features, improving the…
A dominating set of a graph $G=(V,E)$ is a set of vertices $D \subseteq V$ whose closed neighborhood is $V$, i.e., $N[D]=V$. We view a dominating set as a collection of tokens placed on the vertices of $D$. In the token sliding variant of…
We study the transport properties of a system of active particles moving at constant speed in an heterogeneous two-dimensional space. The spatial heterogeneity is modeled by a random distribution of obstacles, which the active particles…
We develop a lattice gas model for the drying of droplets of a nanoparticle suspension on a planar surface, using dynamical density functional theory (DDFT) to describe the time evolution of the solvent and nanoparticle density profiles.…
We consider the numerical approximation of the filtering problem in high dimensions, that is, when the hidden state lies in $\mathbb{R}^d$ with $d$ large. For low dimensional problems, one of the most popular numerical procedures for…
Symmetry fractionalization describes the fascinating phenomena that excitations in a 2D topological system can transform under symmetry in a fractional way. For example in fractional quantum Hall systems, excitations can carry fractional…
This paper deals with the problem of simulating dense dispersed systems composed by large numbers of particles undergoing ballistic aggregation. The most classical approaches for dealing with such problems are represented by the so-called…
This paper presents a new state space generation approach for dynamic fault trees (DFTs) together with a technique to synthesise failures rates in DFTs. Our state space generation technique aggressively exploits the DFT structure ---…
We consider random walks evolving on two models of connected and undirected graphs and study the exact large deviations of a local dynamical observable. We prove, in the thermodynamic limit, that this observable undergoes a first-order…
We consider an open one dimensional lattice gas on sites $i=1,...,N$, with particles jumping independently with rate 1 to neighboring interior empty sites, the {\it simple symmetric exclusion process}. The particle fluxes at the left and…