Abstract: An infinite graph may have the property that two independent random walks on the graph never meet each other, although each of them visits every vertex of the graph infinitely often.
Abstract: Let B be standard Brownian motion. Fix an interval (a,b). Condition on B(t) to be in (a,b). Look at B(u) for u<.=t and B(u) u>.=t. We show that this converges weakly to a proper probability measure on C(R).
Abstract: Propp and Wilson showed how to generate a Markov chain which in a finite number of steps gives a sample from the stationary distribution supported by a countable set.
Arithmetic Complexity is a central topic of interest in theoretical computer science. The famous $P$ vs. $NP$ question that seeks to understand the limits of efficient computation has its natural arithmetic analogue.
Abstract: Different logic-based knowledge representation formalisms have different limitations either with respect to expressivity or with respect to computational efficiency.
Abstract: Most of the achievability proofs in Information theory are based on the concept of typicality. However, this typicality technique does not seem to be good enough to give achievability bounds in the most general settings, i.e.
Abstract: Differentiated service is typically provided to customers by offering different grades of service at different prices. We first consider a simple system with heterogeneous customers that are type indexed by $v$.
