pith. sign in

arxiv: 1902.01171 · v1 · pith:2NVW5PFOnew · submitted 2019-02-04 · 🧮 math.PR

Random graphs and their subgraphs

classification 🧮 math.PR
keywords graphsnetworksrandomsubgraphsadditionallyanalyzeattachmentconnectedness
0
0 comments X
read the original abstract

Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are inherited by differently constructed subgraphs. We also give a formula for the variance of the degrees of fixed nodes in the preferential attachment model and additionally draw a connection between weighted graphs and electrical networks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.