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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | Theses |
| اللغة: | Indonesia |
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://digilib.itb.ac.id/gdl/view/33877 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | 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. |
|---|