An in-depth analysis of stochastic Kronecker graphs
From MaRDI portal
Publication:5395712
DOI10.1145/2450142.2450149zbMath1281.05123arXiv1102.5046OpenAlexW2057444638MaRDI QIDQ5395712
C. Seshadhri, Ali Pınar, Tamara G. Kolda
Publication date: 17 February 2014
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.5046
Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)
Related Items (7)
The Hitting Time of Multiple Random Walks ⋮ GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU ⋮ Sampling online social networks by random walk with indirect jumps ⋮ On the diameter of Kronecker graphs ⋮ On matchings in stochastic Kronecker graphs ⋮ Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities ⋮ The Kronecker-clique model for higher-order clustering coefficients
This page was built for publication: An in-depth analysis of stochastic Kronecker graphs