Related papers: Codes on graphs: Duality and MacWilliams identitie…
We prove that the marginal densities of a global probability mass function in a primal normal factor graph and the corresponding marginal densities in the dual normal factor graph are related via local mappings. The mapping depends on the…
The graphs induced by partition logics allow a dual probabilistic interpretation: a classical one for which probabilities lie on the convex hull of the dispersion-free weights, and another one, suggested independently from the quantum Born…
In this study, we challenge the traditional approach of frequency analysis on directed graphs, which typically relies on a single measure of signal variation such as total variation. We argue that the inherent directionality in directed…
We present a dual of a family of partition identities of Andrews involving partitions with no repeated odd parts (among other conditions), along with an overpartition generalization that encapsulates both families. These were discovered…
We derive a "switching identity" that can be stated for critical Brownian loop-soups or for the Gaussian free field on a cable graph: It basically says that at the level of cluster configurations and at the more general level of the…
We use derivatives to prove the equivalences between MacWilliams identity and its four equivalent forms, and present new interpretations for the four equivalent forms. Our results explicitly give out the relationships between MacWilliams…
This is a survey of the method of graph cuts and its applications to graph clustering of weighted unsigned and signed graphs. I provide a fairly thorough treatment of the method of normalized graph cuts, a deeply original method due to Shi…
We propose a new point of view in the study of Fourier analysis on graphs, taking advantage of localization in the Fourier domain. For a signal $f$ on vertices of a weighted graph $\mathcal{G}$ with Laplacian matrix $\mathcal{L}$, standard…
We define a category $\mathcal{QSI}$ of quantum semigroups with involution which carries a corepresentation-based duality map $M\mapsto \widehat M$. Objects in $\mathcal{QSI}$ are von Neumann algebras with comultiplication and coinvolution,…
We classify trivalent vertex-transitive graphs whose edge sets have a partition into a 2-factor composed of two cycles and a 1-factor that is invariant under the action of the automorphism group.
We provide a criterion to distinguish two graphs which are indistinguishable by $2$-dimensional Weisfeiler-Lehman algorithm for almost all graphs. Haemers conjectured that almost all graphs are identified by their spectrum. Our approach…
Graphical models express conditional independence relationships among variables. Although methods for vector-valued data are well established, functional data graphical models remain underdeveloped. We introduce a notion of conditional…
Recently dilogarithm identities have made their appearance in the physics literature. These identities seem to allow to calculate structure constants like, in particular, the effective central charge of certain conformal field theories from…
The MacWilliams Extension Theorem states that each linear isometry of a linear code extends to a monomial map. Unlike the linear codes, in general, additive codes do not have the extension property. In this paper, an analogue of the…
Duality in the integrable systems arising in the context of Seiberg-Witten theory shows that their tau-functions indeed can be seen as generating functions for the mutually Poisson-commuting hamiltonians of the {\em dual} systems. We…
In this paper, we employ the theory of normal families in several complex variables to obtain some uniqueness theorems for entire functions. These results extend the related works of Li and Yi [11], and Lu et al. [18] to the setting of…
Multivariate functional data arise in a wide range of applications. One fundamental task is to understand the causal relationships among these functional objects of interest, which has not yet been fully explored. In this article, we…
We show for any oriented surface, possibly with a boundary, how to generalize Kramers-Wannier duality to the world of quantum groups. The generalization is motivated by quantization of Poisson-Lie T-duality from the string theory.…
The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by…
Dual equivalence graphs are a powerful tool in symmetric function theory that provide a general framework for proving that a given quasisymmetric function is symmetric and Schur positive. In this paper, we study a larger family of graphs…