Related papers: The Graphical Major Index
We propose the use of hyperedge replacement graph grammars for factor graphs, or factor graph grammars (FGGs) for short. FGGs generate sets of factor graphs and can describe a more general class of models than plate notation, dynamic…
Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower…
If two G-manifolds are G-cobordant then characteristic numbers corresponding to the fixed point sets (submanifolds) of subgroups of G and to normal bundles to these sets coincide. We construct two analogues of these characteristic numbers…
We review recent results that lead to a very precise understanding of the dynamics of typical unimodal maps from the statistical point of view. We also describe the (generalized) renormalization approach to the study of the statistical…
A general novel approach mapping discrete, combinatorial, graph-theoretic problems onto ``physical'' models - namely $n$ simplexes in $n-1$ dimensions - is applied to the graph equivalence problem. It is shown to solve this long standing…
We find the two-variables generating function for the statistic which counts the number of variations in a word bounded by $1$. Thus, we refine and extend previous results concerning staircase words, which are words in which the variation…
A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of…
A positive real interval, [a, b], can be partitioned into sub-intervals such that sub-interval widths divided by sub-interval "average" values remains constant. That both Arithmetic Mean and Geometric Mean "average" values produce constant…
Graphs and networks provide a canonical representation of relational data, with massive network data sets becoming increasingly prevalent across a variety of scientific fields. Although tools from mathematics and computer science have been…
This paper presents a model for linguistic description based on group theory. A grammar in this model, or "G-grammar", is a collection of lexical expressions which are products of logical forms, phonological forms, and their inverses.…
Real analytic generalized functions are investigated as well as the analytic singular support and analytic wave front of a generalized function in $\mathcal{G}(\Omega)$ are introduced and described.
This paper investigates the new notion of $2$-word-$\pi$-repre\-sentable graphs: the nodes of the graph correspond to the letters of the two words and there exists an edge between two nodes if the projections of any two letters of both…
A popular approach to semi-supervised learning proceeds by endowing the input data with a graph structure in order to extract geometric information and incorporate it into a Bayesian framework. We introduce new theory that gives appropriate…
Immersions of graphs to the projective plane are studied. A classification of immersions up to regular homotopy is given. A complete invariant of immersions up to regular homotopy is constructed. Equivalence classes are described.
We provide a complete invariant for graph C*-algebras which are amplified in the sense that whenever there is an edge between two vertices, there are infinitely many. The invariant used is the standard primitive ideal space adorned with a…
We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and…
Several characterizations of the Generalized Inverse Gaussian (GIG) distribution have been proposed in the literature, especially over the past two decades. These characterization theorems are surveyed, and two new characterizations are…
A unified treatment of Schwinger parametrised Feynman amplitudes is suggested which addresses vertices of arbitrary order on the same footing as propagators. Contributions from distinct diagrams are organised collectively. The scheme is…
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,…
This paper introduces a notion of presentation for locally inverse semigroups and develops a graph structure to describe the elements of locally inverse semigroups given by these presentations. These graphs will have a role similar to the…