English

Branching random walk in the presence of a hard wall

Probability 2024-02-23 v3

Abstract

We consider a branching random walk on a dd-ary tree of height nn (nNn \in \mathbb{N}), under the presence of a hard wall which restricts each value to be positive, where dd is a natural number satisfying d2d\geqslant2. 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 {\color{blue}vertices}, and a relation with the expected maximum of the processes has been observed. We find the probability of the event that the branching random {\color{blue}walk} is positive at every vertex in the nthn^{th} 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 logn\log n.

Keywords

Cite

@article{arxiv.1806.02565,
  title  = {Branching random walk in the presence of a hard wall},
  author = {Rishideep Roy},
  journal= {arXiv preprint arXiv:1806.02565},
  year   = {2024}
}

Comments

16 pages, 3 figures