相关论文: Simplicial $q$-connectivity of directed graphs wit…

A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated…

Graph representation learning methods have mostly been limited to the modelling of node-wise interactions. Recently, there has been an increased interest in understanding how higher-order structures can be utilised to further enhance the…

Given a directed graph, an equivalence relation on the graph vertex set is said to be balanced if, for every two vertices in the same equivalence class, the number of directed edges from vertices of each equivalence class directed to each…

Simplicial identities play an important and fundamental role in simplicial homotopy theory. On the other hand, the study of the paths and the regular paths on discrete sets is the foundation for the path-homology theory of digraphs. In this…

Hopfield networks are artificial neural networks which store memory patterns on the states of their neurons by choosing recurrent connection weights and update rules such that the energy landscape of the network forms attractors around the…

Recent evidence indicates that the abundance of recurring elementary interaction patterns in complex networks, often called subgraphs or motifs, carry significant information about their function and overall organization. Yet, the…

A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. By [11], a hypergraph gives an associated simplicial complex. By [4], the embedded homology of a hypergraph is the homology of the infimum chain…

The path spaces of a directed graph play an important role in the study of graph $\css$. These are topological spaces that were originally constructed using groupoid and inverse semigroup techniques. In this paper, we develop a simple,…

We present a method to generate directed acyclic graphs (DAGs) using deep reinforcement learning, specifically deep Q-learning. Generating graphs with specified structures is an important and challenging task in various application fields,…

This survey describes some useful properties of the local homology of abstract simplicial complexes. Although the existing literature on local homology is somewhat dispersed, it is largely dedicated to the study of manifolds, submanifolds,…

We continue work of our earlier paper (Lewitzka and Brunner: Minimally generated abstract logics, Logica Universalis 3(2), 2009), where abstract logics and particularly intuitionistic abstract logics are studied. Abstract logics can be…

Graphs are ubiquitous to model the irregular (non-Euclidean) structure of complex data, but they are limited to pairwise relationships and fail to model the complexities of the datasets exhibiting higher-order interactions. In that context,…

Random walks on graphs are a fundamental concept in graph theory and play a crucial role in solving a wide range of theoretical and applied problems in discrete math, probability, theoretical computer science, network science, and machine…

Directions of graphs were originally introduced in the study of a cops-and-robbers kind of game, while the study of end spaces has been used to generalize classical graph-theoretical results to infinite graphs, such as Halin's…

Combinatorially and stochastically defined simplicial complexes often have the homotopy type of a wedge of spheres. A prominent conjecture of Kahle quantifies this precisely for the case of random flag complexes. We explore whether such…

We present an algorithm to compute path homology for simple digraphs, and use it to topologically analyze various small digraphs en route to an analysis of complex temporal networks which exhibit such digraphs as underlying motifs. The…

A recent publication provides the network graph for a neocortical microcircuit comprising 8 million connections between 31,000 neurons (H. Markram, et al., Reconstruction and simulation of neocortical microcircuitry, Cell, 163 (2015) no. 2,…

Directed graphs arise in many applications where computing persistent homology helps to encode the shape and structure of the input information. However, there are only a few ways to turn the directed graph information into an undirected…

We describe structural properties of strongly connected finite directed graphs, that are invariants of the topological conjugacy of their Markov-Dyck shifts. For strongly connected finite directed graphs with these properties topological…

We define cofinite graphs and cofinite groupoids in a unified way that extends the notion of cofinite groups introduced by Hartley. The common underlying structure of all these objects is that they are directed graphs endowed with a certain…