Related papers: Semigroups for flows on limits of graphs

We survey recent generalizations and improvements of the linear programming method that involve semidefinite programming. A general framework using group representations and tools from graph theory is provided.

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…

Paper proposes a model of large networks based on a random preferential attachment graph with addition of complete subgraphs (cliques). The proposed model refers to models of random graphs following the nonlinear preferential attachment…

We generalize the notion of quasirandom which concerns a class of equivalent properties that random graphs satisfy. We show that the convergence of a graph sequence under the spectral distance is equivalent to the convergence using the…

This document gives a list of finite semigroups that are interesting from the point of view of Krohn-Rhodes complexity theory. The list will be expanded and updates as "time goes by".

The aim of this paper is to obtain an asymptotic expansion for ergodic integrals of translation flows on flat surfaces of higher genus (Theorem 1) and to give a limit theorem for these flows (Theorem 2).

This article is an introduction to the basic generalized category theory used in recent work on an extension of the theory of categories and categorical logic, including parts of topos theory. We discuss functors, equivalences, natural…

We present a semi-Lagrangian scheme for the approximation of a class of Hamilton-Jacobi-Bellman equations on networks. The scheme is explicit and stable under some technical conditions. We prove a convergence theorem and some error…

We investigate flows on graphs whose links have random capacities. For binary trees we derive the probability distribution for the maximal flow from the root to a leaf, and show that for infinite trees it vanishes beyond a certain threshold…

We consider the approximation to an abstract evolution problem with inhomogeneous side constraint using $A$-stable Runge-Kutta methods. We derive a priori estimates in norms other than the underlying Banach space. Most notably, we derive…

Path and boundary-path groupoids of finitely aligned higher-rank graphs are often constructed using either filters or graph morphisms. We generalise the graph morphism approach to finitely aligned P-graphs where (Q, P) is a weakly…

We investigate numerically and analytically Potts models on ``thin'' random graphs -- generic Feynman diagrams, using the idea that such models may be expressed as the N --> 1 limit of a matrix model. The thin random graphs in this limit…

In this paper we introduce and study a certain type of sub semi-group of $\mathbb{R}/\mathbb{Z}$ which turns out to be closely related to \sz's theorem on arithmetic progressions.

We couple projective limits of probability measures to direct limits of their symmetry groups. We show that the direct limit group is the group of symmetries of the projective limit probability measure. If projective systems of probability…

I introduce a new approach to the maximum flow problem by a simple algorithm with a slightly better runtime. This approach is based on sorting arcs insight of vertices on a residual graph. This new approach leads to an O(mn^0.5) time bound…

In this study we introduce the notions of semi-homotopy of semi-continuous maps and of semi-paths. We also construct a group structure, which will be called semi-fundamental group, using semi-loops and explore some properties of…

We present elements of a typing theory for flow networks, where "types", "typings", and "type inference" are formulated in terms of familiar notions from polyhedral analysis and convex optimization. Based on this typing theory, we develop…

We develop a theory of \emph{Katetov functors} which provide a uniform way of constructing Fraisse limits. Among applications, we present short proofs and improvements of several recent results on the structure of the group of automorphisms…

The paper begins by exploring the various definitions of norms on semigroups and then presents a new definition of a normed semigroup. The properties of normed semigroups in the new sense are investigated. The new definition of the norm is…

Power grids are undergoing major changes from a few large producers to smart grids build upon renewable energies. Mathematical models for power grid dynamics have to be adapted to capture, when dynamic nodes can achieve synchronization to a…