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