Nathan Albin
K-State Mathematics
All paths connecting A to B
All paths connecting A to B
admissible but not optimal
\(1\)
\(1\)
\(1\)
\(1\)
\(1\)
\(1\)
\(2\)
\(1\)
\(\frac{2}{3}\)
\(\frac{5}{3}\)
\(1\)
\(1\)
\(1\)
\(1\)
\(1\)
\(1\)
\(2\)
\(1\)
\(\frac{2}{3}\)
\(\frac{5}{3}\)
\(\underline{\gamma},\underline{\gamma'}\) are iid random paths
\(\mathbb{P}\left(\underline{\gamma}=\gamma_i\right) = \mu(\gamma_i)\)
\(\underline{\gamma},\underline{\gamma'}\) are iid random paths
\(\mathbb{P}\left(\underline{\gamma}=\gamma_i\right) = \mu(\gamma_i)\)
\(\underline{\gamma},\underline{\gamma'}\) are iid random paths
\(\mathbb{P}\left(\underline{\gamma}=\gamma_i\right) = \mu(\gamma_i)\)
pmfs on \(\Gamma\)
modulus prefers short paths + variety
\(k\) parallel paths of length \(\ell\)
\(\mu(\gamma_i)=\frac{1}{k}\) for \(i=1,2,\ldots,k\)
is a metric for \(1<p<\infty\)
In general, \(\Gamma\subset\mathbb{R}^E_{\ge 0}\)
Key Example:
\(\Gamma\) = \(ab\)-paths
\(\hat{\Gamma}\) = \(ab\)-cuts
\(1-\alpha\)
\(1-\alpha\)
\(1\)
\(\alpha\)
\(\frac{1}{3}\)
\(\frac{1}{3}\)
\(1\)
\(\frac{2}{3}\)
\(\frac{3}{5}\)
\(\frac{2}{5}\)
\(\frac{1}{5}\)
\(\frac{1}{5}\)
\(\frac{1}{3}\)
\(\frac{1}{3}\)
\(1\)
\(\frac{2}{3}\)
\(\mu(\gamma_2)=\frac{2}{3}\)
\(\mu(\gamma_1)=\frac{1}{3}\)
| family | property |
|---|---|
| connecting paths | metrics |
| spanning trees | hierarchical structure |
| cycles | communities |
| center-to-shell paths | centrality |
| via walks | betweenness |
What do we need?
For example,
these slides