Related papers: Flows on Bidirected Graphs

In ultra-pure conductors, collective motion of charge carriers at relatively high temperatures may become hydrodynamic such that electronic transport may be described similarly to a viscous flow. In confined geometries (e.g., in ultra-high…

The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the zeros of the Tutte polynomials of graphs, and show that they form a…

The massless flow between successive minimal models of conformal field theory is related to a flow within the sine-Gordon model when the coefficient of the cosine potential is imaginary. This flow is studied, partly numerically, from three…

This paper introduces the notions of vector field and flow on a general differentiable stack. Our main theorem states that the flow of a vector field on a compact proper differentiable stack exists and is unique up to a uniquely determined…

We consider undirected graphs that arise as deterministic functions of stationary point processes such that each point has degree bounded by two. For a large class of point processes and edge-drawing rules, we show that the arising graph…

An orientation of a graph is semi-transitive if it contains no directed cycles and has no shortcuts. An undirected graph is semi-transitive if it can be oriented in a semi-transitive manner. The class of semi-transitive graphs includes…

The Fan-Raspaud Conjecture states that every bridgeless cubic graph has three 1-factors with empty intersection. A weaker one than this conjecture is that every bridgeless cubic graph has two 1-factors and one join with empty intersection.…

Consider an arbitrary closed, countably $n$-rectifiable set in a strictly convex $(n+1)$-dimensional domain, and suppose that the set has finite $n$-dimensional Hausdorff measure and the complement is not connected. Starting from this given…

Bidirected graphs generalize directed and undirected graphs in that edges are oriented locally at every node. The natural notion of the degree of a node that takes into account (local) orientations is that of net-degree. In this paper, we…

We describe all possible topological structures of Morse flows and typical gradient saddle-nod bifurcation of flows on the 2-dimensional torus with a hole in the case that the number of singular point of flows is at most six. To describe…

We prove the existence of the flow by curvature of regular planar networks starting from an initial network which is non-regular. The proof relies on a monotonicity formula for expanding solutions and a local regularity result for the…

Let $G$ be a finite group and $\chi: G \rightarrow \mathbb{C}$ a class function. Let $H = (V,E)$ be a directed graph with for each vertex a cyclic order of the edges incident to it. The cyclic orders give a collection $F$ of faces of $H$.…

Let M be a non-orientable compact 2-manifold of genus 4. Then there exists a family of quasi-minimal, Kupka-Smale smooth vector fields X_r in M, depending smoothly on 0<=r<e, such that, for some flow box V in M of X_0, and for all 0<=r,v<e,…

Lov\'asz has completely characterised the structure of graphs with no two vertex-disjoint cycles, while Slilaty has given a structural characterisation of graphs with no two vertex-disjoint odd cycles; his result is in fact more general,…

In this paper, we introduce a new parabolic equation on K\"ahler manifolds. The static point of this flow is related to the existence of a lower bound of the Mabuchi energy. In this paper, we prove the flow always exists for all times for…

In this work we establish that finite directed graphs give rise to semiflows on the power set of their nodes. We analyze the topological dynamics for semiflows on finite directed graphs by characterizing Morse decompositions, recurrence…

Given a directed graph $G = (V, E)$ with $n$ vertices, $m$ edges and a designated source vertex $s\in V$, we consider the question of finding a sparse subgraph $H$ of $G$ that preserves the flow from $s$ up to a given threshold $\lambda$…

\emph{Bidirected graphs} (a sort of nonstandard graphs introduced by Edmonds and Johnson) provide a natural generalization to the notions of directed and undirected graphs. By a \emph{weakly (node- or edge-) acyclic} bidirected graph we…

We prove that, in a two-dimensional strip, a steady flow of an ideal incompressible fluid with no stationary point and tangential boundary conditions is a shear flow. The same conclusion holds for a bounded steady flow in a half-plane. The…

We consider network models where information items flow %are sent from a source to a sink node. We start with a model where routing is constrained by energy available on nodes in finite supply (like in Smartdust) and efficiency is related…