| 查看: 712 | 回复: 2 | ||
xzllxls木虫 (正式写手)
|
[求助]
关于图论的一段英文，怎么理解？ 已有1人参与
|
|
我最近读到一篇论文里面有一段： A state is periodic if it is contained only in cycles in which the gcd of the cycle lengths is greater than one. A Markov process is irreducible if it consists of a single strongly connected component. An ergodic state is one that is aperiodic and persistent. A Markov chain is ergodic if all states are ergodic. In graph theory this corresponds to a single strongly connected component that is aperiodic. 我对图论不了解，想问下第一句： A state is periodic if it is contained only in cycles in which the gcd of the cycle lengths is greater than one. 中的the gcd of the cycle lengths是什么意思？ 圈的长度？ 如果是的话，怎样计算？ gcd是什么意思？是最大公约数的意思吗？ 为什么要有the gcd of the cycle lengths 这个概念？ 谢谢！ |
回复此楼» 猜你喜欢
售SCI一区文章，我:8.O.55.1.O.54,科目齐全,可伽急
已经有6人回复
-
售SCI一区T0P文章，我:8.O55.1.O.54,科目全,可十急
已经有7人回复
-
售SCI一区T0P文章，我:8.O.55.1.O54,科目全,可伽急
已经有6人回复
-
售SCI一区文章，我:8O5.5.1.O5.4,科目全,可伽急
已经有5人回复
-
售一区SCI文章T0P，我:8O.551.O54,科目全,可十急
已经有4人回复
-
售SCI文章，我:8O5.5.1.O.54,科目齐全,可+急
已经有12人回复
-
售SCI一区T0P文章，我:8O.55.1.O.54,科目全,可伽急
已经有14人回复
-
售SCI一区T0P文章，我:8.O.55.1.O.5.4,科目全,可+急
已经有19人回复
-
售SCI文章，我:8O.5.5.1O.54,科目全,可十急
已经有24人回复
-
售SCI一区T0P文章，我:8.O.55.1.O.54,科目齐全,可+急
已经有11人回复
FMStation
至尊木虫 (知名作家)
- 应助: 591 (博士)
- 贵宾: 0.03
- 金币: 18865.2
- 红花: 97
- 帖子: 8891
- 在线: 1499.8小时
- 虫号: 2400059
- 注册: 2013-04-04
- 专业: 计算机应用技术
【答案】应助回帖
感谢参与，应助指数 +1
|
the gcd of the cycle lengths gcd - ?????, the greatest common divisor (g.c.d) ?h·(cycle) ???]?o??DG V = ( , E)???????x y − ·?? (a) ?? x − y·?o?κ??????????t(?????c)?γ? ??l x − y·??(trail)???] x x − ·???Q???·(circuit)?? (b) ??? x − y·?o?κ???c???F?????????Q??x − y ·??(path)???h·(cycle)??~???????????l?]·???? http://www.stat.nuk.edu.tw/cbme/discrete/search.htm |
2楼2016-08-06 21:26:17
FMStation
至尊木虫 (知名作家)
- 应助: 591 (博士)
- 贵宾: 0.03
- 金币: 18865.2
- 红花: 97
- 帖子: 8891
- 在线: 1499.8小时
- 虫号: 2400059
- 注册: 2013-04-04
- 专业: 计算机应用技术
【答案】应助回帖
|
G is strongly connected and the the GCD of the cycle lengths in G is 1. Convergence on Directed Graphs http://citeseerx.ist.psu.edu/vie ... p1&type=pdf Strongly connected component https://en.wikipedia.org/wiki/Strongly_connected_component |
3楼2016-08-06 21:33:09
