Abstract
This paper presents a general recursive formula to estimate the number of labeled graphs as well as details to evaluate the formula for the following graph properties: number of edges (graph density), degree sequence, degree distribution, classification mixing, and degree mixing, i.e., the formula estimates the number of labeled graphs that have given values for graph properties. The proposed approach can be extended to additional graph properties (e.g., number of triangles) as well as properties of bipartite graphs. For special settings in which formulas exist from previous research, simulation studies demonstrate the validity of the proposed approach. In addition, we demonstrate how our approach can be used to quantify the level of variability in values of a graph property in the subset of graphs that hold a specified value of a different graph property (or properties) constant.
Funder
National Institute of Health
Subject
Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science
Reference19 articles.
1. Harary, F., and Palmer, E.M. (2014). Graphical Enumeration, Elsevier.
2. Bridging the gap between graphs and networks;Battiston;Commun. Phys.,2020
3. Evaluation of SARS-CoV-2 transmission mitigation strategies on a university campus using an agent-based network model;Goyal;Clin. Infect. Dis.,2021
4. Examining sars-cov-2 interventions in residential colleges using an empirical network;Hambridge;Int. J. Infect. Dis.,2021
5. Lucatero, C.R. (2019). Probability, Combinatorics and Control, IntechOpen.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献