Editing Open Problems:22
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 1: | Line 1: | ||
− | {{ | + | {{DISPLAYTITLE:Problem 22: Random Walks}} |
− | | | + | {{Infobox |
− | | | + | |label1 = Proposed by |
+ | |data1 = Rina Panigrahy | ||
+ | |label2 = Source | ||
+ | |data2 = [[Workshops:Kanpur_2009|Kanpur 2009]] | ||
+ | |label3 = Short link | ||
+ | |data3 = http://sublinear.info/22 | ||
}} | }} | ||
The paper of Das Sarma, Gollapudi, and Panigrahy {{cite|DasSarmaGP-08}} shows a method for performing random walks in the streaming model. In particular, a random walk of length $l$ can be simulated | The paper of Das Sarma, Gollapudi, and Panigrahy {{cite|DasSarmaGP-08}} shows a method for performing random walks in the streaming model. In particular, a random walk of length $l$ can be simulated | ||
Line 7: | Line 12: | ||
Das Sarma et al. {{cite|DasSarmaGP-08}} simulate random walks to approximate the probability distribution on the vertices of the graph after a random walk of length $l$. What is the streaming complexity of approximating this distribution? What is the streaming complexity of finding the $k$ (approximately) most likely vertices after a walk of length $l$? | Das Sarma et al. {{cite|DasSarmaGP-08}} simulate random walks to approximate the probability distribution on the vertices of the graph after a random walk of length $l$. What is the streaming complexity of approximating this distribution? What is the streaming complexity of finding the $k$ (approximately) most likely vertices after a walk of length $l$? | ||
− | |||
− |