/explore
|
You are here 
|
gregorygundersen.com | ||
| | | | |
rjlipton.com
Can the permanent of stable negative matrices be approximated? Eric Vigoda is one of the top experts in the world in the area of Markov Chain Monte Carlo methods. He shared the prestigious Fulkerson Prize with Mark Jerrum and Alistair Sinclair for their brilliant work (JSV) on approximations to the permanent. Today I would like... |
|
| | | | | ||
| | | | |
667-per-cm.net
This post could also be subtitled "Residual deviance isn't the whole story." My favorite book on logistic regression is by Dr Joseph Hilbe, Logistic Regression Models, CRC Press, 2009, Chapman & Hill. It is a solidly frequentist text, but its discussion of models and rich examples make that besides the point. Except in one case.... |
|
| | | | | ||
| | | | |
twiecki.io
|
|
| | | | | ||
| | | | |
www.jeremykun.com
For fixed integers $ r > 0$, and odd $ g$, a Moore graph is an $ r$-regular graph of girth $ g$ which has the minimum number of vertices $ n$ among all such graphs with the same regularity and girth. (Recall, A the girth of a graph is the length of its shortest cycle, and it's regular if all its vertices have the same degree) Problem (Hoffman-Singleton): Find a useful constraint on the relationship between $ n$ and $ r$ for Moore graphs of girth $ 5$ and degree $ r$. |
|
| | | |||
