Related papers: A Factor-Graph Formulation of CSS Syndrome Decodin…
We analyze charmless two-body non-leptonic B decays $B \to PP, PV$ under the framework of factorization assisted topological amplitude approach, where $P(V)$ denotes a light pseudoscalar (vector) meson. Compared with the conventional flavor…
Component-centric distributed graph processing platforms that use a bulk synchronous parallel (BSP) programming model have gained traction. These address the short-comings of Big Data abstractions/platforms like MapReduce/Hadoop for…
This paper explores the use of factor graphs as an inference and analysis tool for Bayesian peer-to-peer decentralized data fusion. We propose a framework by which agents can each use local factor graphs to represent relevant partitions of…
Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code, and every codeword stabilized code can be described by a graph and a classical code. For the construction of good…
In probabilistic modelling, joint distributions are often of more interest than their marginals, but the standard composition of stochastic channels is defined by marginalization. Last year at ACT, the notion of 'copy-composition' was…
Message passing on factor graphs is a powerful framework for probabilistic inference, which finds important applications in various scientific domains. The most wide-spread message passing scheme is the sum-product algorithm (SPA) which…
Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and…
We analyze the extraction of weak phases from CP violation in $B\to\pi^+\pi^-$ decays. We propose to determine the unitarity triangle $(\bar\rho,\bar\eta)$ by combining the information on mixing induced CP violation in $B\to\pi^+\pi^-$,…
Assessing covariate balance (CB) is a common practice in various types of evaluation studies. Two-sample descriptive statistics, such as the standardized mean difference, have been widely applied in the scientific literature to assess the…
We study the Balanced Connected Subgraph(shortly, BCS) problem on geometric intersection graphs such as interval, circular-arc, permutation, unit-disk, outer-string graphs, etc. Given a vertex-colored graph $G=(V,E)$, where each vertex in…
We analyze the extraction of weak phases from CP violation in $B\to\pi^+\pi^-$ decays. By combining the information on mixing induced CP violation in $B\to\pi^+\pi^-$, namely $S_{\pi\pi}$, with the precision observable $\sin 2\beta$…
We introduce and study a loopless multigraph associated with a split graph $S$: the factor graph of $S$, denoted by $\Phi(S)$, which encodes the combinatorial information about 2-switch transformations over $S$. This construction provides a…
Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a…
We propose a new algorithm for binary quantization based on the Belief Propagation algorithm with decimation over factor graphs of Low Density Generator Matrix (LDGM) codes. This algorithm, which we call Bias Propagation (BiP), can be…
The challenge of quantum computing is to combine error resilience with universal computation. Diagonal gates such as the transversal $T$ gate play an important role in implementing a universal set of quantum operations. This paper…
We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is…
The task of CDMA multiuser detection is to simultaneously estimate binary symbols of $K$ synchronous users from the received $N$ base-band CDMA signals. Mathematically, this can be formulated as an inference problem on a complete bipartite…
We often encounter probability distributions given as unnormalized products of non-negative functions. The factorization structures are represented by hypergraphs called factor graphs. Such distributions appear in various fields, including…
Graph states are well-entangled quantum states that are defined based on a graph. Of course, if two graphs are isomorphic their associated states are the same. Also, we know local operations do not change the entanglement of quantum states.…
Low-density parity-check codes, a class of capacity-approaching linear codes, are particularly recognized for their efficient decoding scheme. The decoding scheme, known as the sum-product, is an iterative algorithm consisting of passing…