On isomorphism-invariant antistochastic properties of random graphs

DOI10.1137/23M1575287MaRDI QIDQ6654120

Andrey B. Kupavskii, M. E. Zhukovskii, Sergei Kiselev, Oleg Verbitsky

Publication date: 18 December 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

random graphscovering codesnetwork resiliencecanonical labeling

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Mathematical problems of computer architecture (68M07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Degree sequences of random graphs
• Asymptotic enumeration by degree sequence of graphs of high degree
• Unit sphere packings and coverings of the Hamming space
• On the modular value and fractional part of a random variable
• Covering codes with improved density
• Random Graph Isomorphism
• The degree sequence of a random graph. I. The models
• Coupling Scale-Free and Classical Random Graphs
• Robustness and Vulnerability of Scale-Free Random Graphs
• Characterization of robustness and resilience in graphs: a mini-review
• Alternative Metrics
• EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs
• Adversarial Deletion in a Scale-Free Random Graph Process
• On anti-stochastic properties of unlabeled graphs
• Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph

This page was built for publication: On isomorphism-invariant antistochastic properties of random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6654120)