Random independent sets in triangle-free and linear Berge-$C_4$-free hypergraphs

We study probability distributions on independent sets of uniform hypergraphs with local constraints. For a positive vertex-weight function $w$ on an $(r+1)$-uniform hypergraph, define the weighted degree of vertex $v$ by $$d_w(v):=\sum _{e\ni v}{\left(\prod _{u\in e\setminus \{v\}}{\displaystyle \frac{w(u)}{w(v)}}\right)}^{1\mathrm{/}r}\mathrm{.}$$ For each fixed $r\ge 1$, our first result gives, in every triangle-free $(r+1)$-uniform hypergraph (without a linearity assumption), a random independent set $I$ satisfying $$\mathbb{P}(v\in I)\ge (\frac{r}{r+1}(r(r+1){)}^{-1\mathrm{/}r}+o_r(1)){\left(\frac{\log d_w(v)}{d_w(v)}\right)}^{1\mathrm{/}r},d_w(v)\to +\mathrm{\infty }\mathrm{.}$$ The same result also implies that every $d$-degenerate triangle-free $(r+1)$-uniform hypergraph satisfies $${\chi }_f(G)\le ({\displaystyle \frac{r+1}{r}}(r(r+1){)}^{1\mathrm{/}r}+o_r(1)){\left({\displaystyle \frac{d}{\log d}}\right)}^{1\mathrm{/}r},d\to +\mathrm{\infty }\mathrm{.}$$ Our second result concerns linear Berge-$C_4$-free hypergraphs which allow Berge triangles. In this setting, for every sufficiently large threshold $D$, there exists a random independent set $I$ such that, uniformly over all vertices with $d_w(v)\ge D$, $$\mathbb{P}(v\in I)\ge (1-o_r(1)){\left(\frac{\log d_w(v)}{r{d}_w(v)}\right)}^{1\mathrm{/}r},D\to +\mathrm{\infty }\mathrm{.}$$ It also yields $${\chi }_f(G)\le (1+o_r(1)){\left(\frac{rd}{\log d}\right)}^{1\mathrm{/}r}$$ for $d$-degenerate linear Berge-$C_4$-free $(r+1)$-uniform hypergraphs. Both results are based on the ordered random pick process originated from Martinsson and Steiner. By choosing different selection functions and iteration, we prove the output of the random process gives the required random independent set.