Pages that link to "Item:Q5113931"
From MaRDI portal
The following pages link to On connectivity, conductance and bootstrap percolation for a random <i>k</i>‐out, age‐biased graph (Q5113931):
Displaying 3 items.
- The convergence of the exploration process for critical percolation on the \(k\)-out graph (Q888448) (← links)
- Giant descendant trees, matchings, and independent sets in age-biased attachment graphs (Q5086992) (← links)
- On Bollobás‐Riordan random pairing model of preferential attachment graph (Q6074644) (← links)