Related papers: Dynamic Space Filling
Fully dynamic graph is a data structure that (1) supports edge insertions and deletions and (2) answers problem specific queries. The time complexity of (1) and (2) are referred to as the update time and the query time respectively. There…
The net of N ``physical'' neurons is considered as a dynamical system. These neurons form a complete graph. The state of any neuron is its electric potential. The potential linearly increases until reaches its maximal value. Then it falls…
We consider a random walk on a discrete connected graph having some infinite branches plus finitely many vertices with finite degrees. We find the generator of a strong stationary dual in the sense of Fill, and use it to find some…
One-dimensional directed driven stochastic flow with competing nonlocal and local hopping events has an instability threshold from a populated phase into an empty-road (ER) phase. We implement this in the context of the asymmetric exclusion…
We define a general model of stochastically-evolving graphs, namely the \emph{Edge-Uniform Stochastically-Evolving Graphs}. In this model, each possible edge of an underlying general static graph evolves independently being either alive or…
Stochastic and mixed stochastic-deterministic density functional theory (DFT) are promising new approaches for the calculation of the equation-of-state and transport properties in materials under extreme conditions. In the intermediate warm…
Flocking and vortical are two typical motion modes in active matter. Although it is known that the two modes can spontaneously switch between each other in a finite-size system, the switching dynamics remain elusive. In this work, by…
This study develops a dynamic fundamental diagram (FD) framework tailored to mixed traffic environments comprising automated vehicles (AVs) and human-driven vehicles (HDVs). Describing function analysis is employed to derive approximate…
Topological phase of matter is now a mainstream of research in condensed matter physics, of which the classification, synthesis, and detection of topological states have brought excitements over the recent decade while remain incomplete…
We study flocking in one dimension, introducing a lattice model in which particles can move either left or right. We find that the model exhibits a continuous nonequilibrium phase transition from a condensed phase, in which a single `flock'…
By the density functional theory for crystallization, it is shown that for vortex lines in an underlying layered structure a smectic phase with period m=2 can be stabilized by strong layer pinning. The freezing of vortex liquid is then…
Large ensembles of stochastically evolving interacting particles describe phenomena in diverse fields including statistical physics, neuroscience, biology, and engineering. In such systems, the infinitesimal evolution of each particle…
Let $M$ be a differentiable manifold endowed locally with two complementary distributions, say horizontal and vertical. We consider the two subgroups of (local) diffeomorphisms of $M$ generated by vector fields in each of of these…
Simulation and experimental studies have demonstrated non-equilibrium ordering in driven colloidal suspensions: with increasing driving force, a uniform colloidal mixture transforms into a locally demixed state characterized by the lane…
A dynamical system of points moving along the edges of a graph could be considered as a geometrical discrete dynamical system or as a discrete version of a quantum graph with localized wave packets. We study the set of such systems over…
A pendant vertex is one of degree one and an isolated vertex has degree zero. A neighborhood star-free (NSF for short) graph is one in which every vertex is contained in a triangle except pendant vertices and isolated vertices. This class…
We study stochastic motion planning problems which involve a controlled process, with possibly discontinuous sample paths, visiting certain subsets of the state-space while avoiding others in a sequential fashion. For this purpose, we first…
We consider the performance of the Depth First Search (DFS) algorithm on the random graph $G\left(n,\frac{1+\epsilon}{n}\right)$, $\epsilon>0$ a small constant. Recently, Enriquez, Faraud and M\'enard [2] proved that the stack $U$ of the…
The Fleming-Viot process describes a system of $N$ particles diffusing on a graph with an absorbing site. Whenever one of the particles is absorbed, it is replaced by a new particle at the position of one of the $N-1$ remaining particles.…
Modern machine learning models are typically trained via multi-pass stochastic gradient descent (SGD) with small batch sizes, and understanding their dynamics in high dimensions is of great interest. However, an analytical framework for…