Recent changes
Jump to navigation
Jump to search
Track the most recent changes to the wiki on this page.
List of abbreviations:
- N
- This edit created a new page (also see list of new pages)
- m
- This is a minor edit
- b
- This edit was performed by a bot
- (±123)
- The page size changed by this number of bytes
24 April 2024
|
13:59 | (Upload log) [Liuexp; Kvrmnks (2×)] | |||
|
13:59 Kvrmnks talk contribs uploaded a new version of File:Computational Method 2024 Assignments4.pdf | ||||
|
13:58 Kvrmnks talk contribs uploaded a new version of File:Computational Method 2024 Assignments4.pdf | ||||
|
05:51 Liuexp talk contribs uploaded a new version of File:计算方法9-ConjugateGradient.pdf |
|
03:02 | 组合数学 (Spring 2024) 2 changes history +1,248 [Etone (2×)] | |||
|
03:02 (cur | prev) +1,091 Etone talk contribs (→Concepts) | ||||
|
02:57 (cur | prev) +157 Etone talk contribs (→Lecture Notes) |
N 02:57 | 组合数学 (Fall 2024)/The probabilistic method diffhist +27,151 Etone talk contribs (Created page with "== The Probabilistic Method == The probabilistic method provides another way of proving the existence of objects: instead of explicitly constructing an object, we define a probability space of objects in which the probability is positive that a randomly selected object has the required property. The basic principle of the probabilistic method is very simple, and can be stated in intuitive ways: *If an object chosen randomly from a universe satisfies a property with posi...") |
23 April 2024
16:55 | 计算方法 Numerical method (Spring 2024) diffhist +114 Liuexp talk contribs (→Lecture Notes) |
16:53 | Upload log Liuexp talk contribs uploaded File:计算方法9-ConjugateGradient.pdf |
22 April 2024
N 03:14 | 概率论与数理统计 (Spring 2024)/Weierstrass Approximation Theorem diffhist +5,139 Etone talk contribs (Created page with "[https://en.wikipedia.org/wiki/Stone%E2%80%93Weierstrass_theorem '''魏尔施特拉斯逼近定理''']('''Weierstrass approximation theorem''')陈述了这样一个事实:闭区间上的连续函数总可以用多项式一致逼近。 {{Theorem|魏尔施特拉斯逼近定理| :设 <math>f:[a,b]\to\mathbb{R}</math> 为定义在实数区间 <math>[a,b]</math> 上的连续实值函数。对每个 <math>\epsilon>0</math>,存在一个多项式 <math>p</math> 使得对...") |
N 03:13 | 概率论与数理统计 (Spring 2024)/Threshold of k-clique in random graph diffhist +7,005 Etone talk contribs (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)子图...") |
N 03:12 | 概率论与数理统计 (Spring 2024)/Two-point sampling diffhist +8,968 Etone talk contribs (Created page with "= 利用线性同余方程构造两两独立的随机变量 = 令<math>p</math>为一质数。考虑模<math>p</math>余数构成的集合<math>[p]=\{0,1,\ldots,p-1\}=\mathbb{Z}_p</math>。众所周知,当<math>p</math>为质数时,<math>\mathbb{Z}_p</math>为对模<math>p</math>加法和乘法运算闭合的'''有限域'''。 我们现在构造一系列值域为<math>[p]</math>的'''两两独立'''('''pairwise Independent''')且'''均匀分布'''('''uniforml...") |
03:12 | 概率论与数理统计 (Spring 2024) diffhist +325 Etone talk contribs (→Lectures) |