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
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Percolation of arbitrary uncorrelated nested subgraphs

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

DOI10.1140/EPJB/E2010-00246-7zbMath1515.82078arXiv0809.3727MaRDI QIDQ6176629

Bernat Corominas-Murtra

Publication date: 26 July 2023

Published in: The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0809.3727


zbMATH Keywords

degree distributioncluster size distributionnode removalgiant componentpercolation threshold


Mathematics Subject Classification ID

Percolation (82B43)


Related Items (1)

Catastrophic event phenomena in communication networks: a survey




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • The asymptotic connectivity of labelled regular graphs
  • A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
  • The asymptotic number of labeled graphs with given degree sequences
  • Nested subgraphs of complex networks
  • A critical point for random graphs with a given degree sequence




This page was built for publication: Percolation of arbitrary uncorrelated nested subgraphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6176629&oldid=35660853"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 10 July 2024, at 06:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki