/explore
|
You are here 
|
www.jeremykun.com | ||
| | | | |
www.nature.com
|
|
| | | | | Despite the growing interest in characterizing the local geometry leading to the global topology of networks, our understanding of the local structure of complex networks, especially real-world networks, is still incomplete. Here, we analyze a simple, elegant yet underexplored measure, degree difference (DD) between vertices of an edge, to understand the local network geometry. We describe the connection between DD and global assortativity of the network from both formal and conceptual perspective, and s... | |
| | | | |
jeremykun.wordpress.com
|
|
| | | | | Define the Ramsey number $ R(k,m)$ to be the minimum number $ n$ of vertices required of the complete graph $ K_n$ so that for any two-coloring (red, blue) of the edges of $ K_n$ one of two things will happen: There is a red $ k$-clique; that is, a complete subgraph of $ k$... | |
| | | | |
blog.evjang.com
|
|
| | | | | You can find a PDF version of this blog post here . A weighted graph is a data structure consisting of some vertices and edges, and each... | |
| | | | |
schmidhuberj.de
|
|
| | | In this blog post, I will talk about dynamic graphs, which will be the area of work in which I will start writing my master's thesis soon. While this blog post will be more mathematical than any of my other blog posts so far, I tried to make everything as beginner-friendly as possible. Even if you don't have any knowledge about theoretical computer science, or you are just getting started, this blog post should be understandable. | ||
