Related papers: Determinism in the one-way model
Starting from the instability diagram of a traffic flow model, we derive conditions for the occurrence of congested traffic states, their appearance, their spreading in space and time, and the related increase in travel times. We discuss…
In this work we consider a generalization of graph flows. A graph flow is, in its simplest formulation, a labeling of the directed edges with real numbers subject to various constraints. A common constraint is conservation in a vertex,…
A discrete model of traffic on a multilane road is considered. The traffic is presented as particles movement with a deterministic component and a stochastic one. Formulas for the traffic characteristics have been found. The model can…
We define a broad class of deterministic stream functions and show they can be implemented as homomorphisms into a "state" monoid. The homomorphism laws are simpler than the conditions of previous semantic frameworks for stream program…
We analyze the steady-state flow as a function of the initial density for a class of deterministic cellular automata rules (``traffic rules'') with periodic boundary conditions [H. Fuks and N. Boccara, Int. J. Mod. Phys. C 9, 1 (1998)]. We…
This article is the complement to [quant-ph/0611284], which proves that flows (as introduced by [quant-ph/0506062]) can be found efficiently for patterns in the one-way measurement model which have non-empty input and output subsystems of…
In this paper, we investigate the stationary profiles of a convection-diffusion model for unidirectional pedestrian flows in domains with a single entrance and exit. The inflow and outflow conditions at both the entrance and exit as well as…
We consider graph states of arbitrary number of particles undergoing generic decoherence. We present methods to obtain lower and upper bounds for the system's entanglement in terms of that of considerably smaller subsystems. For an…
The program dependence graph (PDG) represents data and control dependence between statements in a program. This paper presents an operational semantics of program dependence graphs. Since PDGs exclude artificial order of statements that…
We introduce and study a deterministic lattice model describing the motion of an infinite system of oppositely charged particles under the action of a constant electric field. As an application this model represents a traffic flow of cars…
Deterministic two-way transducers define the robust class of regular functions which is, among other good properties, closed under composition. However, the best known algorithms for composing two-way transducers cause a double exponential…
Deterministic equilibrium flows in transport networks can be investigated by means of Markov's processes defined on the dual graph representations of the network. Sustained movement patterns are generated by a subset of automorphisms of the…
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to…
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to…
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to…
We consider a stochastic flow driven by a finite dimensional Brownian motion. We show that almost every realization of such a flow exhibits strong statistical properties such as the exponential convergence of an initial measure to the…
Assignment flows denote a class of dynamical models for contextual data labeling (classification) on graphs. We derive a novel parametrization of assignment flows that reveals how the underlying information geometry induces two processes…
Random graphs offer a useful mathematical representation of a variety of real world complex networks. Exponential random graphs, for example, are particularly suited towards generating random graphs constrained to have specified statistical…
We introduce action-driven flows for causal variational principles, being a class of non-convex variational problems emanating from applications in fundamental physics. In the compact setting, H\"older continuous curves of measures are…
We study the thermodynamic formalism for suspension flows over countable Markov shifts with roof functions not necessarily bounded away from zero. We establish conditions to ensure the existence and uniqueness of equilibrium measures for…