Explore >> Select a destination
|
You are here 
|
yufeizhao.com | ||
| | | | |
yufeizhao.wordpress.com
|
|
| | | | | Eyal Lubetzky and I just finished and uploaded to the arXiv our new paper On the variational problem for upper tails of triangle counts in sparse random graphs. This paper concerns the following question: The upper tail problem for triangles. What is the probability that the number of triangles in an Erd?s-Rényi graph graph $latex... | |
| | | | |
anuragbishnoi.wordpress.com
|
|
| | | | | Finite geometry is often used to construct graphs with certain extremal properties. For example, the Norm graphs are one of the best-known constructions in extremal graph theory (see this for a geometrical description of these graphs). Similarly, generalized polygons, and their substructures, give various constructions in Ramsey theory, the degrtocee-diameter problem, and the (bipartite) forbidden... | |
| | | | |
ptreview.sublinear.info
|
|
| | | | | ||
| | | | |
transformer-circuits.pub
|
|
| | | We describe an approach to tracing the "step-by-step" computation involved when a model responds to a single prompt. | ||
