Directed Random Dot Product Graphs

In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to clustering, the small world property, and degree distribution. These models are motivated by the random dot product graphs developed by Kraetzl, Nickel, and Scheinerman. We extend their results to fully parameterize the conditions under which clustering occurs, characterize the diameter of graphs generated by these models, and describe the behavior of the degree distribution.

[1]  Anna R. Karlin,et al.  Spectral analysis of data , 2001, STOC '01.

[2]  M. A. Muñoz,et al.  Scale-free networks from varying vertex intrinsic fitness. , 2002, Physical review letters.

[3]  Cristopher Moore,et al.  On the bias of traceroute sampling: or, power-law degree distributions in regular graphs , 2005, STOC '05.

[4]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[5]  Peng Xie,et al.  Sampling biases in IP topology measurements , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  Nico M. Temme.  Large parameter cases of the Gauss hypergeometric function , 2002 .

[7]  Ali Esmaili,et al.  Probability and Random Processes , 2005, Technometrics.

[8]  Cristopher Moore,et al.  On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs , 2005, JACM.

[9]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[10]  Aharon Ben-Tal,et al.  Lectures on modern convex optimization , 1987 .

[11]  Amin Saberi,et al.  On certain connectivity properties of the Internet topology , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[12]  C. Nickel.  RANDOM DOT PRODUCT GRAPHS A MODEL FOR SOCIAL NETWORKS , 2008 .

[13]  M. Abramowitz,et al.  Handbook of Mathematical Functions With Formulas, Graphs and Mathematical Tables (National Bureau of Standards Applied Mathematics Series No. 55) , 1965 .

[14]  Alan M. Frieze,et al.  A Geometric Preferential Attachment Model of Networks , 2004, WAW.

[15]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[16]  Fan Chung Graham,et al.  Duplication Models for Biological Networks , 2002, J. Comput. Biol..

[17]  Verzekeren Naar Sparen,et al.  Cambridge , 1969, Humphrey Burton: In My Own Time.

[18]  Amin Saberi,et al.  Random Walks with Lookahead on Power Law Random Graphs , 2006, Internet Math..

[19]  Eli Upfal,et al.  The Web as a graph , 2000, PODS.

[20]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[21]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[22]  R. Durrett.  Random Graph Dynamics: References , 2006 .

[23]  Stefan Bornholdt,et al.  Handbook of Graphs and Networks: From the Genome to the Internet , 2003 .

[24]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[25]  Aravind Srinivasan,et al.  Structural and algorithmic aspects of massive social networks , 2004, SODA '04.

[26]  Christos Gkantsidis,et al.  Hybrid search schemes for unstructured peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[27]  Rick Durrett,et al.  Random Graph Dynamics (Cambridge Series in Statistical and Probabilistic Mathematics) , 2006 .

[28]  G. Grimmett,et al.  Probability and random processes , 2002 .