#### Filter Results:

- Full text PDF available (31)

#### Publication Year

1988

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem
- Random Struct. Algorithms
- 2005

In this paper we study a random graph with N nodes, where node j has degree Dj and {Dj}j=1 are i.i.d. with P(Dj â‰¤ x) = F (x). We assume that 1 âˆ’ F (x) â‰¤ cx for some Ï„ > 3 and some constant c > 0.â€¦ (More)

- Piet Van Mieghem, Gerard Hooghiemstra, Remco van der Hofstad
- IEEE/ACM Trans. Netw.
- 2001

The average number of joint hops in a shortest-path multicast tree from a root to m arbitrary chosen group member nodes is studied. A general theory for all graphs, hence including the graphâ€¦ (More)

- Henri van den Esker, Remco van der Hofstad, Gerard Hooghiemstra, Dmitri Znamenski
- 2004

We study random graphs with an i.i.d. degree sequence of which the tail of the distribution function F is regularly varying with exponent Ï„ âˆˆ (1, 2). Thus, the degrees have infinite mean. Such randomâ€¦ (More)

We study first passage percolation on the random graph Gp(N) with exponentially distributed weights on the links. For the special case of the complete graph this problem can be described in terms ofâ€¦ (More)

In this paper we study typical distances in random graphs with i.i.d. degrees of which the tail of the common distribution function is regularly varying with exponent 1 âˆ’ Ï„ . Depending on the valueâ€¦ (More)

- Shankar Bhamidi, Remco van der Hofstad, Gerard Hooghiemstra
- Combinatorics, Probability & Computing
- 2011

1Department of Statistics and Operations Research, 304 Hanes Hall, University of North Carolina, Chapel Hill, NC 27599, USA (e-mail: bhamidi@email.unc.edu) 2Department of Mathematics and Computerâ€¦ (More)

- Henri van den Esker, Remco van der Hofstad, Gerard Hooghiemstra
- 2007

In this paper, a random graph process {G(t)}tâ‰¥1 is studied and its degree sequence is analyzed. Let {Wt}tâ‰¥1 be an i.i.d. sequence. The graph process is defined so that, at each integer time t, a newâ€¦ (More)

Â–Based on end-to-end delay measurements of IP probe-packets over a Ãžxed path obtained from RIPE NCC, we model the stochastic part of the delay and propose statistical methods to analyse the data. Theâ€¦ (More)

â€¢ A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official publishedâ€¦ (More)