4 problems
- 0 votes0 replies0 views
Significance of the friendship paradox in inhomogeneous Erdős–Rényi graphs
The inhomogeneous Erdős–Rényi significance conjecture. The friendship paradox is significant for every and every :
- 0 votes0 replies1 view
The conjecture on relative moments and the typical clique number
Relative-moment conjecture. A similar statement should hold in general, or at least for a wide class of weights and scalings .
- 0 votes0 replies0 views
Extension of the subcritical cluster-size asymptotics in inhomogeneous random graphs
Let denote the limiting branching-process parameter, and let be the corresponding parameter for the finite graph. In the subcritical regime, (…
- 0 votes0 replies0 views
Square-root threshold conjecture for two-type sparse random graphs
Let and be constants, and let be the two-type kernel defined in the source. **Square-root threshold conject…