Skip to content

Commit 733efc1

Browse files
committed
address all TODOs
1 parent 17c5c37 commit 733efc1

File tree

2 files changed

+6
-8
lines changed

2 files changed

+6
-8
lines changed

lectures/eigen.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -854,7 +854,7 @@ is nonnegative, i.e., $a_{ij} \geq 0$ for every $i,j$.
854854

855855
We denote this as $A \geq 0$.
856856

857-
857+
(irreducible)=
858858
### Irreducible Matrices
859859

860860
Let $A$ be a square nonnegative matrix and let $A^k$ be the $k^{th}$ power of A.

lectures/networks.md

Lines changed: 5 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -169,8 +169,7 @@ In the discussion below, we learn to quantify such ideas.
169169

170170
### Example: A Markov Chain
171171

172-
Recall that, in our lecture on Markov chains (TODO add link to new Markov
173-
chain lecture markov_chains.md) we studied a dynamic model of business cycles
172+
Recall that, in our lecture on {ref}`Markov chains <mc_eg2>` we studied a dynamic model of business cycles
174173
where the states are
175174

176175
* "ng" = "normal growth"
@@ -846,7 +845,7 @@ $$
846845
The above result is obvious when $k=1$ and a proof of the general case can be
847846
found in \cite{sargent2022economic}.
848847

849-
Now recall from [TODO add link to Maanasee's eigenvalues lecture] that a
848+
Now recall from {ref}`the eigenvalues lecture <irreducible>` that a
850849
nonnegative matrix $A$ is called irreducible if for each $(i,j)$ there is an integer $k \geq 0$ such that $a^{k}_{ij} > 0$.
851850

852851
From the preceding theorem it is not too difficult (see
@@ -1073,8 +1072,7 @@ Suppose we have a weighted directed graph with adjacency matrix $A$.
10731072
For simplicity we will suppose that the nodes $V$ of the graph are just the
10741073
integers $1, \ldots, n$.
10751074

1076-
Let $r(A)$ denote the spectral radius of $A$. [TODO link to Maanasee's
1077-
lecture on eigenvalues]
1075+
Let $r(A)$ denote the {ref}`spectral radius<neumann_series_lemma>` of $A$.
10781076

10791077
The **eigenvector centrality** of the graph is defined as the $n$-vector $e$ that solves
10801078

@@ -1087,7 +1085,7 @@ The **eigenvector centrality** of the graph is defined as the $n$-vector $e$ tha
10871085

10881086
In other words, $e$ is the dominant eigenvector of $A$ (the eigenvector of the
10891087
largest eigenvalue --- see the discussion of the Perron-Frobenius theorem in
1090-
[TODO link to Maanasee's lecture on eigenvalues]
1088+
{ref}`the eigenvalue lecture <frobenius>`
10911089

10921090
To better understand {eq}`ev_central`, we write out the full expression
10931091
for some element $e_i$
@@ -1231,7 +1229,7 @@ $$
12311229
$$
12321230

12331231

1234-
This follows from the Neumann series theorem [TODO link to Maanasee's lecture].
1232+
This follows from the {ref}`Neumann series theorem<neumann_series_lemma>`.
12351233

12361234
The parameter $\beta$ is used to ensure that $\kappa$ is finite
12371235

0 commit comments

Comments
 (0)