Related papers: Algebraic flow theory of infinite graphs

The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…

We study mean curvature flows in a warped product manifold defined by a closed Riemannian manifold and $\mathbb{R}$. In such a warped product manifold, we can define the notion of a graph, called a geodesic graph. We prove that the curve…

This paper gives a framework to study a continuum limit of a gradient flow on a graph where the number of vertices increases in an appropriate way. As examples we prove the convergence of a discrete total variation flow and a discrete…

We consider AF-flows, i.e., one-parameter automorphism groups of a unital simple C*-algebra which leave invariant the dense union of an increasing sequence of finite-dimensional *-subalgebras, and derive two properties for these; an absence…

Among the well-known sufficient degree conditions for the Hamiltonicity of a finite graph, the condition of Asratian and Khachatrian is the weakest and thus gives the strongest result. Diestel conjectured that it should extend to locally…

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,…

Let $S,T$ be two distinct finite Abelian groups with $|S|=|T|$. A fundamental theorem of Tutte shows that a graph admits a nowhere-zero $S$-flow if and only if it admits a nowhere-zero $T$-flow. Jaeger, Linial, Payan and Tarsi in 1992…

We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…

G\'abor Elek introduced the notion of a hyperfinite graph family: a collection of graphs is hypefinite if for every $\epsilon>0$ there is some finite $k$ such that each graph $G$ in the collection can be broken into connected components of…

Lov\'{a}sz et al. proved that every $6$-edge-connected graph has a nowhere-zero $3$-flow. In fact, they proved a more technical statement which says that there exists a nowhere zero $3$-flow that extends the flow prescribed on the incident…

In this paper we consider a ``flow'' of nonparametric solutions of the volume constrained Plateau problem with respect to a convex planar curve. Existence and regularity is obtained from standard elliptic theory, and convexity results for…

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…

In classical potential theory, one can solve the Dirichlet problem on unbounded domains such as the upper half plane. These domains have two types of boundary points; the usual finite boundary points and another point at infinity. W. Woess…

The well-known characterization of two-ended groups says that every two-ended group can be split over finite subgroups which means it is isomorphic to either by a free product with amalgamation $A\ast_C B$ or an HNN-extension $\ast_{\phi}…

We study graphs with nonnegative Bakry-\'Emery curvature or Ollivier curvature outside a finite subset. For such a graph, via introducing the discrete Gromov-Hausdorff convergence we prove that the space of bounded harmonic functions is…

We develop an abstract theory of flows of geometric $H$-structures, i.e., flows of tensor fields defining $H$-reductions of the frame bundle, for a closed and connected subgroup $H\subset SO(n)$, on any connected and oriented $n$-manifold…

We develop a clear connection between deFinetti's theorem for exchangeable arrays (work of Aldous--Hoover--Kallenberg) and the emerging area of graph limits (work of Lovasz and many coauthors). Along the way, we translate the graph theory…

We note that the deep results of Grunewald and Segal on algorithmic problems for arithmetic groups imply the decidability of several matrix equivalence problems involving poset-blocked matrices over Z. Consequently, results of Eilers,…

In this paper we propose a spectral flow for graph Laplacians, and prove that it counts the number of nodal domains for a given Laplace eigenvector. This extends work done for Laplacians on $\mathbb{R}^n$ to the graph setting. We mention…

We give a sufficient condition on totally disconnected topological graphs such that their associated topological graph algebras are purely infinite.