Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Utrecht UniversityNL210 papers
- Delft University of TechnologyNL196 papers
- Centre National de la Recherche ScientifiqueFR195 papers
- Centrum Wiskunde & InformaticaNL163 papers
- University of TwenteNL158 papers
- University of AmsterdamNL113 papers
- Radboud University NijmegenNL89 papers
- University of Rome Tor VergataIT84 papers
- Vrije Universiteit AmsterdamNL79 papers
- Leiden UniversityNL72 papers
- University of GroningenNL58 papers
- Philips (Netherlands)NL56 papers
7 papers · 2 filters
Deviations of a random walk in a random scenery with stretched exponential tails
Remco van der Hofstad, Nina Gantert, Wolfgang König
Let (Z_n)_{n\in\N_0} be a d-dimensional random walk in random scenery, i.e., Z_n=\sum_{k=0}^{n-1}Y_{S_k} with (S_k)_{k\in\N_0} a random walk in Z^d and (Y_z)_{z\in Z^d} an i.i.d. s…
Distances in random graphs with finite variance degrees
Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem
In this paper we study a random graph with nodes, where node has degree and are i.i.d. with $\prob(D_j\leq x)=F(x)$. We assume that $1-F(x)\leq c x^…
Exact asymptotics for fluid queues fed by multiple heavy-tailed on-off flows
Bert Zwart, Sem Borst, Michel Mandjes
We consider a fluid queue fed by multiple On-Off flows with heavy-tailed (regularly varying) On periods. Under fairly mild assumptions, we prove that the workload distribution is a…
Infinite canonical super-Brownian motion and scaling limits
Remco van der Hofstad
We construct a measure valued Markov process which we call infinite canonical super-Brownian motion, and which corresponds to the canonical measure of super-Brownian motion conditi…
Random subgraphs of finite graphs: III. The phase transition for the -cube
Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad +2
We study random subgraphs of the -cube , where nearest-neighbor edges are occupied with probability . Let be the value of for which the expected clust…
Random subgraphs of finite graphs: II. The lace expansion and the triangle condition
Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad +2
In a previous paper, we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and sh…
Random subgraphs of finite graphs: I. The scaling window under the triangle condition
Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad +2
We study random subgraphs of an arbitrary finite connected transitive graph obtained by independently deleting edges with probability . Let be the number of ve…