Related papers: Tranched graphs: consequences for topology and dyn…
We develop a theory of type semigroups for arbitrary twisted, not necessarily Hausdorff \'etale groupoids. The type semigroup is a dynamical version of the Cuntz semigroup. We relate it to traces, ideals, pure infiniteness, and stable…
Large real-life complex networks are often modeled by various random graph constructions and hundreds of further references therein. In many cases it is not at all clear how the modeling strength of differently generated random graph model…
We show that the quantifier elimination result for the Shelah-Spencer almost sure theories of sparse random graphs $G(n,n^{-\alpha})$ given by Laskowski in $[7]$ extends to their various analogues. The analogues will be obtained as theories…
The galaxies of nonstandard enlargements of conventionally infinite as well as of transfinite graphs are defined, analyzed, and illustrated by some examples. It is then shown that any such enlargement either has exactly one galaxy, its…
A basic assumption of tiling theory is that adjacent tiles can meet in only a finite number of ways, up to rigid motions. However, there are many interesting tiling spaces that do not have this property. They have "fault lines", along which…
We conjecture a multi-parameter generalization of the toric inequalities of \cite{Czech:2023xed}. We then extend their proof methods for the generalized toric inequalities in two ways. The first extension constructs the graph corresponding…
Inspired by "quantum graphity" models for spacetime, a statistical model of graphs is proposed to explore possible realizations of emergent manifolds. Graphs with given numbers of vertices and edges are considered, governed by a very…
We introduce graphical complexes of groups, which can be thought of as a generalisation of Coxeter systems with 1-dimensional nerves. We show that these complexes are strictly developable, and we equip the resulting Basic Construction with…
We explore the connection between super $\mathcal{W}$-algebras ($\mathcal{SW}$-algebras) and $\mathrm{G}$-structures with torsion. The former are realised as symmetry algebras of strings with $\mathcal{N}=(1,0)$ supersymmetry on the…
The paper deals with Henselian valued field with analytic structure. Actually, we are focused on separated analytic structures, but the results remain valid for strictly convergent analytic ones as well. A classical example of the latter is…
We show that there exists a natural Tulczyjew triple in the dynamics of objects for which the standard kinematic configuration space $TM$, i.e. the tangent bundle, is replaced with its $n$-th exterior power, i.e. the bundle of tangent…
We examine how generalised geometries can be associated with a labelled Dynkin diagram built around a gravity line. We present a series of new generalised geometries based on the groups $\mathit{Spin}(d,d)\times\mathbb{R}^+$ for which the…
Dynamic graph theory is a novel, growing area that deals with graphs that change over time and is of great utility in modelling modern wireless, mobile and dynamic environments. As a graph evolves, possibly arbitrarily, it is challenging to…
The concept of closed trapped surface is of paramount importance in General Relativity and other gravitational theories. However, it is a purely geometrical object. With the aim of bringing this concept to closer attention by the…
This paper is a sequel of our preceding paper (N. Kita: Constructive characterization for signed analogue of critical graphs I: Principal classes of radials and semiradials. arXiv preprint, arXiv:2001.00083, 2019). In the preceding paper,…
We prove a Desch-Schappacher type perturbation theorem for one-parameter semigroups on Banach spaces which are not strongly continuous for the norm, but possess a weaker continuity property. In this paper we chose to work in the framework…
Recently, Bollob\'as, Janson and Riordan introduced a very general family of random graph models, producing inhomogeneous random graphs with $\Theta(n)$ edges. Roughly speaking, there is one model for each {\em kernel}, i.e., each symmetric…
A topological graph is \emph{$k$-quasi-planar} if it does not contain $k$ pairwise crossing edges. A topological graph is \emph{simple} if every pair of its edges intersect at most once (either at a vertex or at their intersection). In…
We collect some general results on graph limits associated to hereditary classes of graphs. As examples, we consider some classes defined by forbidden subgraphs and some classes of intersection graphs, including triangle-free graphs,…
Metric graphs are special types of metric spaces used to model and represent simple, ubiquitous, geometric relations in data such as biological networks, social networks, and road networks. We are interested in giving a qualitative…