ALGEBRAIC CONNECTIVITY OF ERDÖS-RÉNYI GRAPHS NEAR THE CONNECTIVITY THRESHOLD

By T. Von. 2014

Subfields: Statistics and Probability, Algorithms & Complexity

How researchers see this paper

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

In Statistics and Probability

1. Heejong Bong
2. Alessandro Rinaldo
3. Kengo Kato

In Algorithms & Complexity

1. Heejong Bong
2. Alessandro Rinaldo

Citations in the corpus

• Generalized Results for the Existence and Consistency of the MLE in the Bradley-Terry-Luce Model (2021, methodology): “…weaker requirement that p is of order Ω( log d d ) , the bound in (8) along with the fact that λ 2 ( L ) = Θ p ( ) (a fact that can be deduced from Kolokolnikov et al., 2014, after noting that we use a different normalization for the Laplacian) shows that the same scaling of M = o dp log d…”