搜索结果: 1-3 共查到“知识库 随机分析 graphs”相关记录3条 . 查询时间(0.093 秒)
Hitting distributions of simple random walks on Sierpinski graphs
In [Ka] Kaimanovich de ned an augmented rooted tree X for the
2011/2/25
In [Ka], Kaimanovich de ned an augmented rooted tree X for the d-dimensional Sierpinski gasket K. Let fZtg be the simple random walk on X,starting at the root ;.
A path in an edge-colored graph is called a rainbow path if all edges on it have pairwise
distinct colors. For k ≥ 1, the rainbow-k-connectivity of a graph G, denoted rck(G), is the
minimum number o...
Brightwell and Winkler introduced the graph parameters warmth and mobility in the context of combinatorial statistical physics. They related both parameters to lower bounds on chromatic number. Here w...