| 序约束下单向分类方差分析模型的Bayes变量选择 |
| |
| 引用本文： | 史海芳,李聪,姬永刚.序约束下单向分类方差分析模型的Bayes变量选择[J].吉林大学学报(理学版),2021,58(5):1093-1100. |
| |
| 作者姓名： | 史海芳 李聪 姬永刚 |
| |
| 作者单位： | 1. 中国民航大学 理学院, 天津 300300; 2. 吉林大学 数学学院, 长春 130012 |
| |
| 摘 要： | 考虑序约束下单向分类方差分析模型的变量选择问题, 提出两种基于SSVS的Bayes变量选择方法, 并设计一种简单且易操作的Gibbs抽样算法进行后验抽样. 数值模拟和应用实例结果表明, 该方法效果较好.
|
| 关 键 词： | Bayes变量选择 序约束 随机搜索变量选择 |
| 收稿时间： | 2020-03-27 |
Weight of Light Chords 4-Cycles in IC-Planar Graphs with Degree Restrictions |
| |
| SHI Haifang,LI Cong,JI Yonggang.Weight of Light Chords 4-Cycles in IC-Planar Graphs with Degree Restrictions[J].Journal of Jilin University: Sci Ed,2021,58(5):1093-1100. |
| |
| Authors: | SHI Haifang LI Cong JI Yonggang |
| |
| Institution: | 1. School of Science, Civil Aviation University of China, Tianjin 300300, China;
2. College of Mathematics, Jilin University, Changchun 130012, China
|
| |
| Abstract: | The graph formed by removing an edge from a complete graph k4 was called chordal 4-cycle. By discharging method, the author discussed the weight of 4-cycle with chords in IC-planar graphs with degree restrictions. The author proved that each IC-planar graph with minimum vertex degree at least 5 and minimum edge degree at least 11 contained a light chordal 4-cycle v1v2v3v4v1, and proved that the upper bounds of weight of this kind of light chordal 4-cycle was at most 37. |
| |
| Keywords: | IC-planar graph discharging method weight chordal 4-cycle |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《吉林大学学报(理学版)》下载免费的PDF全文 |
