Related papers: MacWilliams Identities for Codes on Graphs
This paper describes the quality of convergence to an infinitely divisible law relative to free multiplicative convolution. We show that convergence in distribution for products of identically distributed and infinitesimal free random…
The dual normal factor graph and the factor graph duality theorem have been considered for discrete graphical models. In this paper, we show an application of the factor graph duality theorem to continuous graphical models. Specifically, we…
We study differential forms on an algebraic compactification of a moduli space of metric graphs. Canonical examples of such forms are obtained by pulling back invariant differentials along a tropical Torelli map. The invariant differential…
Linear non-Gaussian causal models postulate that each random variable is a linear function of parent variables and non-Gaussian exogenous error terms. We study identification of the linear coefficients when such models contain latent…
A famous theorem of Dixmier-Malliavin asserts that every smooth, compactly-supported function on a Lie group can be expressed as a finite sum in which each term is the convolution, with respect to Haar measure, of two such functions. We…
In the present paper the authors show that an iteration of the $\mathscr{L}_{2}$-transform by itself is a constant multiple of the Glasser transform. Using this iteration identity, a Parseval-Goldstein type theorem for…
Convolution of valuations was introduced by the first named author and Fu for linear spaces, and later by Alesker and the first named author for compact Lie groups. In this paper we study the convolution of invariant valuations on Lie…
We study infinitely divisible (ID) distributions on the nonnegative half-line $\mathbb{R}_+$. The L\'{e}vy-Khintchine representation of such distributions is well-known. Our primary contribution is to cast the probabilistic objects and the…
We define parametrized cobordism categories and study their formal properties as bivariant theories. Bivariant transformations to a strongly excisive bivariant theory give rise to characteristic classes of smooth bundles with strong…
Properties of the `$k$-equivalent' graph families constructed in Cai, F\"{u}rer and Immerman, and Evdokimov and Ponomarenko are analysed relative the the recursive $k$-dim WL method. An extension to the recursive $k$-dim WL method is…
In this paper we prove Morse index theorems for a big class of constrained variational problems on graphs. Such theorems are useful in various physical and geometric applications. Our formulas compute the difference of Morse indices of two…
Gleason's 1970 theorem on weight enumerators of self-dual codes has played a crucial role for research in coding theory during the last four decades. Plenty of generalizations have been proved but, to our knowledge, they are all based on…
We address the problem of predicting the labeling of a graph in an online setting when the labeling is changing over time. We present an algorithm based on a specialist approach; we develop the machinery of cluster specialists which…
An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$. These codes have been widely studied for over two decades. We give an improvement…
In this paper, we have introduced the concepts of support distribution and the support enumerator as refinements of the classical weight distribution and weight enumerator respectively, capturing coordinate level activity in linear block…
In 2008, Lehner, Wettig, Guhr and Wei conjectured a power series identity and showed that it implied a determinantal formula for a Bessel-type integral over the unitary supergroup. The integral is the supersymmetric extension of Bessel-type…
Benkart, Sottile, and Stroomer have completely characterized by Knuth and dual Knuth equivalence a bijective proof of the conjugation symmetry of the Littlewood-Richardson coefficients. Tableau-switching provides an algorithm to produce…
Causality analysis is an important problem lying at the heart of science, and is of particular importance in data science and machine learning. An endeavor during the past 16 years viewing causality as real physical notion so as to…
Codes on hypergraphs are an extension of the well-studied family of codes on bipartite graphs. Bilu and Hoory (2004) constructed an explicit family of codes on regular t-partite hypergraphs whose minimum distance improves earlier estimates…
For the category of group codes, that generalizes the category of linear codes over a finite field, and with the generalized notions of direct sums and ndecomposable group codes, we prove that every MDS non trivial code, every perfect non…