Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

WAW
2007
Springer

favoriteEmaildiscussreport

120views Algorithms» more WAW 2007»

Giant Component and Connectivity in Geographical Threshold Graphs

13 years 10 months ago

Giant Component and Connectivity in Geographical Threshold Graphs

Download math.lanl.gov

The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We study this model and give conditions for the absence and existence of the giant component, as well as for connectivity.

Milan Bradonjic, Aric A. Hagberg, Allon G. Percus

Real-time Traffic

Algorithms | Graph Model | Random Graph Model | Threshold Graph Model | WAW 2007 |

claim paper

Related Content

» The Structure of Geographical Threshold Graphs

» Component structure induced by a random walk on a random graph

» A random graph model for massive graphs

» Ramsey games with giants

» Exact Covariance Thresholding into Connected Components for LargeScale Graphical Lasso

» Weighted graphs and disconnected components patterns and a generator

» Stochastic Kronecker Graphs

» Multiplicative Attribute Graph Model of RealWorld Networks

» Connectivity in Wireless Adhoc Networks with a Lognormal Radio Model

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	WAW
Authors	Milan Bradonjic, Aric A. Hagberg, Allon G. Percus

Comments (0)