A short proof of the equivalence of left and right convergence for sparse graphs (Q901148): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Processes on unimodular random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the partition function for graph homomorphisms / 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: Sparse graphs: Metrics and random models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent sequences of sparse graphs: A large deviations approach / 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: Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing / 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: Endomorphisms of symbolic algebraic varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of locally-globally convergent graph sequences / rank
 
Normal rank

Revision as of 05:46, 11 July 2024

scientific article
Language Label Description Also known as
English
A short proof of the equivalence of left and right convergence for sparse graphs
scientific article

    Statements

    Identifiers