相关论文: Faithfulness in Chain Graphs: The Gaussian Case

In a world blessed with a great diversity of loss functions, we argue that that choice between them is not a matter of taste or pragmatics, but of model. Probabilistic depencency graphs (PDGs) are probabilistic models that come equipped…

Since the pioneering works of Jakobson and Benedicks & Carleson and others, it has been known that a positive measure set of quadratic maps admit invariant probability measures absolutely continuous with respect to Lebesgue. These measures…

The Perfect Graph Theorems are important results in graph theory describing the relationship between clique number $\omega(G) $ and chromatic number $\chi(G) $ of a graph $G$. A graph $G$ is called \emph{perfect} if $\chi(H)=\omega(H)$ for…

A signed graph $(G,\Sigma)$ is a graph $G$ together with a set $\Sigma \subseteq E(G)$ of negative edges. A circuit is positive if the product of the signs of its edges is positive. A signed graph $(G,\Sigma)$ is balanced if all its…

Belief Propagation (BP) is a powerful algorithm for distributed inference in probabilistic graphical models, however it quickly becomes infeasible for practical compute and memory budgets. Many efficient, non-parametric forms of BP have…

We show that if a non-amenable, quasi-transitive, unimodular graph $G$ has all degrees even then it has a factor-of-iid balanced orientation, meaning each vertex has equal in- and outdegree. This result involves extending earlier…

In this paper, we study sequences of perfect t-embeddings of a uniformly weighted family of graphs we call generalized tower graphs. We show that the embeddings of these graphs satisfy certain technical assumptions, in particular, the…

This paper investigates the periodic points of the Gauss type shifts associated to the even continued fraction (Schweiger) and to the backward continued fraction (R\'enyi). We show that they coincide exactly with two sets of quadratic…

Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. In this context, the conventional factor graphs are referred…

Pearls concept OF a d - connecting path IS one OF the foundations OF the modern theory OF graphical models : the absence OF a d - connecting path IN a DAG indicates that conditional independence will hold IN ANY distribution factorising…

Least-squares data analysis is based on the assumption that the normal (Gaussian) distribution appropriately characterizes the likelihood, that is, the conditional probability of each measurement d, given a measured quantity y, p(d | y). On…

The posterior distribution in a nonparametric inverse problem is shown to contract to the true parameter at a rate that depends on the smoothness of the parameter, and the smoothness and scale of the prior. Correct combinations of these…

Gaussian graphical models are parametric statistical models for jointly normal random variables whose dependence structure is determined by a graph. In previous work, we introduced trek separation, which gives a necessary and sufficient…

Many authors have studied the phenomenon of typically Gaussian marginals of high-dimensional random vectors; e.g., for a probability measure on $\R^d$, under mild conditions, most one-dimensional marginals are approximately Gaussian if $d$…

This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…

Factor analysis refers to a statistical model in which observed variables are conditionally independent given fewer hidden variables, known as factors, and all the random variables follow a multivariate normal distribution. The parameter…

We study criteria which ensure that Gibbs states (often also called generalized vacuum states) on distance-regular graphs are positive. Our main criterion assumes that the graph can be embedded into a growing family of distance-regular…

Perfect graphs form one of the distinguished classes of finite simple graphs. In 2006, Chudnovsky, Robertson, Seymour and Thomas proved that a graph is perfect if and only if it has no odd holes and no odd antiholes as induced subgraphs,…

Let $F$ be an $(r+1)$-color critical graph with $r\geq 2$, that is, $\chi(F)=r+1$ and there is an edge $e$ in $F$ such that $\chi(F-e)=r$. Gerbner recently conjectured that every $n$-vertex maximal $F$-free graph with at least…

A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least 5 or the complement of one.…