Back to Results
First PageMeta Content
Stochastic processes / Markov processes / Markov chain / Random walk / Random graph / Degree distribution / Matrices / Central limit theorem / Loop-erased random walk / Statistics / Mathematics / Graph theory


Mixing Times for Random Walks on Geometric Random Graphs Stephen Boyd Arpita Ghosh
Add to Reading List

Document Date: 2005-07-06 08:19:10

Open Document

File Size: 183,18 KB

Share Result on Facebook

Company

Oxford University Press / Cambridge University Press / /

Country

United Kingdom / /

Currency

pence / /

/

Facility

square C0 / Square Grid / Stanford University / Information Systems Laboratory / square Cl / /

IndustryTerm

ad-hoc wireless networks / distributed averaging algorithm / Gossip algorithms / sensor networks / iterative averaging algorithms / wireless sensor network / wireless ad-hoc networks / wireless networks / /

Organization

Cambridge University / Nuclear Regulatory Commission / Stanford University / MARCO Focus Center for Circuit and System Solution / Department of Statistics / Geometric Random Graphs Stephen Boyd Arpita Ghosh Balaji Prabhakar Devavrat Shah ∗† Information Systems Laboratory / Oxford University / V P / Stanford University Stanford / /

Position

Author / Prime Minister / model for ad-hoc wireless networks / /

Product

Pentax K-x Digital Camera / /

ProvinceOrState

California / /

PublishedMedium

IEEE Transactions on Information Theory / /

SportsLeague

Stanford University / /

Technology

Covering algorithms / weP / distributed averaging algorithm / iterative averaging algorithms / dom / html / Gossip algorithms / /

URL

www.stanford.edu/~devavrat/infocom05.ps / www.stanford.edu/~boyd/fmmc.html / /

SocialTag