Related papers: Dynamical clusters of infinite particle dynamics
This paper studies a discrete dynamical system belonging to the class of the networks introduced by A.P.~Buslaev. The systems contains a finite set of contours. In any contour, there are cells and a group of particles. This group is called…
Fluid-mediated interactions between particles in a vibrating fluid lead to both long range attraction and short range repulsion. The resulting patterns include hexagonally ordered micro-crystallites, time-periodic structures, and chaotic…
We consider a system of particles which interact through a jump process. The jump intensities are functions of the proximity rank of the particles, a type of interaction referred to as topological in the literature. Such interactions have…
Let $G$ be a graph each edge $e$ of which is given a length $\ell(e)$. This naturally induces a distance $d_\ell(x,y)$ between any two vertices $x,y$, and we let $\ell-TOP$ denote the completion of the corresponding metric space. It turns…
We study an interacting particle system in which moving particles activate dormant particles linked by the components of critical bond percolation. Addressing a conjecture from Beckman, Dinan, Durrett, Huo, and Junge for a continuous…
Many types of dynamic networks are made up of durable entities whose links evolve over time. When considered from a {\em global} and {\em discrete} standpoint, these networks are often modelled as evolving graphs, i.e. a sequence of graphs…
We study the percolation properties of graph partitioning on random regular graphs with N vertices of degree $k$. Optimal graph partitioning is directly related to optimal attack and immunization of complex networks. We find that for any…
In this note we study some properties of infinite percolation clusters on non-amenable graphs. In particular, we study the percolative properties of the complement of infinite percolation clusters. An approach based on mass-transport is…
We discuss a simple model of particles hopping in one dimension with attractive interactions. Taking a hydrodynamic limit in which the interaction strength increases with the system size, we observe the formation of multiple clusters of…
We study a system of $N$ interacting particles on $\bf{Z}$. The stochastic dynamics consists of two components: a free motion of each particle (independent random walks) and a pair-wise interaction between particles. The interaction belongs…
We solve a non-equilibrium statistical mechanics problem exactly, namely, the single-file dynamics of N hard-core interacting particles (the particles cannot pass each other) of size \Delta diffusing in a one dimensional system of finite…
Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the elements $G$ and where two vertices $x$ and $y$ are adjacent if there exists a minimal generating set of $G$ containing $x$ and $y.$ We prove that…
In microfluidic devices, inertia drives particles to focus on a finite number of inertial focusing streamlines. Particles on the same streamline interact to form one-dimensional microfluidic crystals (or "particle trains"). Here we develop…
We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…
For a graph $G$ and an integer-valued threshold function $\tau$ on its vertex set, a dynamic monopoly is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G$ that have at least $\tau(u)$ neighbors in it eventually…
We consider a large class of interacting particle systems in 1D described by an energy whose interaction potential is singular and non-local. This class covers Riesz gases (in particular, log gases) and applications to plasticity and…
The adhesive dynamics of a one-dimensional aggregating gas of point particles is rigorously described. The infinite hierarchy of kinetic equations for the distributions of clusters of nearest neighbours is shown to be equivalent to a system…
Every end of an infinite graph $ G $ defines a tangle of infinite order in $ G $. These tangles indicate a highly cohesive substructure in the graph if and only if they are closed in some natural topology. We characterize, for every finite…
We consider the Langevin dynamics of a many-body system of interacting particles in $d$ dimensions, in a very general setting suitable to model several out-of-equilibrium situations, such as liquid and glass rheology, active self-propelled…
Temporal graphs represent interactions between entities over the time. These interactions may be direct (a contact between two nodes at some time instant), or indirect, through sequences of contacts called temporal paths (journeys).…