| DC 欄位 |
值 |
語言 |
| DC.contributor | 數學系 | zh_TW |
| DC.creator | 顏羽均 | zh_TW |
| DC.creator | Yu-jun Yan | en_US |
| dc.date.accessioned | 2014-7-30T07:39:07Z | |
| dc.date.available | 2014-7-30T07:39:07Z | |
| dc.date.issued | 2014 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=101221008 | |
| dc.contributor.department | 數學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 判斷隨機漫步在有限（或無限）的圖上是transient或recurrent可以藉由討論在有限（或無限）的圖上制定一電子電路（electric network），我們得出一重要結論：此隨機漫步是transient 若且為若此電子電路的有效電導為正。我們可以簡單的在有限的圖上計算有效電導，但對於計算無限圖上的有效電導並不容易，所以我們更進一步的推廣上述結論，利用功率（energy）來判別transient和recurrent。
第二部分則是探討一些tree上的問題，為了更加了解tree的結構，我們探討branching number的定義及計算方式。
| zh_TW |
| dc.description.abstract | We consider random walks on graphs, we investigate whether a random walk is transient or recurrent. This problem can be solved by developing electric networks on graphs, and we obtain the main consequence of our discussion: the random walk is transient if and only if the effective conductance of the network is positive. Base on this result, furthermore, we study energy for the calculation of effective conductance. The second part, we study the problems on trees such as the percolation on Galton-Watson tree and random spanning trees. Branching numbers can be calculated by using the definition of Hausdorff dimension and capacity. | en_US |
| DC.subject | 機率與電子電路 | zh_TW |
| DC.subject | trees and network | en_US |
| DC.title | Probability on Trees and Networks | en_US |
| dc.language.iso | en_US | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |