Random Graphs and Their Subgraphs

DOI10.1007/978-3-030-44097-8_16zbMath1473.05286arXiv1902.01171OpenAlexW2914375559MaRDI QIDQ5126349

Klemens Taglieber, Uta Renata Freiberg

Publication date: 16 October 2020

Published in: Discrete and Continuous Models in the Theory of Networks (Search for Journal in Brave)

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

zbMATH Keywords

Markov chains on graphsreal world networks

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Analytic circuit theory (94C05) Signed and weighted graphs (05C22)

Related Items (1)

A mean-field approximation of SIR epidemics on an Erdös-Rényi network model

Uses Software

• Gephi
• Unnamed Item

Cites Work

• Random walks and the effective resistance of networks
• Random Graphs and Complex Networks
• Emergence of Scaling in Random Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Random Graphs and Their Subgraphs