Joint Vertex Degrees in an Inhomogeneous Random Graph Model
In a random graph, counts for the number of vertices with given degrees will typically be dependent. We show via a multivariate normal and a Poisson process approximation that, for graphs which have independent edges, with a possibly inhomogeneous distribution, only when the degrees are large can we...
Prif Awduron: | Lin, K, Reinert, G |
---|---|
Fformat: | Journal article |
Iaith: | English |
Cyhoeddwyd: |
2009
|
Eitemau Tebyg
-
On conditional configuration graphs with random distribution of vertex degrees
gan: Yury Pavlov
Cyhoeddwyd: (2016-09-01) -
Subdomination in Graphs with Upper-Bounded Vertex Degree
gan: Darya Lemtyuzhnikova, et al.
Cyhoeddwyd: (2023-06-01) -
Joint Vertex-Time Filtering on Graphs With Random Node-Asynchronous Updates
gan: Oguzhan Teke, et al.
Cyhoeddwyd: (2021-01-01) -
On the chromatic number of graphs with some restriction of vertex degrees
gan: S.N. Selezneva
Cyhoeddwyd: (2020-12-01) -
On limit distributions of vertex degrees in a configuration graph
gan: Irina Cheplyukova
Cyhoeddwyd: (2015-10-01)