概率论与数理统计 (Spring 2024)/Threshold of k-clique in random graph: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

22 April 2024

  • curprev 03:1303:13, 22 April 2024‎ Etone talk contribs‎ 7,005 bytes +7,005‎ Created page with "在 Erdős-Rényi 随机图模型 <math>G(n,p)</math> 中，一个随机无向图 <math>G</math> 以如下的方式生成：图 <math>G</math> 包含 <math>n</math> 个顶点，每一对顶点之间都独立同地以概率 <math>p</math> 连一条无向边。如此生成的随机图记为 <math>G\sim G(n,p)</math>。 固定整数 <math>k\ge 3</math>，考虑随机图 <math>G\sim G(n,p)</math> 包含 <math>K_k</math>（<math>k</math>-团，<math>k</math>-clique）子图..."
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=概率论与数理统计_(Spring_2024)/Threshold_of_k-clique_in_random_graph"