#### Filter Results:

- Full text PDF available (96)

#### Publication Year

1994

2018

- This year (8)
- Last 5 years (41)
- Last 10 years (63)

#### 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)

- Remco van der Hofstad
- Cambridge Series in Statistical and Probabilisticâ€¦
- 2016

Calendario: 16 ore, LunedÄ±Ì€ e MartedÄ±Ì€ ore 15.00 17.00. Prima lezione 13 settembre 2010. Torre Archimede. Prerequisiti: ProbabilitÃ con teoria della misura. Tipologia di esame: Colloquio orale. SSD:â€¦ (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)

- Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel H. Spencer
- Random Struct. Algorithms
- 2005

We study random subgraphs of an arbitrary finite connected transitive graph G obtained by independently deleting edges with probability 1âˆ’p. Let V be the number of vertices in G, and let Î© be theirâ€¦ (More)

- Christian Borgs, Jennifer, +4 authors Joel Spencer
- 2003

â€¢ 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)

- 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)

Abstract We consider the critical spread-out contact process in Z with d â‰¥ 1, whose infection range is denoted by L â‰¥ 1. The two-point function Ï„t(x) is the probability that x âˆˆ Z is infected at timeâ€¦ (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, we show that this problem can beâ€¦ (More)

The lace expansion has been used successfully to study the critical behaviour in high dimensions of self-avoiding walks, lattice trees and lattice animals, and percolation. In each case, the laceâ€¦ (More)