The Maximum Degree of an Exponentially Distributed Random Graph
DOI:
10.33395/sinkron.v7i3.11602Abstract
Let G G (n, p) be a graph on n vertices where each pair of vertices is joined independently with probability p for 0 < p < 1 and q = 1 p. In this work, we introduce weighted random graf G with exponential distribution and investigate that the probability that every vertex of G has degree at most np + b√pqn is equal to 0.595656764.
Downloads
References
B. Bollobas, “Degree sequences of random graphs,” Discrete Math 33, 1–19 (1981).
B. Bollobas, “Degree sequences of random graphs,” Discrete Math 33, 1–19 (1981).
B. Bollobas, Random Graphs (Academic Press, 1985).
B. D. McKay and N. C. Wormald, “The degree sequence of a random graph,” Random Structures and Algorithms 11, 97–118 (1997).
D. J. Kleitman, “Families of non-disjoint subsets,” J. Combin. Theory 1, 153–155 (1966).
G. R. Grimmett and D. R. Stirzaker, Probability and Random Processes (2nd edn, Clarendon Press, 1992).
O. Riordan and A. Selby, “The maximum degree of a random graph,” Combinatoric, Probability and Computing 9, 549–572 (2000).
P. Erdos and A. Renyi, “On random graphs,” I. Publ. Math. Debrecen 6, 290–297 (1959).
R. Courant and D. Hilbert, Methods of Mathematical Physics (Vol. I, Interscience Publishers, 1953).
S. Bhamidi, S. Chakraborty, S. Cranmer, and B. Desmarais, “Weighted exponential random graph models: Scope and large network limits,” Journal of Statistical Physic 173, 704–735 (2018).
W. Feller, An Introduction to Probability Theory and its Applications (Vol. II, 2nd edn,Wiley, 1971).
Downloads
|
How to Cite
Issue
Section
License
Copyright (c) 2022 Desti Alannora Harahap, Saib Suwilo, Mardiningsih
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Muhammad Khoiruddin harahap
Google Scholar 
Moraref
PKP Index
Garuda Kemdikbud
Indonesia OneSearch
OCLC Worldcat
Dimensions
Index Copernicus
Scilit
