Related papers: Product Structure and Treewidth of Hyperbolic Unif…
A circle graph is an intersection graph of a set of chords of a circle. We describe the unavoidable induced subgraphs of circle graphs with large treewidth. This includes examples that are far from the `usual suspects'. Our results imply…
In this paper we study weighted distances in scale-free spatial network models: hyperbolic random graphs (HRG), geometric inhomogeneous random graphs (GIRG) and scale-free percolation (SFP). In HRGs, $n=\Theta(\mathrm{e}^{R/2})$ vertices…
We study complex hyperbolic disc bundles over closed orientable surfaces that arise from discrete and faithful representations H_n->PU(2,1), where H_n is the fundamental group of the orbifold S^2(2,...,2) and thus contains a surface group…
Hyperbolic geometry has emerged as a powerful tool for modeling complex, structured data, particularly where hierarchical or tree-like relationships are present. By enabling embeddings with lower distortion, hyperbolic neural networks offer…
A recent trend in the context of graph theory is to bring theoretical analyses closer to empirical observations, by focusing the studies on random graph models that are used to represent practical instances. There, it was observed that…
We study the multicolour discrepancy of spanning trees and Hamilton cycles in graphs. As our main result, we show that under very mild conditions, the $r$-colour spanning-tree discrepancy of a graph $G$ is equal, up to a constant, to the…
For a given graph $H$, its subdivisions carry the same topological structure. The existence of $H$-subdivisions within a graph $G$ has deep connections with topological, structural and extremal properties of $G$. One prominent example of…
Graph embeddings, wherein the nodes of the graph are represented by points in a continuous space, are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space…
Graphs whose maximum clique size exceeds half of the total number of vertices satisfy a classical property: the family of their maximum sized cliques can be pierced by a single vertex. This result dates back to a 1965 theorem by Hajnal.…
Hyperbolic random graphs inherit many properties that are present in real-world networks. The hyperbolic geometry imposes a scale-free network with a strong clustering coefficient. Other properties like a giant component, the small world…
Generalising results of Razborov and Safin, and answering a question of Button, we prove that for every hyperbolic group there exists a constant $\alpha >0$ such that for every finite subset $U$ that is not contained in a virtually cyclic…
Obtaining continuous representations of structural data such as directed acyclic graphs (DAGs) has gained attention in machine learning and artificial intelligence. However, embedding complex DAGs in which both ancestors and descendants of…
The product-group unification is a model of unified theories, in which masslessness of the two Higgs doublets and absence of dimension-five proton decay are guaranteed by a symmetry. It is based on SU(5) x U(N) (N=2,3) gauge group. It is…
Node classification on static graphs has achieved significant success, but achieving accurate node classification on dynamic graphs where node topology, attributes, and labels change over time has not been well addressed. Existing methods…
Real-world networks, like social networks or the internet infrastructure, have structural properties such as large clustering coefficients that can best be described in terms of an underlying geometry. This is why the focus of the…
It has been proposed to abandon the requirement that parallel transporters in gauge theories are unitary (or pseudoorthogonal). This leads to a geometric interpretation of Vierbein fields as parts of gauge fields, and nonunitary parallel…
A hypergraph $\mathcal{H}=(V,\mathcal{E})$ is a hypertree if it admits a tree $T$ with vertex set $V$ such that every edge of $\mathcal{H}$ induces a subtree of $T$. A tree like that is called a host tree. Several characterizations and…
We describe a class of supersymmetric unified models with the following properties: i) the full breaking of the gauge group is achieved by Higgs fields in the fundamental representation; ii) the correct unification of the strong and…
The Program Semantic Graph (PSG) introduced in prior work on Dimensional Type Systems and Deterministic Memory Management encodes compilation-relevant properties as binary edge relations between computation nodes. This representation is…
We introduce a new class of identifiable DAG models where the conditional distribution of each node given its parents belongs to a family of generalized hypergeometric distributions (GHD). A family of generalized hypergeometric…