Algebraic Connectivity Under Site Percolation in Finite Weighted Graphs

IEEE Transactions on Network Science and Engineering, pp. 86-91, 2018.

Cited by: 0|Views10


We study the behavior of algebraic connectivity in a weighted graph that is subject to site percolation, random deletion of the vertices. Using a refined concentration inequality for random matrices we show in our main theorem that the (augmented) Laplacian of the percolated graph concentrates around its expectation. This concentration bo...More



Get fulltext within 24h
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.


Upload a single paper

for 5 coins

Wechat's Red Packet

Upload 50 articles

for 250 coins

Wechat's Red Packet

Upload 200 articles

for 1000 coins

Wechat's Red Packet

Upload 500 articles

for 2500 coins

Wechat's Red Packet

Upload 1000 articles

for 5000 coins

Wechat's Red Packet
Your rating :