You are currently viewing a new version of our website. To view the old version click .

3 Results Found

  • Article
  • Open Access
1 Citations
2,053 Views
17 Pages

Let ∂T be a super-critical Galton–Watson tree. Recently, the first author computed almost surely and simultaneously the Hausdorff dimensions of the sets of infinite branches of the boundary of ∂T along which the sequence SnX(t)/SnX&ti...

  • Article
  • Open Access
560 Views
24 Pages

8 September 2025

In the present work, we consider three branching random walk SnZ(t),Z∈{X,Y,Φ} on a supercritical random Galton–Watson tree ∂T. We compute the Hausdorff and packing dimensions of the level set Eχ(α,β)=t∈∂T:...

  • Article
  • Open Access
1 Citations
2,718 Views
26 Pages

Optimal Prefetching in Random Trees

  • Kausthub Keshava,
  • Alain Jean-Marie and
  • Sara Alouf

1 October 2021

We propose and analyze a model for optimizing the prefetching of documents, in the situation where the connection between documents is discovered progressively. A random surfer moves along the edges of a random tree representing possible sequences of...