Pages that link to "Item:Q4584914"

The following pages link to On the total variation distance between the binomial random graph and the random intersection graph (Q4584914):

Displaying 7 items.

• Total variation distance and the Erdős-Turán law for random permutations with polynomially growing cycle weights (Q503081) (← links)
• Central limit theorem for the largest component of random intersection graph (Q2144313) (← links)
• Phase transitions for detecting latent geometry in random graphs (Q2210754) (← links)
• The shortest distance in random multi-type intersection graphs (Q3094603) (← links)
• MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems (Q6053474) (← links)
• Selected combinatorial problems through the prism of random intersection graphs models (Q6057306) (← links)
• The number of triangles in random intersection graphs (Q6084115) (← links)