Related papers: Three osculating walkers
Decoherence phenomenon has been widely studied in different types of quantum walks. In this work we show how to model decoherence inspired by percolation on staggered quantum walks. Two models of unitary noise are described: breaking…
A drop bouncing on a vertically-vibrated surface may self-propel forward by standing waves and travels along a fluid interface. This system called walking drop forms a non-quantum wave-particle association at the macroscopic scale. The…
Quantum and random walks have been shown to be equivalent in the following sense: a time-dependent random walk can be constructed such that its vertex distribution at all time instants is identical to the vertex distribution of any…
The vector space of all polygons with configurations of diagonals is endowed with an operad structure. This is the consequence of a functorial construction $\mathsf{C}$ introduced here, which takes unitary magmas $\mathcal{M}$ as input and…
We examine the question of whether a collection of random walks on a graph can be coupled so that they never collide. In particular, we show that on the complete graph on n vertices, with or without loops, there is a Markovian coupling…
When identical particles on a line collide, they merge and continue as one. Exact determinantal formulas have long been available for particles conditioned never to collide, but collisions change the number of particles, and exact…
This paper is a sequel to Chaika and Krishnan [arXiv:1612.00434]. We again consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice Z^d. We assume that once walks meet, they…
Quantum walks have emerged as an interesting alternative to the usual circuit model for quantum computing. While still universal for quantum computing, the quantum walk model has very different physical requirements, which lends itself more…
Models of spatially homogeneous walks in the quarter plane ${\bf Z}_+^{2}$ with steps taken from a subset $\mathcal{S}$ of the set of jumps to the eight nearest neighbors are considered. The generating function $(x,y,z)\mapsto Q(x,y;z)$ of…
Intractable phase dynamics often challenge our understanding of complex oscillatory systems, hindering the exploration of synchronisation, chaos, and emergent phenomena across diverse fields. We introduce a novel conceptual framework for…
In the past fifteen years, the enumeration of lattice walks with steps takenin a prescribed set S and confined to a given cone, especially the firstquadrant of the plane, has been intensely studied. As a result, the generating functions…
In this paper, we consider the problem of avoiding a single vincular pattern of length three by derangements in the flattened sense and find explicit formulas for the generating functions enumerating members of each corresponding avoidance…
We report a new type of fluid-based driven dissipative oscillator system consisting of a lattice of millimetric fluid droplets bouncing on a vertically vibrating liquid bath and bound within an annular ring. We characterize the system…
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…
We call a topological ordering of a weighted directed acyclic graph non-negative if the sum of weights on the vertices in any prefix of the ordering is non-negative. We investigate two processes for constructing non-negative topological…
Sufficient conditions for synchronization of coupled Lienard-type oscillators are investigated via averaging technique. Coupling considered here is pairwise, unidirectional, and described by a nonlinear function (whose graph resides in the…
The number of excursions (finite paths starting and ending at the origin) having a given number of steps and obeying various geometric constraints is a classical topic of combinatorics and probability theory. We prove that the sequence…
In this paper we compute the generating function of modular, $k$-noncrossing diagrams. A $k$-noncrossing diagram is called modular if it does not contains any isolated arcs and any arc has length at least four. Modular diagrams represent…
Consideration is given to the continuous-time supercritical branching random walk over a multidimensional lattice with a finite number of particle generation sources of the same intensity both with and without constraint on the variance of…
In this article, we investigate the convergence behavior of two classes of gathering protocols with fixed circulant topologies using tools from dynamical systems. Given a fixed number of mobile entities moving in the Euclidean plane, we…