From 6e38a4939bf56ae9bfb19eb0556308c2387b9282 Mon Sep 17 00:00:00 2001 From: Mark Date: Thu, 5 Oct 2023 10:45:57 -0700 Subject: [PATCH] Minor edits --- Advanced/Random Walks/parts/0 random.tex | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/Advanced/Random Walks/parts/0 random.tex b/Advanced/Random Walks/parts/0 random.tex index f94678e..2e881f7 100644 --- a/Advanced/Random Walks/parts/0 random.tex +++ b/Advanced/Random Walks/parts/0 random.tex @@ -6,8 +6,8 @@ We would like to compute the probability of our particle stopping at node $A$. \ \vspace{2mm} -In other words, we want a function $P(n): N \to [0, 1]$ that returns the probability that our particle stops at $A$. -Naturally, $N$ be the set of nodes in $G$. +In other words, we want a function $P(n): N \to [0, 1]$ that returns the probability that our particle stops at $A$, +where $N$ is the set of nodes in $G$. \begin{center} \begin{tikzpicture} @@ -226,7 +226,7 @@ to $x$ and a $\frac{1}{8}$ probability of moving to $z$. \par -\problem{} +\problem{} Say a particle on node $x$ has neighbors $v_1, v_2, ..., v_n$ with weights $w_1, w_2, ..., w_n$. \par The edge $(x, v_1)$ has weight $w_1$. Find $P(x)$ in terms of $P(v_1), P(v_2), ..., P(v_n)$.