Related papers: N Bugs on a Circle
We consider the problem of steering a collection of n particles that obey identical n-dimensional linear dynamics via a common state feedback law towards a rearrangement of their positions, cast as a controllability problem for a dynamical…
An arrangement of pseudocircles is a collection of simple closed curves on the sphere or in the plane such that any two of the curves are either disjoint or intersect in exactly two crossing points. We call an arrangement intersecting if…
Software bugs cost the global economy billions of dollars annually and claim ~50\% of the programming time from software developers. Locating these bugs is crucial for their resolution but challenging. It is even more challenging in…
We show that a scaling approach successfully characterizes clustering and intermittency in space and time, in systems of noninteracting particles driven by fluctuating surfaces. We study both the steady state and the approach to it, for…
In this paper, we proposed a stochastic model which describes two species of particles moving in counterflow. The model generalizes the theoretical framework describing the transport in random systems since particles can work as mobile…
The theory of Gaussian quantum fluctuations around classical steady states in nonlinear quantum-optical systems (also known as standard linearization) is a cornerstone for the analysis of such systems. Its simplicity, together with its…
Diffusion in an evolving environment is studied by continuos-time Monte Carlo simulations. Diffusion is modelled by continuos-time random walkers on a lattice, in a dynamic environment provided by bubbles between two one-dimensional…
This paper addresses a multi-pursuer single-evader pursuit-evasion game where the free-moving evader moves faster than the pursuers. Most of the existing works impose constraints on the faster evader such as limited moving area and moving…
Building on previous work by four of us (ABCN), we consider further generalizations of Warrington's juggling Markov chains. We first introduce "multispecies" juggling, which consist in having balls of different weights: when a ball is…
Robots with very limited capabilities are placed on the vertices of a graph and are required to move toward a single, common vertex, where they remain stationary once they arrive. This task is referred to as the GATHERING problem. Most of…
Motivated by station-keeping applications in various unmanned settings, this paper introduces a steering control law for a pair of agents operating in the vicinity of a fixed beacon in a three-dimensional environment. This feedback law is a…
Bug localization is a tedious activity in the bug fixing process in which a software developer tries to locate bugs in the source code described in a bug report. Since this process is time-consuming and requires additional knowledge about…
We consider n-dimensional deterministic flows obtained by perturbing a gradient flow. We assume that the gradient flow admits a stable curve of stationary points, and thus if the perturbation is not too large the perturbed flow also admits…
The theory of stochastic resetting asserts that restarting a search process at certain times may accelerate the finding of a target. In the case of a classical diffusing particle trapped in a potential well, stochastic resetting may…
Discontinuous dynamical systems with grazing solutions are discussed. The group property, continuation of solutions, continuity and smoothness of motions are thoroughly analyzed. A variational system around a grazing solution which depends…
A general theory of innovation and progress in human society is outlined, based on the combat between two opposite forces (conservatism/inertia and speculative herding "bubble" behavior). We contend that human affairs are characterized by…
We introduce a modified model of random walk, and then develop two novel clustering algorithms based on it. In the algorithms, each data point in a dataset is considered as a particle which can move at random in space according to the…
Recent findings from a user study suggest that IR-based bug localization techniques do not perform well if the bug report lacks rich structured information such as relevant program entity names. On the contrary, excessive structured…
We study an Eulerian walker on a square lattice, starting from an initially randomly oriented background using Monte Carlo simulations. We present evidence that, that, for large number of steps $N$, the asymptotic shape of the set of sites…
Among random sampling methods, Markov Chain Monte Carlo algorithms are foremost. Using a combination of analytical and numerical approaches, we study their convergence properties towards the steady state, within a random walk Metropolis…