"""LOB1 ยท Mantel-Haenszel (RR con lotes como denominador; OR por empresa con Robins-Greenland) y bootstrap por empresa en estrato.""" import math, random def rr_mh(estr): """estr: {s: [(reg, k, n), ...]} -> RR_MH, solo estratos con los dos grupos.""" num = den = 0.0 for fs in estr.values(): K1 = N1 = K0 = N0 = 0 for r, k, n in fs: if r: K1 += k; N1 += n else: K0 += k; N0 += n if N1 == 0 or N0 == 0: continue N = N1 + N0; num += K1 * N0 / N; den += K0 * N1 / N return num / den if den > 0 else float('nan') def or_mh(estr): """estr: {s: [(reg, y), ...]} -> (OR, lo, hi) Robins-Greenland-Breslow.""" R = S = PR = PS_QR = QS = 0.0 for fs in estr.values(): a = sum(1 for r, y in fs if r and y); b = sum(1 for r, y in fs if r and not y) c = sum(1 for r, y in fs if not r and y); d = sum(1 for r, y in fs if not r and not y) n = a + b + c + d if (a + b) == 0 or (c + d) == 0: continue Ri = a * d / n; Si = b * c / n; Pi = (a + d) / n; Qi = (b + c) / n R += Ri; S += Si; PR += Pi * Ri; PS_QR += Pi * Si + Qi * Ri; QS += Qi * Si if R == 0 or S == 0: return (float('nan'), None, None) o = R / S; v = PR / (2 * R * R) + PS_QR / (2 * R * S) + QS / (2 * S * S); se = math.sqrt(v) return (o, o * math.exp(-1.96 * se), o * math.exp(1.96 * se)) def boot_rr(estr, B=1000, seed=22): rnd = random.Random(seed); out = [] keys = sorted(estr, key=str) for _ in range(B): e2 = {} for s in keys: fs = estr[s]; g1 = [f for f in fs if f[0]]; g0 = [f for f in fs if not f[0]] if not g1 or not g0: continue e2[s] = [rnd.choice(g1) for _ in g1] + [rnd.choice(g0) for _ in g0] out.append(rr_mh(e2)) out = sorted(v for v in out if v == v) return (out[int(0.025 * len(out))], out[int(0.975 * len(out)) - 1]) if out else (None, None)