搜索结果: 1-15 共查到“Acyclic”相关记录22条 . 查询时间(0.062 秒)
Counting and Exploring Sizes of Markov Equivalence Classes of Directed Acyclic Graphs
Directed acyclic graphs Markov equivalence class Size distribution Causal- ity
2016/1/26
When learning a directed acyclic graph (DAG) model via observational data, one gener-ally cannot identify the underlying DAG, but can potentially obtain a Markov equivalence class. The size (the numbe...
Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
Sparse graphical model Reversible Markov chain Markov equivalence class
2016/1/25
Graphical models are popular statistical tools which are used to represent dependent or causal complex systems. Statistically equivalent causal or directed graphical models are said to belong to a Mar...
Counting and Exploring Sizes of Markov Equivalence Classes of Directed Acyclic Graphs
Directed acyclic graphs Markov equivalence class Size distribution Causal- ity
2016/1/20
When learning a directed acyclic graph (DAG) model via observational data, one gener-ally cannot identify the underlying DAG, but can potentially obtain a Markov equivalence class. The size (the numbe...
Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
Sparse graphical model Reversible Markov chain Markov equivalence class
2016/1/20
Graphical models are popular statistical tools which are used to represent dependent or causal complex systems. Statistically equivalent causal or directed graphical models are said to belong to a Mar...
Incremental Construction of Minimal Acyclic Finite-State Automata
Minimal Acyclic Finite-State Automata deterministic
2015/8/25
In this paper, we describe a new method for constructing minimal, deterministic, acyclic finitestate automata from a set of strings. Traditional methods consist of two phases: the first to...
Jointly interventional and observational data: estimation of interventional Markov equivalence classes of directed acyclic graphs
Causal inference Interventions BIC Graphical model Maximum likelihood estimation Greedy equivalence search
2013/4/27
In many applications we have both observational and (randomized) interventional data. We propose a Gaussian likelihood framework for joint modeling of such different data-types, based on global parame...
Supplement to "Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs"
Sparse graphical model Reversible Markov chain Markov equivalence class
2013/4/27
This supplementary material includes three parts: some preliminary results, four examples, an experiment, three new algorithms, and all proofs of the results in the paper "Reversible MCMC on Markov eq...
MINIMUM LATENCY LINK SCHEDULING FOR ARBITRARY DIRECTED ACYCLIC NETWORKSUNDER PRECEDENCE AND SINR CONSTRAINTS
Minimum latency link scheduling SINR model physical interference model
2012/12/4
Scheduling wireless links under the SINR model has attracted increasing attention in the past few years [1–6, 8–15, 18–20, 23–25, 27, 28, 33–36, 39, 41, 42, 45, 46]. However, most of previous work did...
Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
Sparse graphical model Reversible Markovchain Markov equivalence class.
2012/11/23
Graphical models are popular statistical tools which are used to represent dependent or causal complex systems. Statistically equivalent causal or directed graphical models are said to belong to a Mar...
Fitting directed acyclic graphs with latent nodes as finite mixtures models, with application to education transmission
Extendedlatentclassmodels mixturemodels structuralequations causal inference
2012/11/22
This paper describes an efficient EM algorithm for maximum likelihood estimation of a system of nonlinear structural equations corresponding to a directed acyclic graph model that can contain an arbit...
Towards Characterizing Markov Equivalence Classes for Directed Acyclic Graphs with Latent Variables
DAG maximal ancestral graph Markov equivalence
2012/9/18
It is well known that there may be many causal explanations that are consistent with a given set of data. Recent work has been done to represent the common aspects of these explanations into one repre...
Acyclic edge-coloring using entropy compression
Acyclic edge-coloring entropy compression Combinatorics
2012/6/29
An edge-coloring of a graph G is acyclic if it is a proper edge-coloring of G and every cycle contains at least three colors. We prove that every graph with maximum degree Delta has an acyclic edge-co...
A proper edge coloring of a graph $G$ is called acyclic if there is no bichromatic cycle in $G$. The acyclic chromatic index of $G$, denoted by $\chi'_a(G)$, is the least number of colors $k$ such tha...
Acyclic and unicyclic graphs whose minimum skew rank is equal to the minimum skew rank of a diametrical path
skew-symmetric matrix minimum skew rank matching diametrical path tree unicyclic graph rank matrix
2011/9/1
Abstract: The minimum skew rank of a simple graph G over the field of real numbers, is the smallest possible rank among all real skew-symmetric matrices whose (i,j)-entry (for i not equal to j) is non...
Acyclic embeddings of open Riemann surfaces into new examples of elliptic manifolds
Holomorphic embedding Riemann surface Oka manifold Stein manifold elliptic manifold affine manifold
2011/8/22
Abstract: The geometric notion of ellipticity for complex manifolds was introduced by Gromov in his seminal 1989 paper on the Oka principle, and is a sufficient condition for a manifold to be Oka. In ...