Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Gerard Hooghiemstra"'
Publikováno v:
Ann. Probab. 45, no. 4 (2017), 2568-2630
The Annals of Probability, 45(4), 2568-2630. Institute of Mathematical Statistics
The Annals of Probability, 45(4), 2568-2630. Institute of Mathematical Statistics
We consider first passage percolation on the configuration model with n vertices, and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a uniform X2 logX-condition,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::82475149304e6836d26f927682ad8a18
https://doi.org/10.1214/16-aop1120
https://doi.org/10.1214/16-aop1120
Publikováno v:
Ann. Inst. H. Poincaré Probab. Statist. 49, no. 3 (2013), 817-838
Annales de l'institut Henri Poincare (B): Probability and Statistics, 49(3), 817-838. Institute of Mathematical Statistics
Annales de l'institut Henri Poincare (B): Probability and Statistics, 49(3), 817-838. Institute of Mathematical Statistics
We formulate and study a model for inhomogeneous long-range percolation on Zd. Each vertex x¿Zd is assigned a non-negative weight Wx, where (Wx)x¿Zd are i.i.d. random variables. Conditionally on the weights, and given two parameters a,¿>0, the edg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8502c734325b94cbfff5dfc19770a81b
https://doi.org/10.1214/12-aihp480
https://doi.org/10.1214/12-aihp480
Publikováno v:
Advances in Applied Probability, 42 (3), 2010
Advances in Applied Probability, 42(3), 706-738. University of Sheffield
Advances in Applied Probability, 42(3), 706-738. University of Sheffield
We study first passage percolation (FPP) on the configuration model (CM) having power-law degrees with exponent τ ∈ [1, 2) and exponential edge weights. We derive the distributional limit of the minimal weight of a path between typical vertices in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d21d71ed83d29bc9f058a09cfbfa00ba
https://doi.org/10.1239/aap/1282924060
https://doi.org/10.1239/aap/1282924060
Publikováno v:
Arkiv för Matematik, 47(1), 41-72. Springer
Arkiv för Matematik, 47 (1), 2009
Ark. Mat. 47, no. 1 (2009), 41-72
Arkiv för Matematik, 47 (1), 2009
Ark. Mat. 47, no. 1 (2009), 41-72
In this paper, a random graph process ${G(t)}_{t\geq 1}$ is studied and its degree sequence is analyzed. Let $(W_t)_{t\geq 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 attac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a74a3f942a001312b40967ab224ab324
https://doi.org/10.1007/s11512-007-0067-4
https://doi.org/10.1007/s11512-007-0067-4
Publikováno v:
Journal of Statistical Physics, 133 (1)
Journal of Statistical Physics, 133(1), 169-202. Springer
Journal of Statistical Physics, 133(1), 169-202. Springer
We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree random grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9ea726cb77607caa93e6081c27a43b45
https://research.tue.nl/en/publications/2d60f0cf-0f36-4ddd-9d87-5c3e56f34e4f
https://research.tue.nl/en/publications/2d60f0cf-0f36-4ddd-9d87-5c3e56f34e4f
Autor:
Gerard Hooghiemstra, P. Van Mieghem
Publikováno v:
Methodology and Computing in Applied Probability. 7:285-306
We consider a graph, where the nodes have a pre-described degree distribution F, and where nodes are randomly connected in accordance to their degree. Based on a recent result (R. van der Hofstad, G. Hooghiemstra and P. Van Mieghem, “Random graphs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d40fa9dcb805dd1f703847a619f58166
https://doi.org/10.1007/s11009-005-4518-8
https://doi.org/10.1007/s11009-005-4518-8
Autor:
Gerard Hooghiemstra
Publikováno v:
Statistics & Probability Letters. 56:405-417
Explicit expressions for the occupation time distribution of Brownian bridge, excursion and meander are derived using Kac's formula and results of Durrett et al. (Ann. Probab. 5 (1977) 117). The first two distributions appeared in Takacs (Meth. Compu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f12f64cd29b831d0ed27d78782bdb3dd
https://doi.org/10.1016/s0167-7152(02)00037-8
https://doi.org/10.1016/s0167-7152(02)00037-8
Publikováno v:
SIAM Journal on Applied Mathematics, 62(3), 1044-1065. Society for Industrial and Applied Mathematics (SIAM)
We derive approximations for the probability of a bit error for a code division multiple access (CDMA) system with one-stage soft decision parallel interference cancellation. More precisely, we derive the exponential rates, Jk with cancellation and I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::200fc30112492af62f523ddcc43d4570
https://doi.org/10.1137/s003613999936372x
https://doi.org/10.1137/s003613999936372x
Publikováno v:
Wireless Personal Communications. 21:289-307
For a simple CDMA system, we compute the bit-error probability (BEP) with soft-decision parallel-interference-cancellation (SD-PIC). Instead of approximating the signal-to-noise ratio, we use a different measure to calculate performance. This measure
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::739212665a250e215dd390e27ccf2438
https://doi.org/10.1023/a:1016073526166
https://doi.org/10.1023/a:1016073526166
Publikováno v:
Extremes. 5:111-129
Based on our analysis of the hopcount of the shortest path between two arbitrary nodes in the class G p (N) of random graphs, the corresponding flooding time is investigated. The flooding time T N (p) is the minimum time needed to reach all other nod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73011c7473207bd4fdeb61ce8f4d341e
https://doi.org/10.1023/a:1022175620150
https://doi.org/10.1023/a:1022175620150