Related papers: Semigroups for flows on limits of graphs

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…

We present the operator semigroups approach to first- and second-order dynamical systems taking place on metric graphs. We briefly survey the existing results and focus on the well-posedness of the problems with standard vertex conditions.…

In this work, we study good semigroups of $\mathbb{N}^n$ introducing the definition of length and genus for these objects. We show how to count the local good semigroup with a fixed genus. Furthermore, we study the relationships of these…

We give a number of approximation metatheorems for monotone maximization problems expressible in the first-order logic, in substantially more general settings than the previously known. We obtain * constant-factor approximation algorithm in…

We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…

We recently introduced a formalism for the modeling of temporal networks, that we call stream graphs. It emphasizes the streaming nature of data and allows rigorous definitions of many important concepts generalizing classical graphs. This…

We use semigroup theory to describe the group of automorphisms of some semigroups of interest in holomorphic dynamical systems. We show, with some examples, that representation theory of semigroups is related to usual constructions in…

We prove an approximate spectral theorem for non-self-adjoint operators and investigate its applications to second order differential operators in the semi-classical limit. This leads to the construction of a twisted FBI transform. We also…

We refine the construction of quasi-homomorphisms on mapping class groups. It is useful to know that there are unbounded quasi-homomorphisms which are bounded when restricted to particular subgroups since then one deduces that the mapping…

Directed graphs have long been used to gain understanding of the structure of semigroups, and recently the structure of directed graph semigroups has been investigated resulting in a characterization theorem and an analog of Fruct's…

We combine Gromov's amenable localization technique with the Poincar\'{e} duality to study the traversally generic vector flows on smooth compact manifolds $X$ with boundary. Such flows generate well-understood stratifications of $X$ by the…

We study semigroups of labellings associated to a graph. These generalize the Jukes-Cantor model and phylogenetic toric varieties defined by Buczy\'nska. Our main theorem bounds the degree of the generators of the semigroup by g+1 when the…

We give a self-contained and streamlined exposition of a generation theorem for C0-semigroups based on the method of boundary triplets. We apply this theorem to port-Hamiltonian systems where we discuss recent results appearing in stability…

We classify the finite quasisimple groups whose commuting graph is perfect and we give a general structure theorem for finite groups whose commuting graph is perfect.

We construct p.m.p. group actions that are not local-global limits of sequences of finite graphs. Moreover, they do not weakly contain any sequence of finite labeled graphs. Our methods are based on the study of almost automorphisms of…

In this manuscript we review new ideas and first results on application of the Graphical Models approach, originated from Statistical Physics, Information Theory, Computer Science and Machine Learning, to optimization problems of network…

We introduce the notion of a generalized flow on a graph with coefficients in a R-representation and show that the module of flows is isomorphic to the first derived functor of the colimit. We generalize Kirchhoff's laws and build an exact…

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…

Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…

We classify certain sofic shifts (the irreducible Point Extension Type, or PET, sofic shifts) up to flow equivalence, using invariants of the canonical Fischer cover. There are two main ingredients: (1) An extension theorem, for extending…