Random multi-hooking networks

DOI10.1017/S0269964822000523MaRDI QIDQ6965272zbMATH OpenFDO

Authors Kiran R. Bhutani, Ravi Kalpathy, Hosam M. Mahmoud

Publication date 3 July 2025

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/S0269964822000523

zbMATH Keywords

asymptotic analysisdegree profilehooking networksrandom graphrecurrence

Mathematics Subject Classification ID

Distance in graphs (05C12) Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial probability (60C05) Stochastic network models in operations research (90B15)

Cites work

• A SPECTRUM OF SERIES–PARALLEL GRAPHS WITH MULTIPLE EDGE EVOLUTION
• Asymptotic normality of degree counts in a preferential attachment model
• Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet
• Building random trees from blocks
• Degree distributions of generalized hooking networks
• Degrees in random self-similar bipolar networks
• Depths in hooking networks
• scientific article; zbMATH DE number 53861 (Why is no real title available?)
• scientific article; zbMATH DE number 1409903 (Why is no real title available?)
• Local and global degree profiles of randomly grown self-similar hooking networks under uniform and preferential attachment
• Normal limit laws for vertex degrees in randomly grown hooking networks and bipolar networks
• On Random Binary Trees
• Random Trees
• Split-decomposition trees with prime nodes: enumeration and random generation of cactus graphs
• The degree distribution of thickened trees

This page was built for publication: Random multi-hooking networks

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