Comparing node degrees in probabilistic networks

DOI10.1093/COMNET/CNZ003MaRDI QIDQ4958787zbMATH OpenOpenAlexWikidataFDO

Authors Amin Kaveh, Matteo Magnani, Christian Rohner

Publication date 15 September 2021

Published in Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comnet/cnz003

zbMATH Keywords

degreeedge probabilityexpected degreeprobabilistic networksskewnessvariance

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 5654190
• On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
• Quick detection of nodes with large degrees
• On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph
• Efficient generation of networks with given expected degrees

This page was built for publication: Comparing node degrees in probabilistic networks

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