A Search Problem in the Complete Graph
碩士 === 國立彰化師範大學 === 數學系所 === 99 === Abstract Two people walk randomly in a complete graph with n equal-distanced vertices. We want to find the distribution of the first meeting time under two different definitions of meeting . The first is that meeting occurs only at vertices, and the second is that...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/98045519271517623991 |