Large deviations of the greedy independent set algorithm on sparse random graphs (Q6052466): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4940906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4026425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of discrete Euler equations and discrete Hamiltonian systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3689492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large deviations for subcritical bootstrap percolation on the Erdős-Rényi graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385084 / 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: Scaling limits and generic bounds for exploration processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5786094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On colouring random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3437109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Ordinary Differential Equations I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The transitive closure of a random digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4507789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric sampling procedures, general epidemic processes and their threshold limit theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The critical random graph, with martingales / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the probable behaviour of some algorithms for finding the stability number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Deviations with Diminishing Rates / rank
 
Normal rank

Latest revision as of 06:11, 3 August 2024

scientific article; zbMATH DE number 7751080
Language Label Description Also known as
English
Large deviations of the greedy independent set algorithm on sparse random graphs
scientific article; zbMATH DE number 7751080

    Statements

    Large deviations of the greedy independent set algorithm on sparse random graphs (English)
    0 references
    0 references
    17 October 2023
    0 references
    discrete calculus
    0 references
    Euler-Lagrange equation
    0 references
    greedy algorithm
    0 references
    independent set
    0 references
    large deviations
    0 references
    random graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references