Related papers: Directed and irreversible path in Euclidean spaces

We show that, in almost every $n$-vertex random directed graph process, a copy of every possible $n$-vertex oriented cycle will appear strictly before a directed Hamilton cycle does, except of course for the directed cycle itself.…

Let E be an arbitrary directed graph with no restrictions on the number of vertices and edges and let K be any field. We give necessary and sufficient conditions for the Leavitt path algebra L_K(E) to be of countable irreducible…

Common sense suggests that a particle must have a definite origin if its full path information is available. In quantum mechanics, the knowledge of path information is captured through the well-established duality relation between path…

We introduce a new construction of the Uniform Infinite Planar Quadrangulation (UIPQ). Our approach is based on an extension of the Cori-Vauquelin-Schaeffer mapping in the context of infinite trees, in the spirit of previous work. However,…

Bidirected graphs are multigraphs where every edge has an independent direction at each end. In the paper, with an arbitrary bidirected graph we associate a non-negative integral quadratic form (called the incidence form of the graph), and…

Let X be a Hausdorff quotient of a standard space (that is of a locally compact separable metric space). It is shown that the following are equivalent: (i) X is the image of an irreducible quotient map from a standard space; (ii) X has a…

We want to investigate 'spaces' where paths have a 'weight', or 'cost', expressing length, duration, price, energy, etc. The weight function is not assumed to be invariant up to path-reversion. Thus, 'weighted algebraic topology' can be…

In 2000 Constantin showed that the incompressible Euler equations can be written in an "Eulerian-Lagrangian" form which involves the back-to-labels map (the inverse of the trajectory map for each fixed time). In the same paper a local…

The transition from reversible microdynamics to irreversible transport can be studied very efficiently with the help of the so-called projection method. We give a concise introduction to that method, illustrate its power by using it to…

We consider a directed percolation process on an ${\cal M}$ x ${\cal N}$ rectangular lattice whose vertical edges are directed upward with an occupation probability y and horizontal edges directed toward the right with occupation…

We classify all solutions (p,q) to the equation p(u)q(u)=p(u+b)q(u+a) where p and q are complex polynomials in one indeterminate u, and a and b are fixed but arbitrary complex numbers. This equation is a special case of a system of…

Powerspaces of directed spaces play an important role in modeling the semantics of nondeterministic functional programming languages. The notions of upper,lower and convex powerspace of a directed space are defined by the way of free…

We investigate two approximation relations on a T0 topological space, the n-approximation, and the d-approximation, which are generalizations of the way-below relation on a dcpo. Different kinds of continuous spaces are defined by the two…

We define directional recurrence for infinite measure preserving Z^d actions both intrinsically and via the unit suspension flow and prove that the two definitions are equivalent. We study the structure of the set of recurrent directions…

Consider transportation of one distribution of mass onto another, chosen to optimize the total expected cost, where cost per unit mass transported from x to y is given by a smooth function c(x,y). If the source density f^+(x) is bounded…

We construct new unbounded invariant distances on the universal cover of certain Legendrian isotopy classes. This is the first instance where unboundedness of an invariant distance is obtained without assuming the existence of a positive…

Given a set of points in the Euclidean space $\mathbb{R}^\ell$ with $\ell>1$, the pairwise distances between the points are determined by their spatial location and the metric $d$ that we endow $\mathbb{R}^\ell$ with. Hence, the distance…

We prove that every 3-connected planar graph on $n$ vertices contains an induced path on $\Omega(\log n)$ vertices, which is best possible and improves the best known lower bound by a multiplicative factor of $\log \log n$. We deduce that…

We study semi-infinite paths of the radial spanning tree (RST) of a Poisson point process in the plane. We first show that the expectation of the number of intersection points between semi-infinite paths and the sphere with radius $r$ grows…

We study directed sets definable in o-minimal structures, showing that in expansions of ordered fields these admit cofinal definable curves, as well as a suitable analogue in expansions of ordered groups, and furthermore that no analogue…