A branching random walk in the presence of a hard wall

We consider a branching random walk on a d-ary tree of height n (n ? N), in the presence of a hard wall which restricts each value to be positive, where d is a natural number satisfying d= 2. We consider the 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 vertices. We observe a relation with the expected maximum of the processes. We find the probability of the event that the branching random walk 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 log n.