Related papers: On the geometry of graph arrangements
Exchangeable random graphs serve as an important probabilistic framework for the statistical analysis of network data. In this work we develop an alternative parameterization for a large class of exchangeable random graphs, where the nodes…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
The guessing number of a directed graph (digraph), equivalent to the entropy of that digraph, was introduced as a direct criterion on the solvability of a network coding instance. This paper makes two contributions on the guessing number.…
We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial…
We present the first streaming algorithm for counting an arbitrary hypergraph $H$ of constant size in a massive hypergraph $G$. Our algorithm can handle both edge-insertions and edge-deletions, and is applicable for the distributed setting.…
This paper investigates the Terwilliger algebra of some group association schemes related to codes. In addition, it also shows the generators of invariant rings appearing by E-polynomials.
A cell algebra structure is found for a family of generalized Schur algebras previously studied by the author. This cell algebra structure is then used to construct the irreducible representations of these algebras and to determine when the…
A book Chapter consisting of some of the main areas of research in graph theory applied to physics. It includes graphs in condensed matter theory, such as the tight-binding and the Hubbard model. It follows the study of graph theory and…
A recently proposed renormalization group technique, based on the hierarchical structures present in theories with fluctuating geometry, is implemented in the model of branched polymers. The renormalization group equations can be solved…
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…
Given the complement of a hyperplane arrangement, let $\Gamma$ be the closure of the graph of the map inverting each of its defining linear forms. The characteristic polynomial manifests itself in the Hilbert series of $\Gamma$ in two…
Execution graphs of parallel loop programs exhibit a nested, repeating structure. We show how such graphs that are the result of nested repetition can be represented by succinct parametric structures. This parametric graph template…
In this paper we have established relations of the genetic tables with magic and bimagic squares. Connections with Hamming distances, binomial coefficients are established. The idea of Gray code is applied. Shannon entropy of magic squares…
Polytopes from subgraph statistics are important in applications and conjectures and theorems in extremal graph theory can be stated as properties of them. We have studied them with a view towards applications by inscribing large explicit…
In this paper, we survey results regarding the interlace polynomial of a graph, connections to such graph polynomials as the Martin and Tutte polynomials, and generalizations to the realms of isotropic systems and delta-matroids.
We describe how to construct and enumerate Magic squares, Franklin squares, Magic cubes, and Magic graphs as lattice points inside polyhedral cones using techniques from Algebraic Combinatorics. The main tools of our methods are the Hilbert…
Graph compositions generalize both integer compositions and partitions of a finite set. We develop formulas, generating functions and recurrence relations for composition counting functions for several families of graphs.
We propose and study a hierarchical algorithm to generate graphs having a predetermined distribution of cliques, the fully connected subgraphs. The construction mechanism may be either random or incorporate preferential attachment. We…
We present exact calculations of Potts model partition functions and the equivalent Tutte polynomials for polygon chain graphs with open and cyclic boundary conditions. Special cases of the results that yield flow and reliability…
A conjecture regarding the structure of expander graphs is discussed.