Right-convergence of sparse random graphs (Q466899): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Yilun Shang / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C80 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C42 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 60C05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6363142 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
random graph | |||
Property / zbMATH Keywords: random graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
right-convergence | |||
Property / zbMATH Keywords: right-convergence / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2101683832 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1202.3123 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the concentration of the number of solutions of random satisfiability formulas / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convergent sequences of dense graphs. II. Multiway cuts and statistical physics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Left and right convergence of graphs with bounded degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial approach to the interpolation method and scaling limits in sparse random graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3682518 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sparse graphs: Metrics and random models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recurrence of distributional limits of finite planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4550237 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4660718 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Antiferromagnetic Potts model on the Erdős-Rényi random graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The large deviation principle for the Erdős-Rényi random graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The thermodynamic limit in mean field spin glass models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Replica bounds for optimization problems and diluted spin systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Replica bounds for diluted non-Poissonian spin systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear phase transition in random linear constraint satisfaction problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The set of solutions of random XORSAT formulae / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4519896 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4899293 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Limits of dense graph sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Information, Physics, and Computation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tight Bounds for LDPC and LDGM Codes Under MAP Decoding / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds for diluted mean-fields spin glass models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mean Field Models for Spin Glasses / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 06:27, 9 July 2024
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
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
random graph
0 references
right-convergence
0 references
0 references
0 references