z-logo
Premium
Stochastic kronecker graphs
Author(s) -
Mahdian Mohammad,
Xu Ying
Publication year - 2011
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
ISBN - 3-540-77003-8
DOI - 10.1002/rsa.20335
Subject(s) - kronecker delta , kronecker product , giant component , random graph , stochastic matrix , complex network , computer science , mathematics , graph , statistical physics , theoretical computer science , combinatorics , physics , statistics , markov chain , quantum mechanics
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large‐scale real‐world networks such as the web. This model simultaneously captures several well‐known properties of real‐world networks; in particular, it gives rise to a heavy‐tailed degree distribution, has a low diameter, and obeys the densification power law. Most properties of Kronecker products of graphs (such as connectivity and diameter) are only rigorously analyzed in the deterministic case. In this article, we study the basic properties of stochastic Kronecker products based on an initiator matrix of size two (which is the case that is shown to provide the best fit to many real‐world networks). We will show a phase transition for the emergence of the giant component and another phase transition for connectivity, and prove that such graphs have constant diameters beyond the connectivity threshold, but are not searchable using a decentralized algorithm. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 38, 453–466, 2011

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here