Are randomly grown graphs really random?
We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined b...
Publications
3 shownThe Design and Analysis of Computer Algorithms
A text book for a first course in design and analysis of algorithms. The emphasis is on ideas and ease of understanding rather then on implementation details or programming tric...
Frequent Co-Authors
Researcher Info
- h-index
- 3
- Publications
- 3
- Citations
- 9,982
- Institution
- Cornell University
External Links
Identifiers
- ORCID
- 0000-0001-8681-6075
Impact Metrics
h-index
3
h-index: Number of publications with at least h citations each.