I have (what I will term, for lack of a better word) a random walk that has a particular property: it tends to be right of the origin some fraction k of the time and left 1-k of the time (and on the origin a negligible fraction). So although the probabilities of going up or down are close to 1/2, there is a central tendency as a result of this propensity. (Note: $k\neq1/2$ else I would use a Poisson process.)
It would be best if the process was memoryless in the sense that while the probability can vary (slightly) from 1/2 based on the current position, the count so far is ignored. Thus, it would perform the same at 0 whether it had just spent the last million above 0 as if below. Is such a model possible within my constraints?
I want to analyze the probability that the process is, say, left of the origin over an interval of varying lengths, given that the process starts at the origin.
I'm looking for a model as natural (parsimonious) as possible in hopes that I can compare my measurements to the model to see if the event is as rare as it (naively) appears to be. The combination of it being a walk (so that it can 'dig itself into a hole' as it were) and its unusual central tendency have confused my intuition as to what is normal...
Edit: For example, one possible model that seems to fit my requirements: some (N, p) where for position n > N go left with probability p and right with probability 1-p; for position n < N go left with probability 1-p and right with probability p; for n = N use 1/2 either way. (Think of p as just slightly more/less than 50%.) The process doesn't know its score but by choosing N sufficiently far from the origin and p close enough to 50% I get my requirements. It's not quite parsimonious, having one too many degrees of freedom (multiple choices for a given k) and it really doesn't fit my intuition as to how the process works, but maybe it inspires some better ideas.
The underlying problem, for those interested or looking for inspiration on the problem: this models the crossing point where $\pi(n)-\operatorname{li}(n)=0$ after Rubinstein & Sarnak 1994, where k is about $2.6\times10^{-7}$.