We study the range Rn of a random walk on the d-dimensional lattice ℤd indexed by a random tree with n vertices. Under the assumption that the random walk is centered and has finite fourth moments, we ...

In a one-dimensional random walk, a “walker” is confined to a long, narrow path and moves forward or backward in steps according to the results of repeatedly tossing a coin. The walker takes a step in ...

Albert Phung has 7+ years of experience as a process improvement consultant for several businesses; currently with Alberta Health Services. Suzanne is a content marketer, writer, and fact-checker. She ...

Applicable Analysis and Discrete Mathematics, Vol. 10, No. 2 (October 2016), pp. 408-446 (39 pages) An associative Boolean tree is a plane rooted tree whose internal nodes are labelled by AND or OR ...