Related papers: Directed Transit Functions
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…
For a fixed set $X$, an arbitrary \textit{weight structure} $d \in [0,\infty]^{X \times X}$ can be interpreted as a distance assignment between pairs of points on $X$. Restrictions (i.e. \textit{metric axioms}) on the behaviour of any such…
Public transit is an essential infrastructure enabling access to employment, healthcare, education, and recreational facilities. While accessibility to transit is important in general, some sections of the population depend critically on…
Let $(X,d)$ be a metric space and $f_{1,\infty}=\{f_n\}_{i=0}^{\infty}$ be a sequence of continuous maps $f_n:X\rightarrow X$ such that $(f_n)$ converges uniformly to a continuous map $f$. We investigate which conditions ensure that the…
In this survey article we consider the directed last-passage percolation model on the planar square lattice with nearest-neighbor steps and general i.i.d. weights on the vertices, outside of the class of exactly solvable models. We show how…
The evolution of many kinetic processes in 1+1 (space-time) dimensions results in 2d directed percolative landscapes. The active phases of these models possess numerous hidden geometric orders characterized by various types of large-scale…
We discuss the general transport properties of superconducting quantum point contacts. We show how these properties can be obtained from a microscopic model using nonequilibrium Green function techniques. For the case of a one-channel…
Many real-world complex systems are characterized by non-pairwise -- higher-order -- interactions among system's units, and can be effectively modeled as hypergraphs. Directed hypergraphs distinguish between source and target sets within…
A digraph that represents reasonably a scheduling problem should be a directed acyclic graph. Here down we shall deal with special kind of graded $DAGs$ named $KoDAGs$. For their definition and first primary properties see $ [1]$, where…
This is a chapter in a forthcoming book on completely regular codes in distance regular graphs. The chapter provides an overview, and some original results, on codes in distance regular graphs which admit symmetries via a permutation group…
An introduction to Leavitt path algebras of arbitrary directed graphs is presented, and direct limit techniques are developed, with which many results that had previously been proved for countable graphs can be extended to uncountable ones.…
A formally normal weighted shift on a directed tree is shown to be a bounded normal operator. The question of whether a normal extension of a subnormal weighted shift on a directed tree can be modeled as a weighted shift on some, possible…
Directed graphs naturally model systems with asymmetric, ordered relationships, essential to applications in biology, transportation, social networks, and visual understanding. Generating such graphs enables tasks such as simulation, data…
Transport phenomena in spatially periodic systems far from thermal equilibrium are considered. The main emphasize is put on directed transport in so-called Brownian motors (ratchets), i.e. a dissipative dynamics in the presence of thermal…
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the…
We introduce one dimensional sets to help describe and constrain the integral curves of an $n$ dimensional dynamical system. These curves provide more information about the system than the zero-dimensional sets (fixed points) do. In fact,…
Different observations of a relation between inputs ("sources") and outputs ("targets") are often reported in terms of histograms (discretizations of the source and the target densities). Transporting these densities to each other provides…
A walk $W=w_1w_2\dots w_k$, $k\geq 2$, is called a toll walk if $w_1\neq w_k$ and $w_2$ and $w_{k-1}$ are the only neighbors of $w_1$ and $w_k$, respectively, on $W$ in a graph $G$. A toll walk interval $T(u,v)$, $u,v\in V(G)$, contains all…
We introduce a new arc in directed graphs of integers. Among other things, we determine the positive integers that have arcs to all except a finite number of positive integers. We also propose some possible research problems at the end of…
For a given function from a set to itself, we can define a directed graph called the functional graph, where the vertices are the elements of the set, and the edges are all the pairs of inputs and outputs for the function. In this article…