Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Stochastic kronecker graphs

From MaRDI portal
Publication:5198665
Jump to:navigation, search

DOI10.1002/rsa.20335zbMath1223.05279OpenAlexW2057010485MaRDI QIDQ5198665

Ying Xu, Mohammad Mahdian

Publication date: 9 August 2011

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20335


zbMATH Keywords

random graphsconnectivityweb graphssmall world networksKronecker graphs


Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)


Related Items (3)

The Hitting Time of Multiple Random Walks ⋮ On the diameter of Kronecker graphs ⋮ On matchings in stochastic Kronecker graphs




Cites Work

  • Deterministic Decentralized Search in Random Graphs
  • On the diameter of a class of random graphs
  • Diameters of Random Graphs
  • A new approach to the minimum cut problem
  • A critical point for random graphs with a given degree sequence
  • The diameter of sparse random graphs




This page was built for publication: Stochastic kronecker graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5198665&oldid=19786077"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 16:47.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki