Related papers: How I got to like graph polynomials
Graph learning methods have recently been receiving increasing interest as means to infer structure in datasets. Most of the recent approaches focus on different relationships between a graph and data sample distributions, mostly in…
We study the critical points of monomial functions over an algebraic subset of the probability simplex. The number of critical points on the Zariski closure is a topological invariant of that embedded projective variety, known as its…
Motivated by a fundamental geometrical object, the cut locus, we introduce and study a new combinatorial structure on graphs.
Recently, we have witnessed tremendous applications of algebraic intersection theory to branches of mathematics, that previously seemed very distant. In this article we review some of them. Our aim is to provide a unified approach to the…
We consider the bialgebra of hypergraphs, a generalization of Schmitt's Hopf algebra of graphs, and show it has a cointeracting bialgebra. So one has a double bialgebra in the sense of L. Foissy, who recently proved there is then a unique…
To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
These notes are dedicated to whom may be interested in algorithms, Markov chain, coupling, and graph theory etc. I present some preliminaries on coupling and explanations of the important formulas or phrases, which may be helpful for us to…
These lecture notes are a personal introduction to signed graphs, concentrating on the aspects that have been most persistently interesting to me. They are just a few corners of signed graph theory; I am leaving out a great deal. The…
The chromatic polynomials are studied by several authors and have important applications in different frameworks, specially, in graph theory and enumerative combinatorics. The aim of this work is to establish some properties of the…
In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…
The connectivity structure of graphs is typically related to the attributes of the nodes. In social networks for example, the probability of a friendship between two people depends on their attributes, such as their age, address, and…
We give a unified geometric approach to some theorems about primitive elements and palindromes in free groups of rank 2. The geometric treatment gives new proofs of the theorems. Dedicated to Bill Harvey on his 65th birthday.
We investigate combinatorial properties of a graph polynomial indexed by half-edges of a graph which was introduced recently to understand the connection between Feynman rules for scalar field theory and Feynman rules for gauge theory. We…
The modular decomposition is a technique that applies but is not restricted to graphs. The notion of module naturally appears in the proofs of many graph theoretical theorems. Computing the modular decomposition tree is an important…
The magnitude of a graph can be thought of as an integer power series associated to a graph; Leinster introduced it using his idea of magnitude of a metric space. Here we introduce a bigraded homology theory for graphs which has the…
We develop a diagrammatic categorification of the polynomial ring Z[x], based on a geometrically defined graded algebra. This construction generalizes to categorification of some special functions, such as Chebyshev polynomials.…
In this expositional paper, we discuss commutative algebra -- a study inspired by the properties of integers, rational numbers, and real numbers. In particular, we investigate rings and ideals, and their various properties. After, we…
We present a means of formulating and solving graph coloring problems with probabilistic graphical models. In contrast to the prevalent literature that uses factor graphs for this purpose, we instead approach it from a cluster graph…
Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…