搜索结果: 1-9 共查到“数学 acyclic”相关记录9条 . 查询时间(0.062 秒)
Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
Sparse graphical model Reversible Markov chain Markov equivalence class
font style='font-size:12px;'>
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...
Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
Sparse graphical model Reversible Markovchain Markov equivalence class.
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
Acyclic edge-coloring using entropy compression
Acyclic edge-coloring entropy compression Combinatorics
font style='font-size:12px;'>
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...
Acyclic edge coloring of sparse graphs
acyclic coloring average degree critical
font style='font-size:12px;'>
2012/2/29
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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 ...
Throughput and Latency of Acyclic Erasure Networks with Feedback in a Finite Buffer Regime
Throughput Latency of Acyclic Erasure Networks Feedback Finite Buffer Regime
font style='font-size:12px;'>
2011/1/21
The exact Markov modeling analysis of erasure networks with finite buffers is an extremely hard problem due to the large number of states in the system. In such networks,packets are lost due to either...
Algebras of tame acyclic cluster type
Algebras tame acyclic cluster type
font style='font-size:12px;'>
2010/12/9
In this paper, we study algebras of tame acyclic cluster type. These are algebras of global dimension at most 2 whose generalized cluster category is equivalent to a cluster category of an acyclic qui...