Related papers: Graph-theoretic conditions for injectivity of func…
We consider realizations of a graph in the plane such that the distances between adjacent vertices satisfy the constraints given by an edge labeling. If there are infinitely many such realizations, counted modulo rigid motions, the labeling…
Modeling causal relationships in graph representation learning remains a fundamental challenge. Existing approaches often draw on theories and methods from causal inference to identify causal subgraphs or mitigate confounders. However, due…
A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.
We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…
We give an approximate Menger-type theorem for when a graph $G$ contains two $X-Y$ paths $P_1$ and $P_2$ such that $P_1 \cup P_2$ is an induced subgraph of $G$. More generally, we prove that there exists a function $f(d) \in O(d)$, such…
Graphical functions are positive functions on the punctured complex plane $\mathbb{C}\setminus\{0,1\}$ which arise in quantum field theory. We generalize a parametric integral representation for graphical functions due to Lam, Lebrun and…
Notions of minimal sufficient causation are incorporated within the directed acyclic graph causal framework. Doing so allows for the graphical representation of sufficient causes and minimal sufficient causes on causal directed acyclic…
This paper is devoted to studying a notion of Bott integrability for Reeb flows on contact 3-manifolds. We show, in analogy with work of Fomenko-Zieschang on Hamiltonian flows in dimension 4, that Bott-integrable Reeb flows exist precisely…
Function (linear) spaces on which an arbitrary function operates (i.e. the space is stable w.r.t. the pointwise unary operation defined by the function) were investigated, for continuous real or complex operations, by deLeeuw-Katznelson,…
Higher genus partition functions of two-dimensional conformal field theories have to be invariants under linear actions of mapping class groups. We illustrate recent results [4,6] on the construction of such invariants by concrete…
In the last decade or so, we have witnessed deep learning reinvigorating the machine learning field. It has solved many problems in the domains of computer vision, speech recognition, natural language processing, and various other tasks…
In this paper, we study the differential inclusion associated to the minimal surface system for two-dimensional graphs in $\mathbb{R}^{2 + n}$. We prove regularity of $W^{1,2}$ solutions and a compactness result for approximate solutions of…
We prove a fixed point theorem for closed-graphed, decomposable-valued correspondences whose domain and range is a decomposable set of functions from an atomless measure space to a topological space. One consequence is an improvement of the…
This paper explores the properties of directed graphs, termed generalized action graphs, which exhibit a strong connection to certain number sequences. Focusing on the structural and combinatorial aspects, we investigate the conditions…
In this paper we will give an explicit construction of the geometric model for a prescribed extension of a function field in several variables over a number field. As a by-product, we will also prove the existence of quasi-galois closed…
We introduce the notion of a generalized flow on a graph with coefficients in a R-representation and show that the module of flows is isomorphic to the first derived functor of the colimit. We generalize Kirchhoff's laws and build an exact…
This paper deals with dynamical networks for which the relations between node signals are described by proper transfer functions and external signals can influence each of the node signals. In particular, we are interested in…
Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…
Graph embedding techniques are useful to characterize spectral signature relations for hyperspectral images. However, such images consists of disjoint classes due to spatial details that are often ignored by existing graph computing tools.…
Let $ R $ be a rational map. We are interesting in the dynamic of the Ruelle operator on suitable spaces of differentials. In particular the necessary and sufficient conditions (in terms of convergence of sequences of measures) of existence…