Related papers: Defect Spaces and Gram Operators for Tensor-Valued…

We investigate the problem $\#\mathsf{IndSub}(\Phi)$ of counting all induced subgraphs of size $k$ in a graph $G$ that satisfy a given property $\Phi$. This continues the work of Jerrum and Meeks who proved the problem to be…

Assuming a unitarily invariant norm $|||\cdot|||$ is given on a two-sided ideal of bounded linear operators acting on a separable Hilbert space, it induces some unitarily invariant norms $|||\cdot|||$ on matrix algebras $\mathcal{M}_n$ for…

Consider the real vector space of formal sums of non-empty, finite unoriented graphs without multiple edges and loops. Let the vertices of graphs be unlabelled but let every graph $\gamma$ be endowed with an ordered set of edges…

We present a general method to identify topological materials by studying the local electronic density $\delta \rho \left(\boldsymbol{r}\right)$. More specifically, certain types of defects or spatial textures such as vacancies, turn…

We define the $d$-defective incidence chromatic number of a graph, generalizing the notion of incidence chromatic number, and determine it for some classes of graphs including trees, complete bipartite graphs, complete graphs, and…

We introduce the index i(v) = 1 - X(S(v)) for critical points of a locally injective function f on the vertex set V of a simple graph G=(V,E). Here S(v) = {w in E | (v,w) in E, f(w)-f(v)<0} is the subgraph of the unit sphere at v in G. It…

The Fisher information matrix (FIM) plays an essential role in statistics and machine learning as a Riemannian metric tensor or a component of the Hessian matrix of loss functions. Focusing on the FIM and its variants in deep neural…

This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model a directed graph as a finite set of observations from a diffusion on a manifold endowed with a vector field.…

Feynman diagrams in $\phi^4$ theory have as their underlying structure 4-regular graphs. In particular, any 4-point $\phi^4$ graph can be uniquely derived from a 4-regular graph by deleting a vertex. The Feynman period is a simplified…

For a finite set $\mathcal{F}$ of graphs, the $\mathcal{F}$-Hitting problem aims to compute, for a given graph $G$ (taken from some graph class $\mathcal{G}$) of $n$ vertices (and $m$ edges) and a parameter $k\in\mathbb{N}$, a set $S$ of…

Colored tensor models (CTM) is a random geometrical approach to quantum gravity. We scrutinize the structure of the connected correlation functions of general CTM-interactions and organize them by boundaries of Feynman graphs. For rank-$D$…

Graph-based causal discovery methods aim to capture conditional independencies consistent with the observed data and differentiate causal relationships from indirect or induced ones. Successful construction of graphical models of data…

Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…

Existing methods for graph out-of-distribution (OOD) generalization primarily rely on empirical studies on synthetic datasets. Such approaches tend to overemphasize the causal relationships between invariant sub-graphs and labels, thereby…

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…

Let $D$ be a digraph, let $p \geq 1$ be an integer, and let $f: V(D) \to \mathbb{N}_0^p$ be a vector function with $f=(f_1,f_2,\ldots,f_p)$. We say that $D$ has an $f$-partition if there is a partition $(D_1,D_2,\ldots,D_p)$ into induced…

Rapidly shrinking technology node and voltage scaling increase the susceptibility of Soft Errors in digital circuits. Soft Errors are radiation-induced effects while the radiation particles such as Alpha, Neutrons or Heavy Ions, interact…

We study the undirected divisibility graph in which the vertex set is a finite subset of consecutive natural numbers up to N.We derive analytical expressions for measures of the graph like degree, clustering, geodesic distance and…

We study experimentation under endogenous network interference. Interference patterns are mediated by an endogenous graph, where edges can be formed or eliminated as a result of treatment. We show that conventional estimators are biased in…

Let $M$ be an $n$-dimensional manifold, $V$ the space of a representation $\rho: GL(n)\longrightarrow GL(V)$. Locally, let $T(V)$ be the space of sections of the tensor bundle with fiber $V$ over a sufficiently small open set $U\subset M$,…