Two time distribution in Brownian directed percolation

In the zero temperature Brownian semi-discrete directed polymer we study the joint distribution of two last-passage times at positions ordered in the time-like direction. This is the situation when we have the slow de-correlation phenomenon. We compute the limiting joint distribution function in a scaling limit. This limiting distribution is given by an expansion in determinants which is not a Fredholm expansion. A somewhat similar looking formula was derived non-rigorously in a related model by Dotsenko.Comment: 40 pages. In the second version some errors have been corrected and some extra material has been adde

Directed Continuous-Time Random Walk with memory

We propose a new Directed Continuous-Time Random Walk (CTRW) model with memory. As CTRW trajectory consists of spatial jumps preceded by waiting times, in Directed CTRW, we consider the case with only positive spatial jumps. Moreover, we consider the memory in the model as each spatial jump depends on the previous one. Our model is motivated by the financial application of the CTRW presented in [Phys. Rev. E 82:046119][Eur. Phys. J. B 90:50]. As CTRW can successfully describe the short term negative autocorrelation of returns in high-frequency financial data (caused by the bid-ask bounce phenomena), we asked ourselves to what extent the observed long-term autocorrelation of absolute values of returns can be explained by the same phenomena. It turned out that the bid-ask bounce can be responsible only for the small fraction of the memory observed in the high-frequency financial data

Continuous-Time Quantum Walks on Directed Bipartite Graphs

This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by tuning a model parameter $\alpha$. We provide analytic solutions to the quantum walks for the star and circulant graph classes that are valid for an arbitrary value of the number of nodes $N$, time $t$ and the model parameter $\alpha$. We discuss quantitative and qualitative aspects of quantum walks based on directed graphs and their undirected counterparts. Numerical simulations of quantum walks on circulant graphs show complex interference phenomena and how complete suppression of transport is achieved near $\alpha=\pi/2$. By proving two mirror symmetries around $\alpha=0$ and $\pi/2$ we show that these quantum walks have a period of $\pi$ in $\alpha$. We show that undirected edges lose their effect on the quantum walk at $\alpha=\pi/2$ and present non-bipartite graphs that exhibit suppression of transport. Finally, we analytically compute the Hamiltonians of quantum walks on the directed ring graph.Comment: 10 pages, 3 figure

Directed current due to broken time-space symmetry

We consider the classical dynamics of a particle in a one-dimensional space-periodic potential U(X) = U(X+2\pi) under the influence of a time-periodic space-homogeneous external field E(t)=E(t+T). If E(t) is neither symmetric function of t nor antisymmetric under time shifts $E(t \pm T/2) \neq -E(t)$, an ensemble of trajectories with zero current at t=0 yields a nonzero finite current as $t\to \infty$. We explain this effect using symmetry considerations and perturbation theory. Finally we add dissipation (friction) and demonstrate that the resulting set of attractors keeps the broken symmetry property in the basins of attraction and leads to directed currents as well.Comment: 2 figure

Reasoning about goal-directed real-time teleo-reactive programs

The teleo-reactive programming model is a high-level approach to developing real-time systems that supports hierarchical composition and durative actions. The model is different from frameworks such as action systems, timed automata and TLA+, and allows programs to be more compact and descriptive of their intended behaviour. Teleo-reactive programs are particularly useful for implementing controllers for autonomous agents that must react robustly to their dynamically changing environments. In this paper, we develop a real-time logic that is based on Duration Calculus and use this logic to formalise the semantics of teleo-reactive programs. We develop rely/guarantee rules that facilitate reasoning about a program and its environment in a compositional manner. We present several theorems for simplifying proofs of teleo-reactive programs and present a partially mechanised method for proving progress properties of goal-directed agents. © 2013 British Computer Society

An Algorithmic Metatheorem for Directed Treewidth

The notion of directed treewidth was introduced by Johnson, Robertson, Seymour and Thomas [Journal of Combinatorial Theory, Series B, Vol 82, 2001] as a first step towards an algorithmic metatheory for digraphs. They showed that some NP-complete properties such as Hamiltonicity can be decided in polynomial time on digraphs of constant directed treewidth. Nevertheless, despite more than one decade of intensive research, the list of hard combinatorial problems that are known to be solvable in polynomial time when restricted to digraphs of constant directed treewidth has remained scarce. In this work we enrich this list by providing for the first time an algorithmic metatheorem connecting the monadic second order logic of graphs to directed treewidth. We show that most of the known positive algorithmic results for digraphs of constant directed treewidth can be reformulated in terms of our metatheorem. Additionally, we show how to use our metatheorem to provide polynomial time algorithms for two classes of combinatorial problems that have not yet been studied in the context of directed width measures. More precisely, for each fixed $k,w \in \mathbb{N}$, we show how to count in polynomial time on digraphs of directed treewidth $w$, the number of minimum spanning strong subgraphs that are the union of $k$ directed paths, and the number of maximal subgraphs that are the union of $k$ directed paths and satisfy a given minor closed property. To prove our metatheorem we devise two technical tools which we believe to be of independent interest. First, we introduce the notion of tree-zig-zag number of a digraph, a new directed width measure that is at most a constant times directed treewidth. Second, we introduce the notion of $z$-saturated tree slice language, a new formalism for the specification and manipulation of infinite sets of digraphs.Comment: 41 pages, 6 figures, Accepted to Discrete Applied Mathematic

DeNet: Scalable Real-time Object Detection with Directed Sparse Sampling

We define the object detection from imagery problem as estimating a very large but extremely sparse bounding box dependent probability distribution. Subsequently we identify a sparse distribution estimation scheme, Directed Sparse Sampling, and employ it in a single end-to-end CNN based detection model. This methodology extends and formalizes previous state-of-the-art detection models with an additional emphasis on high evaluation rates and reduced manual engineering. We introduce two novelties, a corner based region-of-interest estimator and a deconvolution based CNN model. The resulting model is scene adaptive, does not require manually defined reference bounding boxes and produces highly competitive results on MSCOCO, Pascal VOC 2007 and Pascal VOC 2012 with real-time evaluation rates. Further analysis suggests our model performs particularly well when finegrained object localization is desirable. We argue that this advantage stems from the significantly larger set of available regions-of-interest relative to other methods. Source-code is available from: https://github.com/lachlants/denetComment: 8 pages, ICCV2017 (poster