We present a deterministic algorithm running in space O log2 n= log log n solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(log n) time-bounded algorithm for this problem running on a parallel pointer machine.

We show that the modified log-Sobolev constant for a natural Markov chain which converges to an $r$-homogeneous strongly log-concave distribution is at least $1/r$. Applications include sharp mixing time bound bases-exchange walk matroids, and concentration Lipschitz functions over these distributions.

In this work we report on a transaction log analysis of the Dutch Folktale Database, an online repository of extensively annotated folktales ranging from old fairy tales to recent urban legends, written in (old) Dutch, Frisian and a variety of Dutch dialects. We observed that users have a preference for subgenres within folktales such as traditional legends and urban legends and prefer stories ...