Related papers: Graph theoretical approach to conformal correlator…
In this paper, we study the componentwise linearity of edge ideals of weighted oriented graphs. We show that if $D$ is a weighted oriented graph whose edge ideal $I(D)$ is componentwise linear, then the underlying simple graph $G$ of $D$ is…
We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a…
Graph topology identification (GTI) is a central challenge in networked systems, where the underlying structure is often hidden, yet nodal data are available. Conventional solutions to address these challenges rely on probabilistic models…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
Real-world learning tasks often encounter uncertainty due to covariate shift and noisy or inconsistent labels. However, existing robust learning methods merge these effects into a single distributional uncertainty set. In this work, we…
We study conformal field theories (CFTs) on curved spaces including both orientable and unorientable manifolds possibly with boundaries. We first review conformal transformations on curved manifolds. We then compute the identity components…
Graph classification is a pivotal challenge in machine learning, especially within the realm of graph-based data, given its importance in numerous real-world applications such as social network analysis, recommendation systems, and…
The Gepner model (2)^4 describes the sigma model of the Fermat quartic K3 surface. Moving through the nearby moduli space using conformal perturbation theory, we investigate how the conformal weights of its fields change at first and second…
Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in data mining and…
Discrete curvatures are quantities associated to the nodes and edges of a graph that reflect the local geometry around them. These curvatures have a rich mathematical theory and they have recently found success as a tool to analyze networks…
Motivated by constant-G theory, we introduce a one-parameter family of scalar-tensor theories as an extension of constant-G theory in which the conformal symmetry is a cosmological attractor. Since the model has the coupling function of…
The presented work focuses on problems from determinant theory, set theory and topology. The term graph is the binding element that connects these problems. Graphs are distinguished by their geometrical simplicity, which helps in showing…
We consider the problem of correlation functions in the stationary states of one-dimensional stochastic models having conformal invariance. If one considers the space dependence of the correlators, the novel aspect is that although one…
We present a general construction of all correlation functions of a two-dimensional rational conformal field theory, for an arbitrary number of bulk and boundary fields and arbitrary topologies. The correlators are expressed in terms of…
Identifying and controlling bias is a key problem in empirical sciences. Causal diagram theory provides graphical criteria for deciding whether and how causal effects can be identified from observed (nonexperimental) data by covariate…
Data constraints are fundamental for practical data modelling, and a verifiable conformance of a data instance to a safety-critical constraint (satisfaction relation) is a corner-stone of safety assurance. Diagrammatic constraints are…
We propose a graph-theoretic description to determine and characterize 5d superconformal field theories (SCFTs) that arise as circle reductions of 6d $\mathcal{N} = (1,0)$ SCFTs. Each 5d SCFT is captured by a graph, called a Combined Fiber…
We consider two-dimensional N=(2,2) supersymmetric gauge theory on discretized Riemann surfaces. We find that the discretized theory can be efficiently described by using graph theory, where the bosonic and fermionic fields are regarded as…
In the dimer model, a configuration consists of a perfect matching of a fixed graph. If the underlying graph is planar and bipartite, such a configuration is associated to a height function. For appropriate "critical" (weighted) graphs,…
An ordered graph is a graph enhanced with a linear order on the vertex set. An ordered graph is a core if it does not have an order-preserving homomorphism to a proper subgraph. We say that $H$ is the core of $G$ if (i) $H$ is a core, (ii)…