Graph limits are the study of graphons, the compactification of the set of finite simple undirected graphs. This tag does NOT refer to limits of functions drawn pictorially in the plane.
Use this tag in conjunction with [tag:graph-theory] if your question is about graphons or graph limits.
Finite graphs $(V,E)$ can be expressed as symmetric borel-measurable functions of the form $f:[0,1]^2\to[0,1]$ by picking an injection $p:V\to[0,1]$ and defining $f$ as
$$f(i,j)=\begin{cases}1&p(v)=i,\;p(w)=j,\;(v,w)\in E,\\ 0&\text{otherwise}\end{cases}$$
The set of graphons is the set of borel-measurable symmetric functions $f:[0,1]^2\to[0,1]$ under the equivalence relation of almost everywhere equality. The set can be viewed as the compactification of the set of finite graphs under the quotient topology, or as the set of limits of finite graphs where each graph is strictly finer than the next.
Use this tag when asking a question regarding the usage or construction of graphons. Make sure to also use tags such as graph-theory when using this tag.