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.

We consider three equilibrium concepts proposed in the literature for time-inconsistent stopping problems, including mild equilibria (introduced Huang and Nguyen-Huu (2018)), weak Christensen Lindensjö strong Bayraktar et al. (2021)). The discount function is assumed to be log subadditive underlying process one-dimensional diffusion. first provide necessary sufficient conditions characterizatio...

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 ...

background:accident is the secondary cause of mortality in iran, background of its occurrence and mortality are not wholly understood. the aim of this paper is to explain seasonal occurrence and mortality pattern of traffic accidents in isfahan population, iranmethods: this study is a cross-sectional analytic study. we extracted data on traffic accidents for isfahan province from the ministry o...

A pseudorandom generator Gn : {0, 1}n → {0, 1}m is hard for a propositional proof system P if (roughly speaking) P can not efficiently prove the statement Gn(x1, . . . , xn) 6= b for any string b ∈ {0, 1}m. We present a function (m ≥ 2nΩ(1)) generator which is hard for Res( log n); here Res(k) is the propositional proof system that extends Resolution by allowing k-DNFs instead of clauses. As a ...

Recently, Pawlik et al. have shown that triangle-free intersection graphs of line segments in the plane can have arbitrarily large chromatic number. Specifically, they construct triangle-free segment intersection graphs with chromatic number Θ(log log n). Essentially the same construction produces Θ(log log n)-chromatic triangle-free intersection graphs of a variety of other geometric shapes—th...