Related papers: Toric and non-toric Bayesian networks

Faithfulness is a common assumption in causal inference, often motivated by the fact that the faithful parameters of linear Gaussian and discrete Bayesian networks are typical, and the folklore belief that this should also hold for other…

In this article, we propose a new hypothesis testing method for directed acyclic graph (DAG). While there is a rich class of DAG estimation methods, there is a relative paucity of DAG inference solutions. Moreover, the existing methods…

One can associate to a bipartite graph a so-called edge ring whose spectrum is an affine normal toric variety. We characterize the faces of the (edge) cone associated to this toric variety in terms of some independent sets of the bipartite…

In this paper, we develop a graphical modeling framework for the inference of networks across multiple sample groups and data types. In medical studies, this setting arises whenever a set of subjects, which may be heterogeneous due to…

This is the first of series of talks presented at a permanent Rutgers workshop on noncommutative algebra and geometry. We study here quadratic and quadratic-linear algebras defined by factorizations of noncommutative polynomials and…

This works explores and illustrates recent results developed by the author in field of dynamical network analysis. The considered approach is blind, i.e., no a priori assumptions on the interconnected systems are available. Moreover, the…

We present a Bayesian nonparametric Poisson factorization model for modeling network data with an unknown and potentially growing number of overlapping communities. The construction is based on completely random measures and allows the…

We present a method for learning treewidth-bounded Bayesian networks from data sets containing thousands of variables. Bounding the treewidth of a Bayesian greatly reduces the complexity of inferences. Yet, being a global property of the…

By analogy with algebraic geometry, we define a category of non-linear sheaves (quasi-coherent homotopy-sheaves of topological spaces) on projective toric varieties and prove a splitting result for its algebraic K-theory, generalising…

We use computational linear algebra and commutative algebra to study spaces of relations satisfied by quadrilinear operations. The relations are analogues of associativity in the sense that they are quadratic (every term involves two…

We characterize when a generalized Baumslag-Solitar group is linear, and extend the result to the fundamental groups of a graph of groups with infinite virtually cyclic vertex and edge groups.

We prove analogues of the Riemann-Roch Theorem and the Hodge Theorem for noncommutative tori (of any dimension) equipped with complex structures, and discuss implications for the question of how to distinguish "noncommutative abelian…

This note establishes that every polyhedron that has a Hamiltonian quasigeodesic can be edge-unfolded to a net, and shows that the class of such polyhedra is infinite.

In this paper, we introduce new combinatorial invariants of any finite simple graph, which arise in toric topology. We compute the $i$-th (rational) Betti number and Euler characteristic of the real toric variety associated to a graph…

A plethora of networks is being collected in a growing number of fields, including disease transmission, international relations, social interactions, and others. As data streams continue to grow, the complexity associated with these highly…

We prove some results about linking of Lagrangian tori in the symplectic vector space $(\mathbb{R}^4, \omega)$. We show that certain enumerative counts of holomophic disks give useful information about linking. This enables us to prove, for…

We discuss the problem on the connectedness of various webs of lattice polytopes by introducing a geometric point of view from the toric Mori theory. To this end, we provide a combinatorial description of toric Sarkisov links in terms of…

This chapter offers an accessible introduction to the channel-based approach to Bayesian probability theory. This framework rests on algebraic and logical foundations, inspired by the methodologies of programming language semantics. It…

This paper presents a Bayesian model for unsupervised learning of verb selectional preferences. For each verb the model creates a Bayesian network whose architecture is determined by the lexical hierarchy of Wordnet and whose parameters are…

A biperiodic planar network is a pair $(G,c)$ where $G$ is a graph embedded on the torus and $c$ is a function from the edges of $G$ to non-zero complex numbers. Associated to the discrete Laplacian on a biperiodic planar network is its…