Skip to content

bug fix in the prob_connected function #45

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
ahmedhindi wants to merge 2 commits into
base: master
Choose a base branch
from
+2 −2
Open

bug fix in the prob_connected function #45

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
5682fc1
Update book.tex
ahmedhindi Jul 1, 2018
59fbf10
Update book.tex
ahmedhindi Jul 2, 2018
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions book/book.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1649,7 +1649,7 @@ \section{Probability of connectivity}
def prob_connected(n, p, iters=100):
tf = [is_connected(make_random_graph(n, p))
for i in range(iters)]
return np.mean(bool)
return np.mean(tf)
\end{code}

The parameters \py{n} and \py{p} are passed along to \py{make_random_graph};
Expand Down Expand Up @@ -2135,7 +2135,7 @@ \section{WS graphs}
consider the edges in a particular order and rewire each one with
probability $p$. If an edge is rewired, they leave the first node
unchanged and choose the second node at random. They don't allow self
loops or multiple edges; that is, you can't have a edge from a node to
loops or multiple edges; that is, you can't have an edge from a node to
itself, and you can't have more than one edge between the same two
nodes.

Expand Down