PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Lectures on modern convex optimization: analysis, algorithms, and engineering applications
Lectures on modern convex optimization: analysis, algorithms, and engineering applications
Proceedings of the 32nd conference on Winter simulation
Handbook of Graphs and Networks: From the Genome to the Internet
Handbook of Graphs and Networks: From the Genome to the Internet
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On certain connectivity properties of the internet topology
Journal of Computer and System Sciences - Special issue on FOCS 2003
Graph evolution: Densification and shrinking diameters
ACM Transactions on Knowledge Discovery from Data (TKDD)
Random Graph Dynamics (Cambridge Series in Statistical and Probabilistic Mathematics)
Random Graph Dynamics (Cambridge Series in Statistical and Probabilistic Mathematics)
Towards a Study of Low-Complexity Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
RTG: a recursive realistic graph generator using random typing
Data Mining and Knowledge Discovery
RTG: A Recursive Realistic Graph Generator Using Random Typing
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
Kronecker Graphs: An Approach to Modeling Networks
The Journal of Machine Learning Research
Spatial models for virtual networks
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Graph matching based on dot product representation of graphs
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Graph matching based on spectral embedding with missing value
Pattern Recognition
| Hi-index | 0.00 |
Inspired by the recent interest in combining geometry with random graph models, we explore in this paper two generalizations of the random dot product graph model proposed by Kraetzl, Nickel and Scheinerman, and Tucker [1,2]. In particular we consider the properties of clustering, diameter and degree distribution with respect to these models. Additionally we explore the conductance of these models and show that in a geometric sense, the conductance is constant.