![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_224,w_224)
Mathematics Misc
文章平均质量分 90
Graph Theory, Counting, Probability, Statistics, etc.
The Well-Built City
这个作者很懒,什么都没留下…
展开
-
Absolute Value Inequality
Absolute Value InequalityBase FormVariant 1ProofVariant 2ProofVariant 3x,y∈Rx,y\in\Rx,y∈RBase Form∣x+y∣≤∣x∣+∣y∣|x+y|≤|x|+|y|∣x+y∣≤∣x∣+∣y∣Variant 1∣∣x∣−∣y∣∣≤∣x−y∣||x|-|y|| ≤ |x- y|∣∣x∣−∣y∣∣≤∣x−y∣ProofWe use the technique of “adding 000 wisely”x原创 2021-05-28 15:15:40 · 159 阅读 · 0 评论 -
Central Limit Theorem Overview
We go over the contents and the application of the CLT along with some preliminary introduction to Random Variables and Unbiased Estimators of population parameters. We offer a computational example of CLT in estimating the Sample Mean's distribution.原创 2021-05-17 16:22:43 · 220 阅读 · 1 评论 -
(Counting & Probability) Fisher-Yates Shuffling & Implementation in Java
This note goes over the Fisher-Yates Shuffling, its proof, and implementation in Java.原创 2021-04-25 04:45:23 · 98 阅读 · 0 评论 -
(Counting & Probability) The Counting Principles, Permutation, and Combination
Counting TechniquesMultiplication PrincipleCoin TossPermutation nPnnPnnPnPermutation nPrnPrnPrCombination nCrnCrnCrnCr=nCn−rnCr=nCn-rnCr=nCn−rMore Coin Toss ProblemPermutation With RepetationMultiplication PrincipleIf procedure AAA has aaa (distinct) ou原创 2021-04-04 04:01:13 · 267 阅读 · 0 评论 -
(Graph Theory) Is Minimum Spanning Tree Unique?
Is the Minimum Spanning Tree Unique?The following problem with two parts explores a condition that always implies a unique minimum spanning tree.原创 2021-03-29 00:57:31 · 256 阅读 · 0 评论 -
(Graph Theory) Proving Prim‘s Algorithm
This note proves Prim's Algorithm for finding MST, and it shows why an edge with the minimum weight is always in every MST.原创 2021-03-28 14:33:14 · 112 阅读 · 0 评论 -
(Graph Theory) A Connected Graph has a Spanning Tree
This note goes over a theorem about spanning trees: A Connected Graph has a Spanning Tree原创 2021-03-27 03:23:14 · 209 阅读 · 0 评论 -
(Graph Theory) Important Exercise
In a connected graph, removing any single edge from a cycle retains connectivity.原创 2021-03-25 17:06:06 · 174 阅读 · 0 评论 -
(Graph Theory) Some Properties of Trees (with Proof)
This note briefly goes over a theorem that introduces some key properties of trees. This applies to any kind of trees.原创 2021-03-25 16:33:28 · 109 阅读 · 0 评论 -
(Graph Theory) The Hand Shaking Lemma & Application
This is a short note about the Hand Shaking Lemma and a formula for the sum of degrees of all vertices in a graph. It also provides an example of its application.原创 2021-03-25 01:46:00 · 170 阅读 · 0 评论 -
(Graph Theory) Graphs and Trees
This note briefly goes over some (i.e. not all) topics about graphs and trees. It also contains links to additional posts about relevant topics written by myself.原创 2021-03-23 19:13:54 · 500 阅读 · 0 评论 -
(Graph Theory) Adjacency Matrix
This note briefly goes over the Adjacency Matrix and relevant theorems about how the Adjacency Matrix is related to Graph Isomorphism.原创 2021-03-23 19:07:51 · 531 阅读 · 0 评论