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...
Main Authors: | Lin, K, Reinert, G |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2009
|
Similar Items
-
On conditional configuration graphs with random distribution of vertex degrees
by: Yury Pavlov
Published: (2016-09-01) -
Subdomination in Graphs with Upper-Bounded Vertex Degree
by: Darya Lemtyuzhnikova, et al.
Published: (2023-06-01) -
Joint Vertex-Time Filtering on Graphs With Random Node-Asynchronous Updates
by: Oguzhan Teke, et al.
Published: (2021-01-01) -
On the chromatic number of graphs with some restriction of vertex degrees
by: S.N. Selezneva
Published: (2020-12-01) -
On limit distributions of vertex degrees in a configuration graph
by: Irina Cheplyukova
Published: (2015-10-01)