Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published October 2009 | Published
Book Section - Chapter Open

Generalizing Kronecker graphs in order to model searchable networks


This paper describes an extension to stochastic Kronecker graphs that provides the special structure required for searchability, by defining a "distance"-dependent Kronecker operator. We show how this extension of Kronecker graphs can generate several existing social network models, such as the Watts-Strogatz small-world model and Kleinberg's latticebased model. We focus on a specific example of an expanding hypercube, reminiscent of recently proposed social network models based on a hidden hyperbolic metric space, and prove that a greedy forwarding algorithm can find very short paths of length O((log log n)^2) for graphs with n nodes.

Additional Information

© 2009 IEEE.

Attached Files

Published - Bodine2009p109232009_47Th_Annual_Allerton_Conference_On_Communication_Control_And_Computing_Vols_1_And_2.pdf



Additional details

August 19, 2023
August 19, 2023