Related papers: Cauchy Transforms of Colored Graphs in Two Variabl…
We study graphs with nonnegative Bakry-\'Emery curvature or Ollivier curvature outside a finite subset. For such a graph, via introducing the discrete Gromov-Hausdorff convergence we prove that the space of bounded harmonic functions is…
Recently a duality between color and kinematics has been proposed, exposing a new unexpected structure in gauge theory and gravity scattering amplitudes. Here we propose that the relation goes deeper, allowing us to reorganize amplitudes…
Recently continuous rational maps between real algebraic varieties have attracted the attention of several researchers. In this paper we continue the investigation of approximation properties of continuous rational maps with values in…
In applications, quantities of interest are often modelled in equilibrium or an equilibrium solution is sought. The presence of confounding makes causal inference in this setting challenging. We provide interpretable graphical models for…
We use a way to extend partial combinatory algebras (pcas) by forcing them to represent certain functions. In the case of Scott's Graph model, equality is computable relative to the complement function. However, the converse is not true.…
We define an invariant of graphs embedded in a three-manifold and a partition function for 2-complexes embedded in a triangulated four-manifold by specifying the values of variables in the Turaev-Viro and Crane-Yetter state sum models. In…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
Two emerging topics in graph theory are the study of cospectral vertices of a graph, and the study of isospectral reductions of graphs. In this paper, we prove a fundamental relationship between these two areas, which is that two vertices…
In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…
We investigate the possibility of proving upper bounds on Hadwiger's number of a graph with partial information, mirroring several known upper bounds for the chromatic number. For each such bound we determine whether the corresponding bound…
In contrast to the univariate case, several definitions are available for the notion of bounded variation for a bivariate function. This article is an attempt to study the Hausdorff dimension and box dimension of the graph of a continuous…
Motivated in part by combinatorial applications to certain sum-product phenomena, we introduce unimodular graphs over finite fields and, more generally, over finite valuation rings. We compute the spectrum of the unimodular graphs, by using…
A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…
We present the theory of multifunctions applied to graphs. Its interesting feature is that walks are recognized as iterations. We consider the graphs with arbitrary number of vertices which are determined by multifunctions. The mutually…
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…
We introduce \textit{dual graph diagrams} representing oriented knots and links. We use these combinatorial structures to define corresponding algebraic structures we call \textit{biquasiles} whose axioms are motivated by dual graph…
We demonstrate how to generalize two of the most well-known random graph models, the classic random graph, and random graphs with a given degree distribution, by the introduction of hidden variables in the form of extra degrees of freedom,…
Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…
In this paper we study the complementarity spectrum of digraphs, with special attention to the problem of digraph characterization through this complementarity spectrum. That is, whether two non-isomorphic digraphs with the same number of…
In this paper, we define irregular bipolar fuzzy graphs and its various classifications. Size of regular bipolar fuzzy graphs is derived. The relation between highly and neighbourly irregular bipolar fuzzy graphs are established. Some basic…