Explore >> Select a destination
|
You are here 
|
yufeizhao.com | ||
| | | | |
www.jeremykun.com
|
|
| | | | | Graphs are among the most interesting and useful objects in mathematics. Any situation or idea that can be described by objects with connections is a graph, and one of the most prominent examples of a real-world graph that one can come up with is a social network. Recall, if you aren't already familiar with this blog's gentle introduction to graphs, that a graph $ G$ is defined by a set of vertices $ V$, and a set of edges $ E$, each of which connects two vertices. | |
| | | | |
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... | |
| | | | |
www.gaiagamma.com
|
|
| | | The probability distribution for the 2dx die rolling approach of Gaia Gamma by now should be well known. Here is once more the table for it:... | ||
