Branching random walk in the presence of a hard wall

Abstract

We consider a branching random walk on a d-ary tree of height n (n ∈ N), under the presence of a hard wall which restricts each value to be positive, where d is a natural number satisfying d≥slant2. The question of behaviour of Gaussian processes with long range interactions, for example the discrete Gaussian free field, under the condition that it is positive on a large subset of bluevertices, and a relation with the expected maximum of the processes has been observed. We find the probability of the event that the branching random bluewalk is positive at every vertex in the nth generation, and show that the conditional expectation of the Gaussian variable at a typical vertex, under positivity, is less than the expected maximum by order of n.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…