This is the current revision of this page, as edited by Cewbot(talk | contribs) at 15:12, 1 February 2024(Maintain {{WPBS}} and vital articles: 2 WikiProject templates. Create {{WPBS}}. Keep majority rating "Stub" in {{WPBS}}. Remove 2 same ratings as {{WPBS}} in {{WPStatistics}}, {{Maths rating}}. Remove 3 deprecated parameters: field, frequentlyviewed, vital.). The present address (URL) is a permanent link to this version.Revision as of 15:12, 1 February 2024 by Cewbot(talk | contribs)(Maintain {{WPBS}} and vital articles: 2 WikiProject templates. Create {{WPBS}}. Keep majority rating "Stub" in {{WPBS}}. Remove 2 same ratings as {{WPBS}} in {{WPStatistics}}, {{Maths rating}}. Remove 3 deprecated parameters: field, frequentlyviewed, vital.)
This article is within the scope of WikiProject Statistics, a collaborative effort to improve the coverage of statistics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.StatisticsWikipedia:WikiProject StatisticsTemplate:WikiProject StatisticsStatistics
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
I'm not an expert, but shouldn't the number of bits used in sampling from an infinite family of constant-degree expanders be $\log{n} + O(k)$? I'm counting $\log{n}$ bits for the initial seed, plus a constant number for each step in the walk, so $O(k)$.
Nargle25787 (talk) 01:35, 8 April 2013 (UTC)[reply]
