Related papers: New correlation duality relations for the planar P…
Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…
In this note we study some of the properties of the generating polynomial for homomorphisms from a graph to at complete weighted graph on $q$ vertices. We discuss how this polynomial relates to a long list of other well known graph…
The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…
The human ability to flexibly reason using analogies with domain-general content depends on mechanisms for identifying relations between concepts, and for mapping concepts and their relations across analogs. Building on a recent model of…
Correlation remains to be one of the most widely used statistical tools for assessing the strength of relationships between data series. This paper presents a novel compositional correlation method for detecting linear and nonlinear…
We revisit the concepts of acyclic orderings and number of acyclic orderings of acyclic digraphs in terms of dispositions and counters for arbitrary multidigraphs. We prove that when we add a sequence of nested directed paths to a directed…
The problem of measuring similarity of graphs and their nodes is important in a range of practical problems. There is a number of proposed measures, some of them being based on iterative calculation of similarity between two graphs and the…
We extend the construction of the DAHA-Jones polynomials for any reduced root systems and DAHA-superpolynomials in type A from the iterated torus knots (our previous paper) to links, including arbitrary algebraic links. Such a passage…
We address the enumeration of properly q-colored planar maps, or more precisely, the enumeration of rooted planar maps M weighted by their chromatic polynomial \chi_M(q) and counted by the number of vertices and faces. We prove that the…
Dyadic lattice graphs and their duals are commonly used as discrete approximations to the hyperbolic plane. We use them to give examples of random rooted graphs that are stationary for simple random walk, but whose duals have only a…
This article investigates how graph matching can be applied to process plant design data in order to support the reuse of previous designs. A literature review of existing graph matching algorithms is performed, and a group of algorithms is…
We study set systems formed by neighborhoods in graphs of bounded twin-width. We start by proving that such graphs have linear neighborhood complexity, in analogy to previous results concerning graphs from classes with bounded expansion and…
In a standard cluster analysis, such as k-means, in addition to clusters locations and distances between them, it's important to know if they are connected or well separated from each other. The main focus of this paper is discovering the…
This paper presents a new approach to combine cross-correlation functions. The combination is based on a maximum-likelihood approach and uses a non-linear combination scheme. It can be effective for radial-velocity analysis of multi-order…
Taking into account the recent developments associated with duality in physics, this article is focused on investigating the properties of a tensor generalization of the electrodynamics dual to the standard vector model even considering the…
We develop a theory of minors for alternating dimaps --- orientably embedded digraphs where, at each vertex, the incident edges (taken in the order given by the embedding) are directed alternately into, and out of, the vertex. We show that…
We give several related versions of global Grothendieck Duality for unbounded complexes on noetherian formal schemes. The proofs, based on a non-trivial adaptation of Deligne's method for the special case of ordinary schemes, are reasonably…
In this chapter (Chapter V) we present several results which demonstrate a close connection and useful exchange of ideas between graph theory and knot theory. These disciplines were shown to be related from the time of Tait (if not Listing)…
We show that there exists only one duality pair for ordered graphs. We will also define a corresponding definition of $\chi^<$-boundedness for ordered graphs and show that all ordered graphs are $\chi^<$-bounded and prove an analogy of…
In this paper we derive intertwining relations for a broad class of conservative particle systems both in discrete and continuous setting. Using the language of point process theory, we are able to derive a natural framework in which…