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 is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509–512, 1999.
M. Bastian, S. Heymann, and M. Jacomy. Gephi: An open source software for exploring and manipulating networks, 2009. http://www.aaai.org/ocs/index.php/ICWSM/09/paper/view/154.
B. Bollobás. Modern Graph Theory. Springer, 1998.
P. Erdős and A. Rényi. On random graphs I. Publ. Math. Debrecen, 6:290–297, 1959.
P. Erdős and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci., 5(1):17–60, 1960.
P. Erdős and A. Rényi. On the evolution of random graphs. Bull. Inst. Internat. Statist., 38(4):343–347, 1961.
P. Frisco. Network model with structured nodes. Physical Review, 84(2):021931, 2011.
W. H. Hayt Jr., J. E. Kemmerly, and S. M. Durbin. Engineering Circuit Analysis. The McGraw-Hill Companies, Inc., 8. edition, 2012.
R Development Core Team. R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria, 2008. ISBN 3-900051-07-0, http://www.R-project.org.
P. Tetali. Random walks and the effective resistance of networks. Journal of Theoretical Probability, 4(1):101–109, 1991.
R. van der Hofstad. Random Graphs and Comples Networks Volume I. Cambridge University Press, 2017.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Taglieber, K., Freiberg, U. (2020). Random Graphs and Their Subgraphs. In: Atay, F., Kurasov, P., Mugnolo, D. (eds) Discrete and Continuous Models in the Theory of Networks. Operator Theory: Advances and Applications, vol 281. Birkhäuser, Cham. https://doi.org/10.1007/978-3-030-44097-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-44097-8_16
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-030-44096-1
Online ISBN: 978-3-030-44097-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)