12:23 AM
13 hours later…
1:04 PM
May 29 '18 at 1:13, by Martin Sleziak
Two new tags in the same question - graphons and graph-limits.
new-tag A new tag graphon was created by John Cataldo. He created also a tag-excerpt and a tag-wiki.
In graph theory and statistics, a graphon (also known as a graph limit) is a symmetric measurable function
W
:
[
0
,
1
]
2
→
[
0
,
1
]
{\displaystyle W:[0,1]^{2}\to [0,1]}
, that is important in the study of dense graphs. Graphons arise both as a natural notion for the limit of a sequence of dense graphs, and as the fundamental defining objects of exchangeable random graph models. Graphons are tied to dense...
0
Consider the random graph generating process from a graphon. A random graph model is an exchangeable random graph model if and only if it can be defined in terms of a (possibly random) graphon. It follows from this definition and the law of large numbers that, if $W\ne0$, exchangeable random g...
Posts where the tag graphons was added removed (including the editors): data.stackexchange.com/math/query/1105163/… data.stackexchange.com/math/query/1038474/…
So the tag graphons was probably removed by the script which removes tags with a single occurrence after 6 months - since nothing is visible in the revision history: math.stackexchange.com/posts/2799216/revisions
Posts where the tag graphon was added removed (including the editors): data.stackexchange.com/math/query/1105163/… data.stackexchange.com/math/query/1038474/…
The above queries did not find older occurrences of graphon. But, as I mentioned, graphons existed for on one question.
May 29 '18 at 1:13, by Martin Sleziak
0
$\newcommand{\mc}{\mathcal}$ $\newcommand{\set}[1]{\{#1\}}$ Notation and Definitions Let $G=(V, E)$ be a graph. For $X, Y\subseteq V$, we write $e_G(X, Y)$ to denote the number of edges in $G$ with one end-point in $X$ and the other end-point in $Y$; the edges with both end-points in $X\cap Y$ ...
« first day (2945 days earlier) ← previous day next day → last day (1396 days later) »