Right-convergence of sparse random graphs (Q466899)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Right-convergence of sparse random graphs
scientific article

    Statements

    Right-convergence of sparse random graphs (English)
    0 references
    0 references
    31 October 2014
    0 references
    This paper studies right-convergence of a sequence of sparse random graphs. A sequence of \(n\)-vertex graphs \(G_n\), \(n\geq1\), is said to be right-converging with respect to a target graph \(W\) if the logarithm of the sum of homomorphism (from \(G_n\) to \(W\)) weights, normalized by \(n\), has a limit. Based on interpolation techniques, the author proves that the sequence of sparse Erdős-Rényi graphs is right-converging provided the tensor product associated with the target graph \(W\) satisfies some convexity property. Both continuous and discrete graphs \(W\) are addressed in the paper.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    random graph
    0 references
    right-convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references