Explore >> Select a destination
|
You are here 
|
www.jeremykun.com | ||
| | | | |
lucatrevisan.wordpress.com
|
|
| | | | | A question that I am very interested in is whether it is possible to study hypergraphs with techniques that are in the spirit of spectral graph theory. It is generally possible to ``flatten'' the adjacency tensor of a hypergraph into a matrix, especially if the hypergraph is $latex {k}&fg=000000$-uniform with $latex {k}&fg=000000$ even, and spectral... | |
| | | | |
a3nm.net
|
|
| | | | | ||
| | | | |
river.me
|
|
| | | | | Embedding a grid on a surface doesn't really work, but we can approximate. | |
| | | | |
djalil.chafai.net
|
|
| | | The logarithmic potential is a classical object of potential theory intimately connected with the two dimensional Laplacian. It appears also in free probability theory via the free entropy, and in partial differential equations e.g. Patlak-Keller-Segel models. This post concerns only it usage for the spectra of non Hermitian random matrices. Let \( {\mathcal{P}(\mathbb{C})} \) be the set of probability measures... | ||
