Related papers: Flows of linear orders on sparse graphs
It is a well-known fact, that the greatest ambit for a topological group $G$ is the Samuel compactification of $G$ with respect to the right uniformity on $G.$ We apply the original destription by Samuel from 1948 to give a simple…
We study the dynamics of the geodesic and horocycle flows of the unit tangent bundle $(\hat M, T^1\mathcal{F})$ of a compact minimal lamination $(M,\mathcal F)$ by negatively curved surfaces. We give conditions under which the action of the…
In this text we (re)-tell the theory of pseudo-Anosov flows on 3-manifolds with the orbit space as the central character; via a streamlined framework called {\em Anosov-like group actions}. This brings a simplified and unified perspective,…
For exact area-preserving twist maps, curves were constructed through the gaps of cantori in \cite{MMP84}, which were conjectured to have minimal flux subject to passing through the points of the cantorus. It was pointed out by \cite{Pol}…
For a class of flows on polytopes, including many examples from Evolutionary Game Theory, we describe a piecewise linear model which encapsulates the asymptotic dynamics along the heteroclinic network formed out of the polytope's vertexes…
An integral homology theory on the category of undirected reflexive graphs was constructed in [2]. A geometrical method to understand behaviors of $1$- and $2$-simplices under differential maps of the theory was developed in [3] and led us…
Let $M$ be a closed manifold. Polterovich constructed a linear map from the vector space of quasi-morphisms on the fundamental group $\pi _{1}(M)$ of $M$ to the space of quasi-morphisms on the identity component ${\rm…
We give an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral demands, costs, and capacities in $m^{1+o(1)}$ time. Our algorithm builds the flow through a…
To capture the global structure of a dynamical system we reformulate dynamics in terms of appropriately constructed topologies, which we call flow topologies; we call this process topologization. This yields a description of a semi-flow in…
We establish short-time existence and regularity for higher-order flows generated by a class of polynomial natural tensors that, after an adjustment by the Lie derivative of the metric with respect to a suitable vector field, have strongly…
We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to…
We introduce topological invariants of semi-decompositions (e.g. filtrations, semi-group actions, multi-valued dynamical systems, combinatorial dynamical systems) on a topological space to analyze semi-decompositions from a dynamical…
We show that for every non-elementary hyperbolic group, an associated topological flow space admits a coding based on a transitive subshift of finite type. Applications include regularity results for Manhattan curves, the uniqueness of…
We give a deterministic $m^{1+o(1)}$ time algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral demands, costs, and capacities. As a consequence, we obtain the…
We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite…
In this note we examine the proportion of periodic orbits of Anosov flows that lie in an infinite zero density subset of the first homology group. We show that on a logarithmic scale we get convergence to a discrete fractal dimension.
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…
In this paper, we first establish the very close link between stability of graphs, a concept first introduced in \cite{Scapsalvi1} and studied most notably by Surowski \cite{Surowski1}, \cite{Surowski2} and Wilson \cite{Wilson01} and…
We study topological groups of monotonic autohomeomorphisms on a generalized ordered space $L$. We find a condition that is necessary and sufficient for the set of all monotonic autohomeomorphisms on $L$ along with the function composition…
For $G$ a closed subgroup of $S_{\infty}$, we provide an explicit characterization of the greatest $G$-ambit. Using this, we provide a precise characterization of when $G$ has metrizable universal minimal flow. In particular, each such…