搜索结果: 1-6 共查到“应用统计数学 GRAPHS”相关记录6条 . 查询时间(0.078 秒)
Assortativity and clustering of sparse random intersection graphs
assortativity clustering power law random graph random intersection graph 2010 Mathematics Subject Classifications 05C80 05C82 91D30
2012/11/23
We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptotic expressions for th...
Higher connectivity of fiber graphs of Grobner bases
Higher connectivity fiber graphs Grobner bases
2012/11/23
Fiber graphs of Gr\"obner bases from contingency tables are important in statistical hypothesis testing, where one studies random walks on these graphs using the Metropolis-Hastings algorithm. The con...
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...
New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
Minimum-weighted dominating set Minimum-weighted connected dominating
2012/12/3
Given a node-weighted graph, the minimum-weighted dominating set (MWDS) problem is to find a minimum-weighted vertex subset such that, for any vertex, it is contained in this subset or it has a neighb...
Uncoverings on graphs and network reliability
uncovering spanning tree network reliability
2011/1/21
We propose a network protocol similar to the k-tree protocol of Itai and Rodeh [Inform. and Comput. 79 (1988), 43–59]. To do this, we define an uncovering-bybases for a connected graph G to be a colle...
Using the construction of a nonorientable Curtis-Tits group of type A˜n, we obtain new explicit families of expander graphs of valency five for unitary groups over finite fields.