Trawling the Web for emerging cyber-communities
WWW '99 Proceedings of the eighth international conference on World Wide Web
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
The degree sequence of a scale-free random graph process
Random Structures & Algorithms
Compact representations of separable graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Random Structures & Algorithms
Stochastic models for the Web graph
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Random Evolution in Massive Graphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On Certain Connectivity Properties of the Internet Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
The Diameter of a Scale-Free Random Graph
Combinatorica
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
Degree distribution of the FKP network model
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The web as a graph: measurements, models, and methods
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Statistical properties of community structure in large social and information networks
Proceedings of the 17th international conference on World Wide Web
Local/Global Phenomena in Geometrically Generated Graphs
Algorithms and Models for the Web-Graph
Kronecker Graphs: An Approach to Modeling Networks
The Journal of Machine Learning Research
Constructing and sampling graphs with a prescribed joint degree distribution
Journal of Experimental Algorithmics (JEA)
Network topology models for multihop wireless networks
ISRN Communications and Networking
| Hi-index | 0.00 |
A detailed understanding of expansion in complex networks can greatly aid in the design and analysis of algorithms for a variety of important network tasks, including routing messages, ranking nodes, and compressing graphs. This has motivated several recent investigations of expansion properties in real-world graphs and also in random models of real-world graphs, like the preferential attachment graph. The results point to a gap between real-world observations and theoretical models. Some real-world graphs are expanders and others are not, but a graph generated by the preferential attachment model is an expander whp. We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distribution where the expansion property depends on a tunable parameter of the model. The vertices of Gn are n sequentially generated points x1, x2, ..., xn chosen uniformly at random from the unit sphere in R3. After generating xt, we randomly connect it to m points from those points in x1, x2, ..., xt-1....