Universality for first passage percolation on sparse uniform and rank-1 random graphs

S. Bhamidi, R.W. Hofstad, van der, G. Hooghiemstra

Onderzoeksoutput: Boek/rapportRapportAcademic

55 Downloads (Pure)

Uittreksel

In [3], we considered first passage percolation on the configuration model equipped with general independent and identically distributed edge weights, where the common distribution function admits a density. Assuming that the degree distribution satisfies a uniform X^2 log X - condition, we analyzed the asymptotic distribution for the minimal weight path between a pair of typical vertices, as well as the asymptotic distribution of the number of edges on this path. Given the interest in understanding such questions for various other random graph models, the aim of this paper is to show how these results extend to uniform random graphs with a given degree sequence and rank-one inhomogeneous random graphs.
Originele taal-2Engels
Plaats van productieEindhoven
UitgeverijEurandom
Aantal pagina's13
StatusGepubliceerd - 2014

Publicatie series

NaamReport Eurandom
Volume2014014
ISSN van geprinte versie1389-2355

Vingerafdruk

First-passage Percolation
Random Graphs
Universality
Asymptotic distribution
Path
Degree Sequence
Degree Distribution
Graph Model
Identically distributed
Distribution Function
Configuration
Model

Citeer dit

Bhamidi, S., Hofstad, van der, R. W., & Hooghiemstra, G. (2014). Universality for first passage percolation on sparse uniform and rank-1 random graphs. (Report Eurandom; Vol. 2014014). Eindhoven: Eurandom.
Bhamidi, S. ; Hofstad, van der, R.W. ; Hooghiemstra, G. / Universality for first passage percolation on sparse uniform and rank-1 random graphs. Eindhoven : Eurandom, 2014. 13 blz. (Report Eurandom).
@book{a589916ab9a54738b7c9823513956ef7,
title = "Universality for first passage percolation on sparse uniform and rank-1 random graphs",
abstract = "In [3], we considered first passage percolation on the configuration model equipped with general independent and identically distributed edge weights, where the common distribution function admits a density. Assuming that the degree distribution satisfies a uniform X^2 log X - condition, we analyzed the asymptotic distribution for the minimal weight path between a pair of typical vertices, as well as the asymptotic distribution of the number of edges on this path. Given the interest in understanding such questions for various other random graph models, the aim of this paper is to show how these results extend to uniform random graphs with a given degree sequence and rank-one inhomogeneous random graphs.",
author = "S. Bhamidi and {Hofstad, van der}, R.W. and G. Hooghiemstra",
year = "2014",
language = "English",
series = "Report Eurandom",
publisher = "Eurandom",

}

Bhamidi, S, Hofstad, van der, RW & Hooghiemstra, G 2014, Universality for first passage percolation on sparse uniform and rank-1 random graphs. Report Eurandom, vol. 2014014, Eurandom, Eindhoven.

Universality for first passage percolation on sparse uniform and rank-1 random graphs. / Bhamidi, S.; Hofstad, van der, R.W.; Hooghiemstra, G.

Eindhoven : Eurandom, 2014. 13 blz. (Report Eurandom; Vol. 2014014).

Onderzoeksoutput: Boek/rapportRapportAcademic

TY - BOOK

T1 - Universality for first passage percolation on sparse uniform and rank-1 random graphs

AU - Bhamidi, S.

AU - Hofstad, van der, R.W.

AU - Hooghiemstra, G.

PY - 2014

Y1 - 2014

N2 - In [3], we considered first passage percolation on the configuration model equipped with general independent and identically distributed edge weights, where the common distribution function admits a density. Assuming that the degree distribution satisfies a uniform X^2 log X - condition, we analyzed the asymptotic distribution for the minimal weight path between a pair of typical vertices, as well as the asymptotic distribution of the number of edges on this path. Given the interest in understanding such questions for various other random graph models, the aim of this paper is to show how these results extend to uniform random graphs with a given degree sequence and rank-one inhomogeneous random graphs.

AB - In [3], we considered first passage percolation on the configuration model equipped with general independent and identically distributed edge weights, where the common distribution function admits a density. Assuming that the degree distribution satisfies a uniform X^2 log X - condition, we analyzed the asymptotic distribution for the minimal weight path between a pair of typical vertices, as well as the asymptotic distribution of the number of edges on this path. Given the interest in understanding such questions for various other random graph models, the aim of this paper is to show how these results extend to uniform random graphs with a given degree sequence and rank-one inhomogeneous random graphs.

M3 - Report

T3 - Report Eurandom

BT - Universality for first passage percolation on sparse uniform and rank-1 random graphs

PB - Eurandom

CY - Eindhoven

ER -

Bhamidi S, Hofstad, van der RW, Hooghiemstra G. Universality for first passage percolation on sparse uniform and rank-1 random graphs. Eindhoven: Eurandom, 2014. 13 blz. (Report Eurandom).