A preferential attachment model with random initial degrees

M. Deijfen; H. Esker, van den; R.W. Hofstad, van der; G. Hooghiemstra

doi:10.1007/s11512-007-0067-4

A preferential attachment model with random initial degrees

M. Deijfen, H. Esker, van den, R.W. Hofstad, van der, G. Hooghiemstra

Statistiek - Stieltjes

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

31 Citaten (Scopus)

Samenvatting

In this paper, a random graph process {G(t)} t=1 is studied and its degree sequence is analyzed. Let {W t } t=1 be an i.i.d. sequence. The graph process is defined so that, at each integer time t, a new vertex with W t edges attached to it, is added to the graph. The new edges added at time t are then preferentially connected to older vertices, i.e., conditionally on G(t-1), the probability that a given edge of vertex t is connected to vertex i is proportional to d i (t-1)+d, where d i (t-1) is the degree of vertex i at time t-1, independently of the other edges. The main result is that the asymptotical degree sequence for this process is a power law with exponent t=min{tW,tP}, where tW is the power-law exponent of the initial degrees {W t } t=1 and tP the exponent predicted by pure preferential attachment. This result extends previous work by Cooper and Frieze.

Originele taal-2	Engels
Pagina's (van-tot)	41-72
Tijdschrift	Arkiv för Matematik
Volume	47
Nummer van het tijdschrift	1
DOI's	https://doi.org/10.1007/s11512-007-0067-4
Status	Gepubliceerd - 2009

Toegang tot document

10.1007/s11512-007-0067-4

Vingerafdruk Duik in de onderzoeksthema's van 'A preferential attachment model with random initial degrees'. Samen vormen ze een unieke vingerafdruk.

Citeer dit

@article{2b054458454a49a8926112eacc4763a6,

title = "A preferential attachment model with random initial degrees",

abstract = "In this paper, a random graph process {G(t)} t=1 is studied and its degree sequence is analyzed. Let {W t } t=1 be an i.i.d. sequence. The graph process is defined so that, at each integer time t, a new vertex with W t edges attached to it, is added to the graph. The new edges added at time t are then preferentially connected to older vertices, i.e., conditionally on G(t-1), the probability that a given edge of vertex t is connected to vertex i is proportional to d i (t-1)+d, where d i (t-1) is the degree of vertex i at time t-1, independently of the other edges. The main result is that the asymptotical degree sequence for this process is a power law with exponent t=min{tW,tP}, where tW is the power-law exponent of the initial degrees {W t } t=1 and tP the exponent predicted by pure preferential attachment. This result extends previous work by Cooper and Frieze.",

author = "M. Deijfen and {Esker, van den}, H. and {Hofstad, van der}, R.W. and G. Hooghiemstra",

year = "2009",

doi = "10.1007/s11512-007-0067-4",

language = "English",

volume = "47",

pages = "41--72",

journal = "Arkiv f{\"o}r Matematik",

issn = "0004-2080",

publisher = "Springer",

number = "1",

}

TY - JOUR

T1 - A preferential attachment model with random initial degrees

AU - Deijfen, M.

AU - Esker, van den, H.

AU - Hofstad, van der, R.W.

AU - Hooghiemstra, G.

PY - 2009

Y1 - 2009

N2 - In this paper, a random graph process {G(t)} t=1 is studied and its degree sequence is analyzed. Let {W t } t=1 be an i.i.d. sequence. The graph process is defined so that, at each integer time t, a new vertex with W t edges attached to it, is added to the graph. The new edges added at time t are then preferentially connected to older vertices, i.e., conditionally on G(t-1), the probability that a given edge of vertex t is connected to vertex i is proportional to d i (t-1)+d, where d i (t-1) is the degree of vertex i at time t-1, independently of the other edges. The main result is that the asymptotical degree sequence for this process is a power law with exponent t=min{tW,tP}, where tW is the power-law exponent of the initial degrees {W t } t=1 and tP the exponent predicted by pure preferential attachment. This result extends previous work by Cooper and Frieze.

AB - In this paper, a random graph process {G(t)} t=1 is studied and its degree sequence is analyzed. Let {W t } t=1 be an i.i.d. sequence. The graph process is defined so that, at each integer time t, a new vertex with W t edges attached to it, is added to the graph. The new edges added at time t are then preferentially connected to older vertices, i.e., conditionally on G(t-1), the probability that a given edge of vertex t is connected to vertex i is proportional to d i (t-1)+d, where d i (t-1) is the degree of vertex i at time t-1, independently of the other edges. The main result is that the asymptotical degree sequence for this process is a power law with exponent t=min{tW,tP}, where tW is the power-law exponent of the initial degrees {W t } t=1 and tP the exponent predicted by pure preferential attachment. This result extends previous work by Cooper and Frieze.

U2 - 10.1007/s11512-007-0067-4

DO - 10.1007/s11512-007-0067-4

M3 - Article

VL - 47

SP - 41

EP - 72

JO - Arkiv för Matematik

JF - Arkiv för Matematik

SN - 0004-2080

IS - 1

ER -