Compression and symmetry of small-world graphs and structures

DOI10.4310/CIS.2022.V22.N2.A5MaRDI QIDQ2148539zbMATH OpenFDO

Authors Yi Heng Lim, Katia Papakonstantinopoulou, Wojtek Szpankowski, Ioannis Kontoyiannis

Publication date 24 June 2022

Published in Communications in Information and Systems (Search for Journal in Brave)

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

zbMATH Keywords

entropygraphical structureinformationlossless compressionrandom graphrandom networksmall-world graphsymmetry

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Probability distributions: general theory (60E05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information theory (general) (94A15) Measures of information, entropy (94A17)

Recommendations

• Compression of dynamic graphs generated by a duplication model
• Fast algorithm for optimal compression of graphs
• Asymmetry and structural information in preferential attachment graphs
• Entropy of some models of sparse random graphs with vertex-names
• Entropy of Digraphs and Infinite Networks

Cited in

(5)

• Asymmetry and structural information in preferential attachment graphs
• Fast algorithm for optimal compression of graphs
• Entropy of some models of sparse random graphs with vertex-names
• Compression and Symmetry of Small-World Graphs and Structures
• Succinct preferential-attachment graphs

This page was built for publication: Compression and symmetry of small-world graphs and structures

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