On random irregular subgraphs
Copyright policy )On random irregular subgraphs
AbstractLet be a ‐regular graph on vertices. Frieze, Gould, Karoński, and Pfender began the study of the following random spanning subgraph model . Assign independently to each vertex of a uniform random number , and an edge of is an edge of if and only if . Addressing a problem of Alon and Wei, we prove that if , then with high probability, for each nonnegative integer , there are vertices of degree in .
- California Institute of Technology United States
- College of New Jersey United States
- Stanford University United States
concentration, random irregular subgraphs, irregular subgraph, Probability (math.PR), Random graphs (graph-theoretic aspects), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Mathematics - Probability, random graph
concentration, random irregular subgraphs, irregular subgraph, Probability (math.PR), Random graphs (graph-theoretic aspects), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Mathematics - Probability, random graph
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).3 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!