WEIGHT REDISTRIBUTION ON SIMPLY CONNECTED GRAPHS WITH SYMMETRIC SCHEME
This thesis is an investigation of linear and iterative weight redistribution on sim- ply connected graphs. Averaging is one special case of redistribution. Linear local averaging is related to the discrete Laplace operator on graphs. The convergence criteria of the scheme is dened by spectral pr...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Theses |
| 語言: | Indonesia |
| 主題: | |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/33877 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Institut Teknologi Bandung |
| 語言: | Indonesia |
| 總結: | This thesis is an investigation of linear and iterative weight redistribution on sim-
ply connected graphs. Averaging is one special case of redistribution. Linear local
averaging is related to the discrete Laplace operator on graphs. The convergence
criteria of the scheme is dened by spectral properties of the linear map. We develop
successive symmetric local averaging scheme to ensure the monotony of iteration. In
the end we show that the only redistribution possible on simply connected graphs
is the averaging. |
|---|