Algorithms on Random Graphs
97 pages· 2009· ISBN 9781109214758
About
The central topic of this thesis is the analysis and design of algorithms on random graphs. First we study the effect that the PageRank algorithm has on the evolution of a random graph, as a model of the web graph. Next, we give a linear time algorithm for finding a maximum cardinality matching in a random graph, and an efficient algorithm for sampling a weak coloring at random in simple hypergraphs. This is followed by an analysis of a random-walk cuckoo hashing scheme, which, although not stated in the problem, depends on analyzing a random walk in a random graph. Finally we consider the expected Vickrey costs for random combinatorial auctions.
Discuss Algorithms on Random Graphs with other readers
Join or start a book club for Algorithms on Random Graphs on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Algorithms on Random Graphs?
Sign up free on Readfeed, then browse public clubs or start your own club with Algorithms on Random Graphs as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Algorithms on Random Graphs with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Algorithms on Random Graphs with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.