Related papers: Weakly reflecting graph properties
We prove the existence of a regular semigroup F(X) weakly generated by X such that all other regular semigroups weakly generated by X are homomorphic images of F(X). The semigroup F(X) is introduced by a presentation and the word problem…
The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…
In this paper, based on the contributions of Tucker (1983) and Seb{\H{o}} (1992), we generalize the concept of a sequential coloring of a graph to a framework in which the algorithm may use a coloring rule-base obtained from suitable…
A typical result in graph theory says that a graph $G$, satisfying certain conditions, has some property $\cal P$. Once such a theorem is established, it is natural to ask how strongly $G$ satisfies $\cal P$. Can one strengthen the result…
The restricted hypercube-like graphs, variants of the hypercube, were proposed as desired interconnection networks of parallel systems. The matching preclusion number of a graph is the minimum number of edges whose deletion results in the…
Graph-based methods have been demonstrated as one of the most effective approaches for semi-supervised learning, as they can exploit the connectivity patterns between labeled and unlabeled data samples to improve learning performance.…
We investigate the representations and the structure of Hecke algebras associated to certain finite complex reflection groups. We first describe computational methods for the construction of irreducible representations of these algebras,…
Graphs are naturally sparse objects that are used to study many problems involving networks, for example, distributed learning and graph signal processing. In some cases, the graph is not given, but must be learned from the problem and…
Existing weakly-supervised semantic segmentation methods using image-level annotations typically rely on initial responses to locate object regions. However, such response maps generated by the classification network usually focus on…
In this thesis, the main objects of study are probability measures on the isomorphism classes of countable, connected rooted graphs. An important class of such measures is formed by unimodular measures, which satisfy a certain equation,…
A large body of work has investigated the properties of graph neural networks and identified several limitations, particularly pertaining to their expressive power. Their inability to count certain patterns (e.g., cycles) in a graph lies at…
Hypergraphs, increasingly utilised for modelling complex and diverse relationships in modern networks, gain much attention representing intricate higher-order interactions. Among various challenges, cohesive subgraph discovery is one of the…
In an era of unprecedented deluge of (mostly unstructured) data, graphs are proving more and more useful, across the sciences, as a flexible abstraction to capture complex relationships between complex objects. One of the main challenges…
Learning disentangled representations that correspond to factors of variation in real-world data is critical to interpretable and human-controllable machine learning. Recently, concerns about the viability of learning disentangled…
Verifying the veracity of claims requires reasoning over a large knowledge base, often in the form of corpora of trustworthy sources. A common approach consists in retrieving short portions of relevant text from the reference documents and…
A graph theoretic perspective is taken for a range of phenomena in continuum physics in order to develop representations for analysis of large scale, high-fidelity solutions to these problems. Of interest are phenomena described by partial…
In this paper, we consider a question of sum-keeping about a multiplicative subsemigroup and its generator subsets in a semiring, and develop some elementary (collapse) process of the sum-keeping retraction through subsets until one minimal…
In order to make argumentation-based inference contestable, it is crucial to explain what changes can achieve a desired (instead of the contested) inference result. To this end, we introduce strength change explanations for quantitative…
We consider the problem of offline, pool-based active semi-supervised learning on graphs. This problem is important when the labeled data is scarce and expensive whereas unlabeled data is easily available. The data points are represented by…
This paper proposes a blind detection problem for low pass graph signals. Without assuming knowledge of the exact graph topology, we aim to detect if a set of graph signal observations are generated from a low pass graph filter. Our problem…