Related papers: Extremal Triangular Chain Graphs for Bond Incident…
We consider identifying a conditional causal effect when a graph is known up to a maximally oriented partially directed acyclic graph (MPDAG). An MPDAG represents an equivalence class of graphs that is restricted by background knowledge and…
The extreme degrees of the colored Jones polynomial of any link are bounded in terms of concrete data from any link diagram. It is known that these bounds are sharp for semi-adequate diagrams. One of the goals of this paper is to show the…
The extremal index is an important parameter in the characterization of extreme values of a stationary sequence. Our new estimation approach for this parameter is based on the extremal behavior under the local dependence condition…
This report concerns the information content of a graph, optionally conditional on one or more background, "common knowledge" graphs. It describes an algorithm to estimate this information content, and includes some examples based on…
This paper addresses the tradeoffs which need to be considered in reasoning using probabilistic network representations, such as Influence Diagrams (IDs). In particular, we examine the tradeoffs entailed in using Temporal Influence Diagrams…
We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.
Graded vector bundles over a given $\mathbb{Z}$-graded manifold can be defined in three different ways: certain sheaves of graded modules over the structure sheaf of the base graded manifold, finitely generated projective graded modules…
The Kirchhoff index of a connected graph is the sum of resistance distances between all unordered pairs of vertices in the graph. It found considerable applications in a variety of fields. In this paper, we determine the minimum Kirchhoff…
We explore algorithms to select actions in the causal bandit setting where the learner can choose to intervene on a set of random variables related by a causal graph, and the learner sequentially chooses interventions and observes a sample…
Causal identification is at the core of the causal inference literature, where complete algorithms have been proposed to identify causal queries of interest. The validity of these algorithms hinges on the restrictive assumption of having…
The Pearson correlation coefficient is commonly used for quantifying the global level of degree-degree association in complex networks. Here, we use a probabilistic representation of the underlying network structure for assessing the…
An extremal graph for a given graph $H$ is a graph with maximum number of edges on fixed number of vertices without containing a copy of $H$. The $k$-th power of a path is a graph obtained from a path and joining all pair of vertices of the…
This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…
The degree sequence of a graph is a numerical method to characterize the properties of graphs. Generalized forms of degree sequences exist for complete graphs and complete graphs. Nikolopolus et al. characterized the number of spanning…
This paper is a survey on Extremal Graph Theory, primarily focusing on the case when one of the excluded graphs is bipartite. On one hand we give an introduction to this field and also describe many important results, methods, problems, and…
Classic measures of graph centrality capture distinct aspects of node importance, from the local (e.g., degree) to the global (e.g., closeness). Here we exploit the connection between diffusion and geometry to introduce a multiscale…
Let $G=(V,E)$ be a simple connected graph with vertex set $V(G)$ and edge set $E(G)$. The third atom-bond connectivity index, $ABC_3$ index, of $G$ is defined as $ABC_3(G)=\sum\limits_{uv\in E(G)}\sqrt{\frac{e(u)+e(v)-2}{e(u)e(v)}}$, where…
Let $I(G)$ be a topological index of a graph. If $I(G+e)<I(G)$ (or $I(G+e)>I(G)$, respectively) for each edge $e\not\in G$, then $I(G)$ is monotonically decreasing (or increasing, respectively) with the addition of edges. In this article,…
We obtain several new upper bounds of the odd graceful chromatic number of a graph $G$, which must be bipartite. Some of our bounds depend only on the number of the vertices of $G$ or the chromatic number of some graphs related to the…
To any graph we associate a sequence of integers called the gonality sequence of the graph, consisting of the minimum degrees of divisors of increasing rank on the graph. This is a tropical analogue of the gonality sequence of an algebraic…