Related papers: On Metzler positive systems on hypergraphs

Clustering nodes in heterophilous graphs is challenging as traditional methods assume that effective clustering is characterized by high intra-cluster and low inter-cluster connectivity. To address this, we introduce HeNCler-a novel…

Let $A$ and $B$ be sets of vertices in a graph $G$. Menger's theorem states that for every positive integer $k$, either there exists a collection of $k$ vertex-disjoint paths between $A$ and $B$, or $A$ can be separated from $B$ by a set of…

Here, we show a method to reconstruct connectivity hypermatrices of a general hypergraph (without any self loop or multiple edge) using tensor. We also study the different spectral properties of these hypermatrices and find that these…

Network representation learning and node classification in graphs got significant attention due to the invent of different types graph neural networks. Graph convolution network (GCN) is a popular semi-supervised technique which aggregates…

There has been a recent surge in transformer-based architectures for learning on graphs, mainly motivated by attention as an effective learning mechanism and the desire to supersede handcrafted operators characteristic of message passing…

In this paper, we introduce three operations on hypergraphs by using tensors. We show that these three formulations are equivalent and we commonly call them as the tensor join. We show that any hypergraph can be viewed as a tensor join of…

Controlling real-world networked systems, including ecological, biomedical, and engineered networks that exhibit higher-order interactions, remains challenging due to inherent nonlinearities and large system scales. Despite extensive…

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…

In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific…

In complex social systems encoded as hypergraphs, higher-order (i.e., group) interactions taking place among more than two individuals are represented by hyperedges. One of the higher-order correlation structures native to hypergraphs is…

Let G=(V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v in V dominates its closed neighborhood N[v]. A vertex set D in G is an efficient dominating (e.d.) set for G if for every vertex v in V, there is…

The collective dynamics of interacting dynamical units on a network crucially depends on the properties of the network structure. Rather than considering large but finite graphs to capture the network, one often resorts to graph limits and…

We study the dynamics of the generalized Lotka-Volterra model with a network structure. Performing a high connectivity expansion for graphs, we write down a mean-field dynamical theory that incorporates degree heterogeneity. This allows us…

A hypergraph is Sperner if no hyperedge contains another one. A Sperner hypergraph is equilizable (resp., threshold) if the characteristic vectors of its hyperedges are the (minimal) binary solutions to a linear equation (resp., inequality)…

We extend the edge version of the classical Menger's Theorem for undirected graphs to $n$-dimensional simplicial complexes with chains over the field $\mathbb{F}_2$. The classical Menger's Theorem states that two different vertices in an…

Metapopulation epidemic models are a valuable tool for studying large-scale outbreaks. With the limited availability of epidemic tracing data, it is challenging to infer the essential constituents of these models, namely, the epidemic…

A temporal graph can be represented by a graph with an edge labelling, such that an edge is present in the network if and only if the edge is assigned the corresponding time label. A journey is a labelled path in a temporal graph such that…

Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in…

Let $F$ be a graph. A hypergraph is called Berge $F$ if it can be obtained by replacing each edge in $F$ by a hyperedge containing it. Given a family of graphs $\mathcal{F}$, we say that a hypergraph $H$ is Berge $\mathcal{F}$-free if for…

The basic interaction unit of many dynamical systems involves more than two nodes. In such situations where networks are not an appropriate modelling framework, it has recently become increasingly popular to turn to higher-order models,…