Related papers: Flows of linear orders on sparse graphs
We show that solutions to certain higher-order intrinsic geometric flows on a compact manifold, including some flows generated by the ambient obstruction tensor, are unique. With the goal of providing a complete self-contained proof,…
We consider limit probabilities of first order properties in random graphs with a given degree sequence. Under mild conditions on the degree sequence, we show that the closure set of limit probabilities is a finite union of closed…
We classify five dimensional Anosov flows with smooth decomposition which are in addition transversely symplectic. Up to finite covers and a special time change, we find exectly the suspensions of symplectic hyperbolic automorphisms of four…
Our first purpose is to study the stability of linear flows on real, connected, compact, semisimple Lie groups. After, we study and classify periodic orbits of linear and invariant flows. In particular, we obtain a version of…
The paper proves two theorems concerning the set of periods of periodic orbits for maps of graphs that are homotopic to the constant map and such that the vertices form a periodic orbit. The first result is that if $v$ is not a divisor of…
We describe an algorithm for finding Hamilton cycles in random graphs. Our model is the random graph $G=\gc$. In this model $G$ is drawn uniformly from graphs with vertex set $[n]$, $m$ edges and minimum degree at least three. We focus on…
We prove that every sectional Anosov flow (or, equivalently, every sectional-hyperbolic attracting set of a flow) on a compact manifold has a periodic orbit. This extends the previous three-dimensional result obtained in [Existence of…
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. The rest of the nodes are hidden, and do not provide any…
We study nontrivial entropy invariants in the class of parabolic flows on homogeneous spaces, quasi-unipotent flows. We show that topological complexity (ie, slow entropy) can be computed directly from the Jordan block structure of the…
We investigate the structure of a digraph having a transitive automorphism group where every cutset of minimal cardinality consists of all successors or all predecessors of some vertex. We improve most of the existing results in this area.
The main result of this article is that if a $3$-manifold $M$ supports an Anosov flow, then the number of conjugacy classes in the fundamental group of $M$ grows exponentially fast with the length of the shortest orbit representative,…
Small particles transported by a fluid medium do not necessarily have to follow the flow. We show that for a wide class of time-periodic incompressible flows inertial particles have a tendency to spontaneously align in one-dimensional…
This paper represents a significant leap forward in the problem of enumerating vertex-transitive graphs. Recent breakthroughs on symmetry of Cayley (di)graphs show that almost all finite Cayley (di)graphs have the smallest possible…
The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by…
Hamiltonian flows on compact surfaces are characterized, and the topological invariants of such flows with finitely many singular points are constructed from the viewpoints of integrable systems, fluid mechanics, and dynamical systems.…
We consider a short exact sequence $1\to H\to G\to K\to 1$ of Polish groups and consider what can be deduced about the dynamics of $G$ given information about the dynamics of $H$ and $K$. We prove that if the respective universal minimal…
In 2005, Kechris, Pestov and Todorcevic provided a powerful tool to compute an invariant of topological groups known as the universal minimal flow, immediately leading to an explicit representation of this invariant in many concrete cases.…
We consider sufficient conditions for the existence of $k$-th powers of Hamiltonian cycles in $n$-vertex graphs $G$ with minimum degree $\mu n$ for arbitrarily small $\mu>0$. About 20 years ago Koml\'os, Sark\"ozy, and Szemer\'edi resolved…
We characterise connected cubic graphs admitting a vertex- transitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a…
We classify all group topologies coarser than the topology of stabilizers of finite sets in the case of automorphism groups of countable free-homogeneous structures, Urysohn space and Urysohn sphere, among other related results.