tulogo

Homepage of Gerard Hooghiemstra

TUDelft/EEMCS/DIAM
Mekelweg 4
2628 CD Delft
Room: 6.280
Phone: 015-2783442
Fax    : 015-2787255
E-mail: g.hooghiemstra@tudelft.nl

Associate professor
dr. G. Hooghiemstra

Research interests:

a. Random graphs, Internet models;

b. Stochastic processes, in particular limit theorems and extreme values.
c. Stochastic Operations Research, in particular queues.

More specific interests are:

Stochastic processes and interference problems in telecommunications. (Together with  Remco van der Hofstad (TUE) and  Piet Van Mieghem )


Recent publications:

You can download a pdf file:

Scale-free percolation. preprint, with Mia Deijfen and Remco van der Hofstad.

Weak disorder in the stochastic mean-field model of distance II, preprint, with Shankar Bhamidi and Remco van der Hofstad, Sept. 2010.

First passage percolation on the Erdos-Renyi random graph, preprint, with Shankar Bhamidi and Remco van der Hofstad, May 2010

Extreme value theory, Poisson-Dirichlet distributions and first passage percolation on random networks, with Shankar Bhamidi and Remco van der Hofstad, Advances of Applied Probab., 42(3), 2010.

First passage percolation on random graphs with finite mean degrees, with Shankar Bhamidi and Remco van der Hofstad,  Annals of Appl Prob, 20(5), 1907-1965, 2010.

Diameters in preferential attachment models, with Remco van der Hofstad and Sander Dommers, J. Stat. Phys. 139(1), 72-107, 2010.

A phase transition for the diameter of the configuration model, with Remco van der Hofstad and Dmitri Znamenski, Internet Mathematics, 4(1), pp. 113-128, 2009.

A preferential attachment model with random initial degrees, with Maria Deijfen, Henri van den Esker, Remco van der Hofstad,  Arkiv for Matematik, 47, 41-72, 2009.

Universality for distances in power-law random graphs, with Remco van der Hofstad, Journal of Mathematical Physics 49, 125209, 2008.

The weight and hopcount of the shortest path in the complete graph with exponential weights, with Piet Van Mieghem, Combinatorics, Probability and Computing, 17(04), 537-548, 2008.

Universality for the distance in finite variance random graphs, with Henri v/d Esker and Remco van der Hofstad, J. Stat. Phys. 133, 169-202, 2008.

The weight of the shortest path tree, with Piet Van Mieghem and Remco van der Hofstad, Random Structures Algorithms, 30, 359-379, 2007. 

Distances in random graphs with finite mean and infinite variance degrees, with Remco van der Hofstad and Dmitri Znamenski, Electronic Journal of Probability 12, pp.~703-766, 2007.

Random graphs with arbitrary i.i.d.degrees, with Remco van der Hofstad and Dmitri Znamenski, preprint

Distances in random graphs with infinite mean degree sequence, with Henri van den Esker, Remco van der Hofstad and Dmitri Znamenski, Extremes, 8, 111-141, 2006.

Stochastische grafen in alledaagse modellen, met Ionica Smeets, verschenen in het September 2004 nummer van de Wiskrant

Size and weight of shortest path trees with exponential link weights, with Remco van der Hofstad and Piet Van Mieghem,  Combinatorics, Probability and Computing, 16, 1-26, 2006.

On the mean distance in scale free graphs, with Piet Van Mieghem,  Meth. Comp. in Applied Probability, 7, 285-306, 2005

Random graphs with finite variance degrees,   with Remco van der Hofstad and Piet Van Mieghem,  Random Structures  Algorithms, 26, 76-123, 2005.

Delay distributions on fixed Internet paths, with Piet Van Mieghem, Report TU-Delft.

On the covariance of the level sizes in random recursive trees, with Remco van der Hofstad and Piet Van Mieghem,  Random Struct. and Alg.,  vol 20, 519-539, 2002 

Large deviations for code division multiple access systems, with Marten Klok and Remco van der Hofstad.  SIAM Journal on Applied Mathematics vol. 62, 1044-1065, 2002.

On explicit occupation time distributions for Brownian processes,  Statistics and Probability Letters vol. 56, 405-417, 2002.

First passage percolation on the random graph, with Remco van der Hofstad and Piet Van Mieghem, Prob. Eng. Inf. Sciences, vol 15, 225-237, 2001.

On the efficiency of multicast, with Remco van der Hofstad and Piet Van Mieghem,  IEEE Trans. on Networking vol. 9, issue 6, 719-731, 2001.

A scaling law for the hopcount, with Piet Van Mieghem and Remco van der Hofstad. Report TU-Delft.

 

Other activities:

Scientific leader of NWO-project SAID