Related papers: Evasion paths by homotopy limits
Counting the number of permutations of a given total displacement is equivalent to counting weighted Motzkin paths of a given area (Guay-Paquet and Petersen, 2014). The former combinatorial problem is still open. In this work, we show that…
We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…
The narrow escape problem concerns the time needed for a diffusing particle to exit a confining domain through a small hole in the boundary. While this problem is now well-understood, determining the escape time for a particle that must…
In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest…
The continuous limit of one dimensional discrete-time quantum walks with time- and space-dependent coefficients is investigated. A given quantum walk does not generally admit a continuous limit but some families (1-jets) of quantum walks…
In the directed setting, the spaces of directed paths between fixed initial and terminal points are the defining feature for distinguishing different directed spaces. The simplest case is when the space of directed paths is homotopy…
We study the spaces of string links and homotopy string links in an arbitrary manifold using multivariable manifold calculus of functors. We construct multi-cosimplicial models for both spaces and deduce certain convergence properties of…
Patrolling consists of scheduling perpetual movements of a collection of mobile robots, so that each point of the environment is regularly revisited by any robot in the collection. In previous research, it was assumed that all points of the…
This paper examines the degree to which an evader seeking a safe and efficient path to a target location can benefit from increasing levels of knowledge regarding one or more range-limited pursuers seeking to intercept it. Unlike previous…
Given the set of paths through a digraph, the result of uniformly deleting some vertices and identifying others along each path is coherent in such a way as to yield the set of paths through another digraph, called a \emph{path abstraction}…
We develop a new method in the computation of equivariant homotopy, which is based on the splitting of cofiber sequences associated to universal spaces in the category of equivariant spectra. In particular, we use this method to compute the…
This paper introduces a multirobot cooperation approach to solve the "pursuit evasion" problem for mobile robots that have omnidirectional vision sensors. The main characteristic of this approach is to implement a real cooperation between…
We consider a potential scattering of Bose-Hubbard dimer in 1D optical lattice. A numerical approach based on effective non-Hermitian Hamiltonian has been developed for solving the scattering problem. It allows to compute the tunneling and…
We present a novel path-integral method for the determination of time-dependent and time-averaged reaction rates in multidimensional, periodically driven escape problems at weak thermal noise. The so obtained general expressions are…
Tunneling rate is investigated in homogenous and anisotropic cosmologies. The calculations is done by two methods: Euclidean and Hamiltonian approaches. It is found that the probability decreases exponentialy as anisotropy is increased.
We investigate fluid transport in random velocity fields with unsteady drift. First, we propose to quantify fluid transport between flow regimes of different characteristic motion, by escape probability and mean residence time. We then…
We describe various path homology theories constructed for a directed hypergraph. We introduce the category of directed hypergraphs and the notion of a homotopy in this category. Also, we investigate the functoriality and the homotopy…
The $k$-th power of the adjacency matrix of a simple undirected graph represents the number of walks with length $k$ between pairs of nodes. As a walk where no node repeats, a path is a walk where each node is only visited once. The set of…
We track the trajectories of individual horocycles on the modular surface. Our tracking is constructive, and we thus \emph{effectively} establish topological transitivity and even line-transitivity for the horocyclic flow. We also describe…
The focus of this paper is on a thin obstacle problem where the obstacle is defined on the intersection between a hyper-plane $\Gamma$ in $\mathbb{R}^n$ and a periodic perforation $\mathcal{T}_\varepsilon$ of $\mathbb{R}^n$, depending on a…