The Strange Logic of Random Graphs

328 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Securing wireless sensor networks: a survey (2008, background): “The theoretical foundation of RKP is the random graph theory [26].”
A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment (2005, methodology): “From general principles [ 20, Section 2.2 ] F (k) is bounded effectively by the tower function so that if k = c log ∗ n with c appropriately”
A key-management scheme for distributed sensor networks (2002, background): “Erd.os and R´enyi [12] showed that, for monotone properties, there exists a value of p such that the property moves from nonexistent to certainly true in a very large random graph.”