Giant component and connectivity in geographical threshold graphs

Authors:
Milan Bradonjić;Aric Hagberg;Allon G. Percus
Affiliations:
Department of Electrical Engineering, UCLA, Los Angeles, CA;Mathematical Modeling and Analysis, Theoretical Division, Los Alamos National Laboratory, Los Alamos, NM;Department of Mathematics, UCLA, Los Angeles, CA and Information Sciences Group, Los Alamos National Laboratory, Los Alamos, NM
Venue:
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Year:
2007

Citing 7
Cited 1

On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A random graph model for massive graphs

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The degree sequence of a scale-free random graph process

Random Structures & Algorithms
Handbook of massive data sets

Handbook of massive data sets
Stochastic models for the Web graph

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The web as a graph: measurements, models, and methods

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
A survey of models of the web graph

CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking

Estimating node similarity from co-citation in a spatial graph model

Proceedings of the 2010 ACM Symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.