Related papers: Dynamic Space Filling
This article is devoted to the study of the dynamical behavior of a collisionless kinetic gas in d=1,2,3 space dimensions which is trapped in a rotationally symmetric potential well. Although at the microscopic level the trajectories of…
We discuss an active phase field crystal (PFC) model that describes a mixture of active and passive particles. First, a microscopic derivation from dynamical density functional theory (DDFT) is presented that includes a systematic treatment…
The frog model is a system of interacting random walks. Initially, there is one particle at each vertex of a connected graph $\mathcal{G}$. All particles are inactive at time zero, except for the one which is placed at the root of…
The observable universe has undergone periods of expansion that are well approximated by de Sitter (dS) space. Still lacking is a quantum mechanical description of dS, both globally and when restricted to the static patch. We develop a…
In this paper, we propose a depth-first search (DFS) algorithm for searching maximum matchings in general graphs. Unlike blossom shrinking algorithms, which store all possible alternative alternating paths in the super-vertices shrunk from…
The 1D Ising model is the simplest Hamiltonian-based model in statistical mechanics. The sim- plest interacting particle process is the Symmetric Exclusion Process (SEP), a 1D lattice gas of particles that hop symmetrically and cannot…
Suppose that a $d$-dimensional domain is filled with a gas of (in general, interacting) diffusive particles with density $n_0$. A particle is absorbed whenever it reaches the domain boundary. Employing macroscopic fluctuation theory, we…
The term single file (SF) dynamics refers to the motion of an assembly of particles through a channel with cross-section comparable to the particles' diameter. Single file diffusion (SFD) is then the diffusion of a tagged particle in a…
While increasingly deep networks are still in general desired for achieving state-of-the-art performance, for many specific inputs a simpler network might already suffice. Existing works exploited this observation by learning to skip…
Supercooled liquids and dense colloids exhibit anomalous behaviour known as "spatially heterogeneous dynamics" (SHD), which becomes increasingly pronounced with approach to the glass transition. Recently, SHD has been observed in confined…
A finite dynamical system (FDS) is a system of multivariate functions over a finite alphabet, that is typically used to model a network of interacting entities. The main feature of a finite dynamical system is its interaction graph, which…
Random dynamical systems (RDS) evolve by a dynamical rule chosen independently with a certain probability, from a given set of deterministic rules. These dynamical systems in an interval reach a steady state with a unique well-defined…
We study a particle system with hopping (random walk) dynamics on the integer lattice $\mathbb Z^d$. The particles can exist in two states, active or inactive (sleeping); only the former can hop. The dynamics conserves the number of…
We study the dynamics of the Stochastic Sandpile Model on finite graphs, with two main results. First, we describe a procedure to exactly sample from the stationary distribution of the model in all connected finite graphs, extending a…
Time-evolving large graph has received attention due to their participation in real-world applications such as social networks and PageRank calculation. It is necessary to partition a large-scale dynamic graph in a streaming manner to…
We present a novel study of dust-vortex evolution in global two-fluid disk simulations to find out if evolution toward high dust-to-gas ratios can occur in a regime of well-coupled grains with low Stokes numbers ($St=10^{-3}-{4\times…
Dynamic force spectroscopy (DFS) is an experimental technique that is commonly used to assess information of the strength, energy landscape, and lifetime of noncovalent bio-molecular interactions. DFS traditionally requires an applied force…
The frog model is a stochastic model for the spreading of an epidemic on a graph, in which a dormant particle starts to perform a simple random walk on the graph and to awake other particles, once it becomes active. We study two versions of…
We study a dynamical system motivated by our earlier work on the statistical physics of social balance on graphs that can be viewed as a generalization of annihilating walks along two directions: first, the interaction topology is a…
A shift-periodic map is a one-dimensional map from the real line to itself which is periodic up to a linear translation and allowed to have singularities. It is shown that iterative sequences $x_{n+1}=F(x_n)$ generated by such maps display…