Related papers: Network right * abundant semigroups
In causal inference on directed acyclic graphs, the orientation of edges is in general only recovered up to Markov equivalence classes. We study Markov equivalence classes of uniformly random directed acyclic graphs. Using a tower…
The configuration model was originally defined for undirected networks and has recently been extended to directed networks. Many empirical networks are however neither undirected nor completely directed, but instead usually partially…
An ordered semigroup $S$ is right $\pi$-inverse if it is $\pi$-inverse but not conversely. So the question arises under what condition the converse holds. In this paper we study nil-extensions of simple and right $\pi$-inverse ordered…
The theory of convergent graph sequences has been worked out in two extreme cases, dense graphs and bounded degree graphs. One can define convergence in terms of counting homomorphisms from fixed graphs into members of the sequence…
An amalgam of inverse semigroups [S,T,U] is full if U contains all of the idempotents of S and T. We show that for a full amalgam [S,T,U], the C*-algebra of the inverse semigroup amaglam of S and T over U is the C*-algebraic amalgam of…
A directed acyclic network is considered where all the terminals need to recover the sum of the symbols generated at all the sources. We call such a network a sum-network. It is shown that there exists a solvably (and linear solvably)…
Let $G$ be a group. The directed endomorphism graph, \dend of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex `$a$' to the vertex `$\, b$' $(a \neq b) $ if and only if there exists an endomorphism on…
We show that the fundamental groups of any two closed irreducible non-geometric graph-manifolds are quasi-isometric. This answers a question of Kapovich and Leeb. We also classify the quasi-isometry types of fundamental groups of…
We define a semidirect product groupoid of a system of partially defined local homeomorphisms $T=(T_{1},..., T_{r})$. We prove that this construction gives rise to amenable groupoids. The associated algebra is a Cuntz-like algebra. We use…
We consider the class of directed graphs with $N\geq 1$ edges and without loops shorter than $k\geq1$. Using the concept of a labelled graph, we determine graphs from this class that maximize the number of all paths of length $k$. Then we…
Directed graphs are widely used in modelling of nonsymmetric relations in various sciences and engineering disciplines. We discuss invariants of strongly connected directed graphs - minimal number of vertices or edges necessary to remove to…
We associate a graph ${\mathcal N}_{S}$ with a semigroup $S$ (called the upper non-nilpotent graph of $S$). The vertices of this graph are the elements of $S$ and two vertices are adjacent if they generate a semigroup that is not nilpotent…
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…
Networks are mathematical structures that are universally used to describe a large variety of complex systems such as the brain or the Internet. Characterizing the geometrical properties of these networks has become increasingly relevant…
In this review we establish various connections between complex networks and symmetry. While special types of symmetries (e.g., automorphisms) are studied in detail within discrete mathematics for particular classes of deterministic graphs,…
Inspired by results for graph $C^*$-algebras, we investigate connections between the ideal structure of an inverse semigroup $S$ and that of its tight $C^*$-algebra by relating ideals in $S$ to certain open invariant sets in the associated…
We classify the gauge-invariant ideals in the C*-algebras of infinite directed graphs, and describe the quotients as graph algebras. We then use these results to identify the gauge-invariant primitive ideals in terms of the structural…
The graph groupoids of directed graphs are topologically isomorphic if and only if there is a diagonal-preserving ring *-isomorphism between the Leavitt path algebras.
We study groupoids and semigroup C*-algebras arising from graphs of monoids, in the setting of right LCM monoids. First, we establish a general criterion when a graph of monoids gives rise to a submonoid of the fundamental group which is…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…