Related papers: Semigroups for flows on limits of graphs
We study transport processes on infinite metric graphs with non-constant velocities and matrix boundary conditions in the $\\mathrm{L}^{\infty}$-setting. We apply the theory of bi-continuous operator semigroups to obtain well-posedness of…
In this paper, we introduce formulations of the Trotter Kato theorem for approximation of bi continuous semigroups that provide a useful framework whenever convergence of numerical approximations to solutions of PDEs are studied with…
We prove a limit theorem for quantum stochastic differential equations with unbounded coefficients which extends the Trotter-Kato theorem for contraction semigroups. From this theorem, general results on the convergence of approximations…
We introduce a special class of real semiflows, which is used to define a general type of evolution semigroups, associated to not necessarily exponentially bounded evolution families. Giving spectral characterizations of the corresponding…
Models describing transport and diffusion processes occurring along the edges of a graph and interlinked by its vertices have been recently receiving a considerable attention. In this paper we generalize such models and consider a network…
We construct a flow of continuous time and discrete state branching processes. Some scaling limit theorems for the flow are proved, which lead to the path-valued branching processes and nonlocal branching superprocesses over the positive…
A self-contained account of the theory of structure trees for edge cuts in networks is given. Applications include a generalisation of the Max-Flow Min-Cut Theorem to infinite networks and a short proof of a conjecture of Kropholler. This…
We construct two kinds of stochastic flows of discrete Galton-Watson branching processes. Some scaling limit theorems for the flows are proved, which lead to local and nonlocal branching superprocesses over the positive half line.
We study the limit theory of large threshold graphs and apply this to a variety of models for random threshold graphs. The results give a nice set of examples for the emerging theory of graph limits.
The celebrated Trotter approximation theorem provides a sufficient condition for the convergence of a sequence of operator semigroups in terms of the corresponding sequence of infinitesimal generators. There exist a few results on the rate…
The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…
The theory of graph limits is only understood to any nontrivial degree in the cases of dense graphs and of bounded degree graphs. There is, however, a lot of interest in the intermediate cases. It appears that the most important…
We introduce the notions "virtual automorphism group" of a minimal flow and "semi-regular flow" and investigate the relationship between the virtual and actual group of automorphisms.
The theory of flows was used as a crucial tool in the recent proof by Margolis, Rhodes and Schilling that Krohn-Rhodes complexity is decidable. In this paper we begin a systematic study of aperiodic flows. We give the foundations of the…
In this work, we establish a Trotter-Kato type theorem. More precisely, we characterize the convergence in distribution of Feller processes by examining the convergence of their generators. The main novelty lies in providing quantitative…
Graph theory provides a language for studying the structure of relations, and it is often used to study interactions over time too. However, it poorly captures the both temporal and structural nature of interactions, that calls for a…
We use the theory of graph limits to study several quasi-random properties, mainly dealing with various versions of hereditary subgraph counts. The main idea is to transfer the properties of (sequences of) graphs to properties of graphons,…
In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…
This paper uses a net-theoretic approach to convergence spaces, aimed to simplify the description of continuous convergence in order to apply it in problems concerning Homotopy Theory. We present methods for handling homotopies of limit…
In contrast to classical strongly continuous semigroups, the study of bi-continuous semigroups comes with some freedom in the properties of the associated locally convex topology. This paper aims to give minimal assumptions in order to…