User contributions for Zouzongrui
A user with 439 edits. Account created on 3 March 2023.
24 November 2023
- 08:1608:16, 24 November 2023 diff hist 0 高级算法 (Fall 2023)/Problem Set 2 →Problem 4 (Random walk on graph)
- 08:1308:13, 24 November 2023 diff hist +5 高级算法 (Fall 2023)/Problem Set 2 →Problem 3 (Cheeger's inequality)
- 08:1008:10, 24 November 2023 diff hist +33 高级算法 (Fall 2023)/Problem Set 2 →Problem 3 (Cheeger's inequality)
- 08:0708:07, 24 November 2023 diff hist −98 高级算法 (Fall 2023)/Problem Set 2 →Problem 3 (Cheeger's inequality)
- 08:0608:06, 24 November 2023 diff hist +12 高级算法 (Fall 2023)/Problem Set 2 →Problem 3 (Cheeger's inequality)
- 08:0108:01, 24 November 2023 diff hist +2 高级算法 (Fall 2023)/Problem Set 2 →Problem 3 (Cheeger's inequality) Tag: Visual edit
- 07:5707:57, 24 November 2023 diff hist +2 高级算法 (Fall 2023)/Problem Set 2 →Problem 2 (Graph Laplacian) Tag: Visual edit
- 07:5607:56, 24 November 2023 diff hist +10 高级算法 (Fall 2023)/Problem Set 2 →Problem 2 (Graph Laplacian)
- 07:5607:56, 24 November 2023 diff hist +9 高级算法 (Fall 2023)/Problem Set 2 →Problem 2 (Graph Laplacian) Tag: Manual revert
- 07:5507:55, 24 November 2023 diff hist −9 高级算法 (Fall 2023)/Problem Set 2 →Problem 2 (Graph Laplacian)
- 07:5407:54, 24 November 2023 diff hist −19 高级算法 (Fall 2023)/Problem Set 2 →Problem 2 (Graph Laplacian) Tag: Visual edit
- 07:5107:51, 24 November 2023 diff hist −1 高级算法 (Fall 2023)/Problem Set 2 →Problem 3 (Cheeger's inequality)
- 07:5107:51, 24 November 2023 diff hist −3 高级算法 (Fall 2023)/Problem Set 2 →Problem 4 (Random walk on graph)
- 07:5107:51, 24 November 2023 diff hist −3 高级算法 (Fall 2023)/Problem Set 2 →Problem 5 (Hitting time, commute time)
- 07:5007:50, 24 November 2023 diff hist −1 高级算法 (Fall 2023)/Problem Set 2 →Problem 7 (Expander mixing lemma)
- 07:5007:50, 24 November 2023 diff hist 0 高级算法 (Fall 2023)/Problem Set 2 →Problem 7 (Expander mixing lemma)
- 07:5007:50, 24 November 2023 diff hist −3 高级算法 (Fall 2023)/Problem Set 2 →Problem 7 (Expander mixing lemma)
- 07:5007:50, 24 November 2023 diff hist +605 高级算法 (Fall 2023)/Problem Set 2 →Problem 7 (Expander mixing lemma)
- 07:4807:48, 24 November 2023 diff hist −6 高级算法 (Fall 2023)/Problem Set 2 →Problem 6 (Electrical network)
- 07:4807:48, 24 November 2023 diff hist +545 高级算法 (Fall 2023)/Problem Set 2 →Problem 6 (Electrical network)
- 07:4507:45, 24 November 2023 diff hist +621 高级算法 (Fall 2023)/Problem Set 2 →Problem 5 (Hitting time, commute time)
- 07:4407:44, 24 November 2023 diff hist +11 高级算法 (Fall 2023)/Problem Set 2 →Problem 4 (Random walk on graph)
- 07:4407:44, 24 November 2023 diff hist +1 高级算法 (Fall 2023)/Problem Set 2 →Problem 4 (Random walk on graph)
- 07:4307:43, 24 November 2023 diff hist +1 高级算法 (Fall 2023)/Problem Set 2 →Problem 4 (Random walk on graph)
- 07:4307:43, 24 November 2023 diff hist +1,513 高级算法 (Fall 2023)/Problem Set 2 →Problem 4 (Random walk on graph)
- 07:4207:42, 24 November 2023 diff hist +1 高级算法 (Fall 2023)/Problem Set 2 →Problem 3 (Cheeger's inequality)
- 07:4207:42, 24 November 2023 diff hist −47 高级算法 (Fall 2023)/Problem Set 2 →Problem 3 (Cheeger's inequality)
- 07:4007:40, 24 November 2023 diff hist −3 高级算法 (Fall 2023)/Problem Set 2 →Problem 3 (Cheeger's inequality)
- 07:4007:40, 24 November 2023 diff hist −1 高级算法 (Fall 2023)/Problem Set 2 →Problem 3 (Cheeger's inequality)
- 07:4007:40, 24 November 2023 diff hist −11 高级算法 (Fall 2023)/Problem Set 2 →Problem 3 (Cheeger's inequality)
- 07:3907:39, 24 November 2023 diff hist +1,980 高级算法 (Fall 2023)/Problem Set 2 →Problem 3 (Cheeger's inequality)
- 07:3907:39, 24 November 2023 diff hist −2 高级算法 (Fall 2023)/Problem Set 2 →Problem 8 (MCMC and coupling)
- 07:3807:38, 24 November 2023 diff hist −4 高级算法 (Fall 2023)/Problem Set 2 →Problem 8 (MCMC and coupling)
- 07:3807:38, 24 November 2023 diff hist +2 高级算法 (Fall 2023)/Problem Set 2 →Problem 8 (MCMC and coupling)
- 07:3807:38, 24 November 2023 diff hist −3 高级算法 (Fall 2023)/Problem Set 2 →Problem 8 (MCMC and coupling)
- 07:3707:37, 24 November 2023 diff hist +9 高级算法 (Fall 2023)/Problem Set 2 →Problem 8 (MCMC and coupling)
- 07:3607:36, 24 November 2023 diff hist −3 高级算法 (Fall 2023)/Problem Set 2 →Problem 8 (MCMC and coupling)
- 07:3407:34, 24 November 2023 diff hist −12 高级算法 (Fall 2023)/Problem Set 2 →Problem 8 (MCMC and coupling)
- 07:3407:34, 24 November 2023 diff hist +1,119 高级算法 (Fall 2023)/Problem Set 2 No edit summary
- 07:3307:33, 24 November 2023 diff hist +249 高级算法 (Fall 2023)/Problem Set 2 No edit summary
- 07:3107:31, 24 November 2023 diff hist +994 高级算法 (Fall 2023)/Problem Set 2 No edit summary
- 07:3007:30, 24 November 2023 diff hist 0 高级算法 (Fall 2023)/Problem Set 2 No edit summary
- 07:3007:30, 24 November 2023 diff hist 0 高级算法 (Fall 2023)/Problem Set 2 No edit summary
- 07:3007:30, 24 November 2023 diff hist 0 高级算法 (Fall 2023)/Problem Set 2 →Problem 1 (Graph Laplacian) Tag: Visual edit
- 07:2907:29, 24 November 2023 diff hist +204 高级算法 (Fall 2023)/Problem Set 2 No edit summary
- 07:2807:28, 24 November 2023 diff hist +36 高级算法 (Fall 2023)/Problem Set 2 No edit summary
- 07:2807:28, 24 November 2023 diff hist +55 高级算法 (Fall 2023)/Problem Set 2 No edit summary
- 07:2607:26, 24 November 2023 diff hist +549 高级算法 (Fall 2023)/Problem Set 2 →Problem 1 (Adjacency matrix)
- 07:2507:25, 24 November 2023 diff hist −1,409 高级算法 (Fall 2023)/Problem Set 2 →Problem 1 (Min-cut/Max-cut)
- 07:2407:24, 24 November 2023 diff hist +1,986 N 高级算法 (Fall 2023)/Problem Set 2 Created page with "*每道题目的解答都要有完整的解题过程，中英文不限。 *我们推荐大家使用LaTeX, markdown等对作业进行排版。 == Problem 1 (Min-cut/Max-cut) == * ['''Counting <math>\alpha</math>-approximate min-cut'''] For any '''<math>\alpha \ge 1</math>''', a cut is called an '''<math>\alpha</math>'''-approximate min-cut in a multigraph '''<math>G</math>''' if the number of edges in it is at most '''<math>\alpha</math>''' times that of the min-cut...."