Gửi tin nhắn: On Characterizing the Local Pooling Factor of Greedy Maximal Scheduling in Random Graphs