Yingyue Ke

Effective resistance matrices of weighted threshold graphs

A threshold graph is generated from a single node by repeatedly adding either a node $i$ connected to all existing nodes with a common link weight $w_i >0 $ or a node $i$ connected to none. Let $ G_w $ be a weighted threshold graph encoded by the weight vector $ w = (w_1, w_2, \ldots, w_N) $ with $w_i \geq 0$. A closed...