alphaFeedback

WorksMathematics

Interpretable Social Network Churn Prediction via Ergodic Markov Chains

AI contributions
Not recorded for this paper
View details

Abstract

Predicting social network churn before it becomes visible in aggregate metrics remains an open challenge, particularly in enterprise settings where heterogeneous usage patterns, sparse data, and deployment constraints preclude standard supervised approaches. We formalize this problem as finite-step engagement projection over contributor-role Markov chains, with a stationary-distribution interpretation for ergodic chains in the long-run limit. For each engagement feature type within a network (e.g., Q&A, communities, articles, etc.), users are classified monthly into four behavioral states and a transition matrix is estimated from six months of history. Six-step propagation yields a label-free projection of the contributor mix; for ergodic chains, the Perron-Frobenius theorem establishes convergence under repeated propagation. Comparing projected future engagement to current engagement produces the Health Ratio, a single score requiring no trained model, no labels, and no infrastructure beyond SQL. Validated across seven rolling prediction windows on 11,500+ tenant-level networks, the Health Ratio achieves mean AUC 0.917 with a 156 times churn-rate gradient across risk tiers, outperforming all single-signal baselines and the growth-adjusted variant previously deployed in production. An ablation study shows that six-step propagation achieves similar churn discrimination to the eigenvector-based score. Deployed on Microsoft Engage since October 2025, the framework powers customer health monitoring and has enabled proactive intervention on at-risk networks before decline becomes visible in traditional metrics.

Introduction

Social networks operate on a flywheel: users create content, others consume and react, and those reactions draw creators back. If the flywheel reverses—creators disengage, reactions thin, remaining creators feel unheard—the network can collapse rapidly. Predicting and preventing such reversals is essential to the success of any social platform, and especially so in enterprise settings, where each tenant operates in their own independent network.

Problem. Microsoft Engage is one such platform: each tenant hosts a self-contained social network whose engagement patterns and feature usage vary radically across organizations. Unlike consumer networks with a single global graph, network effects are bounded at the tenant level and churn is per-network rather than platform-wide. This creates a measurement problem across tens of thousands of networks that are all structurally independent: how does one assess network health in a way that is (i) unbiased to usage style, (ii) predictive rather than descriptive, and (iii) actionable enough to identify what specifically must be addressed?

The most common top-down metric, Monthly Active Users (MAU), fails all three criteria. A network with 10,000 passive viewers is fundamentally different from one with 1,000 active creators, yet raw counts conflate the two. By the time systemic MAU decline becomes obvious, it is often too late to intervene. Several constraints compound the difficulty: heterogeneous dynamics across 17 feature types (§ 5), no ground-truth labels at scoring cadence, sparse data in small networks, limited model-serving infrastructure, and the need for interpretable, actionable outputs that precludes black-box classifiers.

We present Stationary Engagement Projection (SEP), a framework which addresses these constraints by combining a role-based engagement value model with a contributor-role Markov chain projection of contributor retention. For each engagement feature type (e.g. community posts, Q&A, storyline, announcements), users are classified monthly into four contributor states (Creator, Replier, Reactor, inactive/Churned). A 4×44 \times4 transition matrix is estimated from six months of behavioral history, and six-step propagation of the current distribution projects the future contributor mix.

Contributions. (1) A formal connection between the Perron–Frobenius theorem and a productionized churn prediction model via contributor-role Markov chains; (2) a SQL-native power iteration algorithm that achieves an AUC within 0.001 of the eigenvector-based score; (3) multi-window temporal validation across seven rolling prediction windows (mean AUC 0.917, σ=0.006\sigma= 0.006). (4) an ablation study validating SEP against other approaches.

Diagram of contributor state Markov chain

Figure 1. Diagram of contributor state Markov chain. The Churned node denotes monthly inactivity, not permanent departure.

Related work

Community survival prediction. Hamilton et al. [1] showed that contributor role diversity predicts Reddit community survival better than raw size—an intuition SEP operationalizes via Markov chains. Kairam et al. [2], Backstrom et al. [3], and Ducheneaut et al. [4] used structural graph features for community and guild longevity prediction but require labeled data. Danescu-Niculescu-Mizil et al. [5] linked linguistic change to community departure. Iriberri and Leroy [6] proposed an online community lifecycle model; our Health Ratio quantifies lifecycle stage. Kraut and Resnick [7] identified member commitment as central to persistence.

Markov models in retention. Pfeifer and Carraway [8] formalized customer relationships as Markov chains; we adapt this to contributor roles where the “transaction” is a monthly engagement event. Fader et al. [9] proposed the BG/NBD model for noncontractual repeat purchasing; our approach instead models monthly transitions among contributor roles. Gupta et al. [10] modeled cohort-level retention; we extend this to per-feature, per-network granularity.

Churn prediction in practice. Verbeke et al. [11] found that interpretable churn models match black-box alternatives when evaluation accounts for business cost; we revisit interpretable supervised approaches—Cox proportional hazards [12] and gradient boosting with SHAP attribution [13]—in § 7. Ascarza [14] showed that targeting high-risk customers for retention may be ineffective, motivating interpretable, per-feature risk decomposition. Wu [15] established that enterprise social network structure carries information beyond individual activity metrics. To our knowledge, no scaled production system uses ergodic Markov chain projection as a forward-looking health signal. SEP has been deployed on Microsoft Engage since October 2025.

Theoretical framework

State space and transition model

Let S={C,R,X,L}S = \{C, R, X, L\} denote the four contributor states: Creator (CC), Replier (RR), Reactor (XX), and inactive/Churned (LL). For a given network and feature type ff, each user uu who was active in feature ff during any month of the six-month lookback window is assigned to exactly one state per month based on their highest-engagement action:

StateDefinition
Creator (CC)Posted ≥1\ge1 thread starter that month
Replier (RR)Replied to a thread; did not start one
Reactor (XX)Reacted to ≥1\ge1 thread or reply
Inactive/Churned (LL)In lookback; inactive this month

Table 1.

The assignment is deterministic and mutually exclusive with a strict hierarchy: C>R>X>LC > R > X > L. A user who both created and replied is classified as Creator; a user active in the lookback but absent this month is inactive/Churned. This monthly state permits subsequent reactivation and is distinct from the network-level churn outcome defined in § 5.

For each (network, feature) pair, we estimate a 4×44 \times4 row-stochastic transition matrix Pf∈R4×4P_f \in\mathbb{R}^{4 \times4} from six steps of observed month-over-month transitions:

Pf(i,j)=∣{u:su(t)=i, su(t+1)=j}∣∑j′∈S∣{u:su(t)=i, su(t+1)=j′}∣,(1)P_f(i,j) = \frac{\left|\{u : s_u(t) = i,\ s_u(t+1) = j\}\right|}{\sum_{j' \in S}\left|\{u : s_u(t) = i,\ s_u(t+1) = j'\}\right|}, \tag*{(1)}

pooled over all months tt in the lookback window. For states with observed outgoing transitions, probabilities are estimated using the count ratio above. When no outgoing transitions are observed, we set the self-transition probability to one and all other entries in that row to zero. Each row therefore sums to one: ∑jPf(i,j)=1\sum_j P_f(i,j) = 1 for all ii.

Why monthly aggregation. Monthly windows balance signal stability against responsiveness: weekly windows produce unstable state assignments in small networks where users post in only a handful of weeks per quarter, while quarterly aggregation forfeits the leading-indicator behavior described in § 7. Monthly cadence also aligns with the natural rhythm of enterprise engagement (leader posts, newsletters, town halls) and Engage’s existing metric review schedule.

Why per-feature matrices. Transition dynamics are structurally heterogeneous across feature types. Community posts exhibit balanced role retention (Creator self-transition pCC=0.32p_{CC} = 0.32, spectral gap γ=0.71\gamma= 0.71), while AMA live events are episodic with 86% inactive/Churned between events (γ=0.36\gamma= 0.36). Collapsing these into a single global matrix would average over qualitatively different dynamics;

per-feature estimation preserves each feature’s independent structural trajectory and allows for additional analytical segmentation.

The Perron–Frobenius theorem and stationarity

The theoretical foundation of our approach rests on the Perron–Frobenius theorem for non-negative matrices [16, 17]; we follow the spectral gap framework of Levin and Peres [18] for convergence analysis.

Theorem (Perron–Frobenius). Let P\mathbf{P} be an irreducible, aperiodic (i.e. ergodic) row-stochastic matrix. Then P\mathbf{P} has a unique stationary distribution π∗\boldsymbol{\pi}^{*} satisfying π∗=π∗P\boldsymbol{\pi}^{*} = \boldsymbol{\pi}^{*}\mathbf{P}, with all entries strictly positive: πi∗>0\pi_i^{*} > 0 for all i∈Si \in S. Moreover, for any initial distribution π0\boldsymbol{\pi}_0:

lim⁡k→∞π0Pk=π∗,(2)\lim_{k \to\infty} \boldsymbol{\pi}_0 \mathbf{P}^{k} = \boldsymbol{\pi}^{*}, \tag*{(2)}

with geometric convergence governed by the spectral gap.

Spectral gap and convergence rate. For ergodic chains, the magnitudes of the non-unit eigenvalues characterize asymptotic convergence [19]. The spectral gap is one minus the largest of these magnitudes: γ=1−∣λ2∣\gamma= 1 - |\lambda_2|. Finite-step approximation error also depends on the transition matrix and the initial distribution; the spectral gap alone does not establish that six steps are sufficient.

Empirical chain properties. For networks with sufficient transition data in the dominant feature type (community_posts_1k_plus, n=6,003n = 6{,}003, Feb. 2026), 85% have fully irreducible matrices and the median spectral gap is γ=0.68\gamma= 0.68. Separately, the ablation comparison shows similar churn discrimination for six-step projection and the eigenvector-based score (ΔAUC=0.001\Delta\mathrm{AUC} = 0.001). This predictive agreement does not by itself establish convergence of the projected distributions. Figure 2 illustrates Creator-share trajectories, the spectral gap distribution, and the relationship between size and irreducibility.

Three-panel figure showing power iteration convergence, spectral gap distribution, and full irreducibility by MAU quintile

Figure 2. Markov chain properties. (A) Creator-share trajectories for 15 representative networks under pure power iteration. (B) Spectral gap distribution (n=6,003n=6{,}003); median γ=0.68\gamma=0.68. (C) Full four-state irreducibility rate by MAU quintile: 99% for the largest networks vs. 58% for the smallest. Panel C reports irreducibility, which alone does not establish aperiodicity.

Handling non-ergodic chains. SEP propagates the observed contributor distribution through six transition steps. This calculation remains well-defined for non-ergodic chains and preserves dependence on the initial distribution, but its output need not be stationary. The self-loop convention for unobserved rows makes those states absorbing in the estimated matrix; it does not establish permanent inactivity in the underlying population.

Engagement value model

Not all contributor states generate equal engagement value, and they do so through different mechanisms. We decompose the feature-level score into an activity matrix, a value vector, and the state distribution.

Activity matrix. For each feature type ff, we define Af∈R3×3A_f \in\mathbb{R}^{3 \times3} as the activity matrix whose rows correspond to contributor states {C,R,X}\{C,R,X\} and columns to contribution event classes (thread starts, replies, reactions). Each entry Af(s,c)A_f(s,c) records the expected number of contribution events of class cc per user in state ss per month:

Af=(E[threads∣C]E[replies∣C]E[reacts∣C]0E[replies∣R]E[reacts∣R]00E[reacts∣X])(3)A_f = \begin{pmatrix} \mathbb{E}[\text{threads}\mid C] & \mathbb{E}[\text{replies}\mid C] & \mathbb{E}[\text{reacts}\mid C] \\ 0 & \mathbb{E}[\text{replies}\mid R] & \mathbb{E}[\text{reacts}\mid R] \\ 0 & 0 & \mathbb{E}[\text{reacts}\mid X] \end{pmatrix} \tag*{(3)}

The upper-triangular sparsity follows from the state hierarchy (C>R>XC > R > X): Reactors produce only reactions, Repliers produce replies and reactions, and Creators participate across all event classes. Inactive/Churned users are omitted as they generate no value in the period.

Value vector. Let vf=(vthread,vreply,vreact)⊤∈R3v_f=(v_{\text{thread}},v_{\text{reply}},v_{\text{react}})^\top\in\mathbb{R}^3 denote the incremental value from one contribution event of each class, estimated from six months of network-level reaction ratios (downstream reactions per thread, per reply, per direct reaction).

Feature score. The short-term feature score is then:

sf=πfactAfvf,(4)s_f = \pi_f^{\mathrm{act}} A_f v_f, \tag*{(4)}

where πfact=(πC,πR,πX)∈R3\pi_f^{\mathrm{act}}=(\pi_C,\pi_R,\pi_X)\in\mathbb{R}^3 denotes the active-state entries of the full distribution πf∈R4\pi_f\in\mathbb{R}^4. This factorization separates who is present (πf\pi_f), what they do (AfA_f), and what it is worth (vfv_f). The log transform applied at the aggregate level (Eqs. (8)–(9)) compresses magnitude differences across networks.

Empirically, the value model contributes to discriminative performance: replacing the learned AfA_f and vfv_f with uniform weights (equal value per state) degrades AUC by 0.007 across the seven temporal windows and by 0.004 on the ablation cohort (Table 3).

METHODAUC
SEP variants
  HEALTH RATIO, 6-STEP (ours)0.953
  EIGENVECTOR-BASED SCORE0.952
  UNIFORM VALUE WEIGHTS0.949
  WITH-GROWTH (prior prod.)0.915
  1-STEP PROJECTED
  INACTIVE/CHURNED SHARE0.932
Non-Markov baselines
  ST SCORE (CURRENT ENGAGEMENT)0.900
  log⁡10\log_{10}-MAU0.857
  NEW-USER ACQUISITION RATE0.802
Supervised (5-fold CV)
  LOGISTIC REG. (4 FEATURES)0.970

Table 3. Ablation and baseline comparison (Sep 2025 →\to Feb 2026, nn=6,092 networks with complete transition data). AUCs are consistent with the seven-window temporal averages for similarly sized networks (cf. Table 2).

SEP computation

Six-step projected score. Given sfs_f from Eq. (4), we project the full four-state distribution forward six steps:

πf(6)=πfPf6,(5)\pi_f^{(6)} = \pi_f P_f^6, \tag*{(5)}

and compute the projected engagement value from the active entries:

sf∗=πf(6),actAfvf.(6)s_f^* = \pi_f^{(6),\mathrm{act}} A_f v_f. \tag*{(6)}

MAU-weighted aggregation. Feature-level scores are combined using feature MAU share as weights:

σ=∑fwf⋅sf,σ∗=∑fwf⋅sf∗,(7)\sigma= \sum_f w_f \cdot s_f,\qquad\sigma^* = \sum_f w_f \cdot s_f^*, \tag*{(7)}

where wf=MAUf/∑f′MAUf′w_f=\mathrm{MAU}_f/\sum_{f'}\mathrm{MAU}_{f'}.

Network Score and Health Ratio. The aggregated scores yield two complementary metrics. The Network Score N\mathcal{N} combines current and projected engagement into a single composite:

N=ln⁡(1+σ+σ∗).(8)\mathcal{N} = \ln(1+\sigma+\sigma^*). \tag*{(8)}

The Health Ratio R\mathcal{R} isolates the structural trajectory by comparing projected to current engagement:

R=ln⁡(1+σ∗)ln⁡(1+σ).(9)\mathcal{R} = \frac{\ln(1+\sigma^*)}{\ln(1+\sigma)}. \tag*{(9)}

Networks with σ=0\sigma= 0 are assigned R=0\mathcal{R} = 0 (Severe by convention, <0.1% of cases). R>1\mathcal{R} > 1 indicates structural improvement—above-average transitions into higher-value states outweigh the current distribution—and is uncommon; generally indicating that the network’s latest-month contributor mix is an outlier, thus the projection reflects mean-regression. Although N\mathcal{N} is used operationally, this paper evaluates R\mathcal{R} as the primary churn predictor.

Algorithm and implementation

We summarize the end-to-end SEP pipeline in Algorithm 1: per-(user, feature, month) state assignment feeds transition estimation, six propagation steps project the contributor distribution, and the per-feature scores are MAU-weighted into the network-level Health Ratio.

Algorithm 1 Stationary Engagement Projection

Input: Six-month event history per (network, ff, uu, tt)

Output: Health Ratio R\mathcal{R} and risk tier per network

  1. Assign contributor state su(f,t)∈{C,R,X,L}s_u^{(f,t)} \in\{C, R, X, L\} for each user uu, feature ff, month tt

  2. Estimate 4×44 \times4 transition matrix Pf\mathbf{P}_f via Eq. (1), with self-loops for unobserved rows (§ 3.1)

  3. Estimate Af\mathbf{A}_f and vf\mathbf{v}_f from engagement data (§ 3.3)

  4. Compute current distribution πf\boldsymbol{\pi}_f from latest month

  5. Compute sf=πfactAfvfs_f = \boldsymbol{\pi}_f^{\mathrm{act}} \mathbf{A}_f \mathbf{v}_f

    for k=1k = 1 to 6 do

    πf←πfPf\boldsymbol{\pi}_f \leftarrow\boldsymbol{\pi}_f \mathbf{P}_f (matrix–vector multiply)

    end for

  6. Compute sf∗=πf(6),actAfvfs_f^* = \boldsymbol{\pi}_f^{(6),\mathrm{act}} \mathbf{A}_f \mathbf{v}_f

  7. Aggregate: σ=∑fwf⋅sf\sigma= \sum_f w_f \cdot s_f, σ∗=∑fwf⋅sf∗\sigma^* = \sum_f w_f \cdot s_f^*

  8. R←ln⁡(1+σ∗)/ln⁡(1+σ)\mathcal{R} \leftarrow\ln(1+\sigma^*) / \ln(1+\sigma)

  9. Assign risk tier from R\mathcal{R} (Table 1)

SQL-native power iteration. Each power iteration step (the inner loop of Algorithm 1) is a single aggregated join expressible as a materialized common table expression (CTE). For state jj at step k+1k+1:

πj(k+1)=∑i∈Sπi(k)⋅Pf(i,j).(10)\pi_j^{(k+1)} = \sum_{i \in\mathcal{S}} \pi_i^{(k)} \cdot P_f(i,j). \tag*{(10)}

This is a dot product between the current distribution vector and column jj of Pf\mathbf{P}_f, implemented as a SUM over a join on state index. Six sequential CTEs yield the full projection—no matrix factorization, no iterative solver, and no external runtime [20], integrating directly into existing analytical pipelines.

Risk tier definition. Tier boundaries were selected from natural breakpoints in observed churn rates in the Sep 2025 → Feb 2026 cohort (Table 1). These outcome-informed boundaries assign descriptive risk labels but do not alter the continuous Health Ratio. The same boundaries are used across the seven rolling evaluation windows (§ 6.1). Because these windows overlap, they should not be interpreted as independent validations of the tier boundaries.

Health RatioRisk Tier
≥0.55\ge0.55No Risk
0.48–0.55Low
0.39–0.48Moderate
0.28–0.39High
<0.28< 0.28Severe

Table 1 (PDF p. 5). Risk tier definition. Boundaries derived from natural breakpoints in the churn-rate gradient (Sep 2025 → Feb 2026 cohort, n=11,941n=11{,}941, ≥100\ge100 MAU); observed 5-month churn rates per tier are reported in Figure 3B.

Computational cost. The full pipeline of state classification, transition estimation, six power iteration steps, scoring, and aggregation executes for all global networks in under 30 minutes on a Snowflake SQL warehouse, orchestrated via Apache Airflow DAGs.

Data

Source and scope. All event data (thread starts, replies, reactions, views) from the production telemetry pipeline of Microsoft Engage, aggregated at the (network, feature_type, user, month) level before entering the scoring pipeline. 17 feature types are supported, spanning community posts across three tiers, Q&A, storyline posts, campaigns, announcements, and others.

Scale. 612,495 network-month observations across 49,695 networks over 22 months (May 2024–February 2026). Network MAU ranges from under 10 to over 440,000. For temporal validation, seven rolling six-month prediction windows span March through September 2025, yielding 11,487 to 11,941 networks per window at ≥100\ge100 MAU.

Score timing. Scores are labeled by their scoring month but use only activity from months preceding the score month; for example, an October score contains no October activity. We distinguish this score-month convention from the five-month outcome horizon.

Churn definition. A network is considered churned if it drops below 100 MAU or loses ≥90%\ge90\% of MAU over five months. This outcome label is not used to compute the continuous Health Ratio. It is used for evaluation and for selecting the descriptive risk-tier boundaries. No individual user data is retained: all analysis runs on aggregate state-count tables.

Results

Multi-window temporal validation

To assess temporal stability, we evaluate across seven rolling six-month prediction windows (March 2025–Sep 2025 start months, 11,487–11,941 networks per window at ≥100\ge100 MAU). For each window, we recompute the no-growth Health Ratio from raw transition matrices. Mean ROC AUC = 0.917 (σ\sigma = 0.006, range [0.910, 0.928]); the tight variance indicates stable discrimination across these rolling windows without recalibrating the continuous score. The span includes summer months (Jun–Aug starts) when vacation seasonality shifts enterprise engagement, and churn base rates remain stable across windows (∼\sim4.8%). For comparison, the growth-adjusted production variant achieves mean AUC 0.824 (σ\sigma = 0.018) over the same windows. The Δ\DeltaAUC = −0.093-0.093 penalty that confirms the single-window ablation finding (§ 6.5) holds across all temporal periods.

Churn rate by risk tier

Five-month outcomes for the Sep 2025 →\to Feb 2026 cohort (nn = 11,941 networks, ≥100\ge100 MAU, 605 churned, 5.1% base rate) are shown in Figure 3. The churn-rate gradient is strictly monotone: Severe networks churn at 156×\times the rate of No Risk networks (54.3% vs. 0.3%). Among networks with complete transition data for the dominant feature type (n≈6,000n\approx6,000; see § 6.5), 87% of churning networks fall in the lowest Health Ratio decile.

Main results: Health Ratio distribution, churn rate by risk tier, score separation by outcome, and precision-recall curve

Figure 3. Main results. (A) Health Ratio distribution with risk tier boundaries (n=11,941n=11{,}941, ≥100\ge100 MAU); median = 0.55. (B) Observed five-month churn rate by risk tier: 156× gradient from No Risk (0.3%) to Severe (54.3%). (C) Score separation by outcome; KS = 0.720, p<10−302p < 10^{-302}. (D) Precision-recall (ablation cohort, n=6,092n=6{,}092); AP = 0.576 (13× base rate).

Risk stratification and operational lift

The Health Ratio separates networks into groups with substantially different observed churn rates. Across the five risk tiers in Figure 3B, observed five-month churn increases monotonically from 0.3% to 54.3%. These rates describe outcomes within the selected tiers; they do not establish that the Health Ratio is a calibrated churn probability. Tier boundaries were selected using the cohort described in § 4. The cumulative lift curve shows that flagging the top 10% of at-risk networks captures 52% of all eventual churners (∼\sim5×\times lift over random), providing a practical operating point for resource-constrained intervention programs.

The Health Ratio also produces well-separated score distributions for churners vs. survivors (Figure 3C): KS = 0.720, p<10−302p < 10^{-302}, with the median churner Health Ratio (0.27) falling below the 5th percentile of survivor scores (0.33). Under the 4.3% ablation-cohort base rate, precision-recall analysis is more informative than ROC alone [21]; the precision-recall curve (Figure 3D) achieves average precision 0.576 (13×\times enrichment over random).

Network size sensitivity

AUC improves with network size (Table 2), driven by two reinforcing factors: larger networks produce more reliable transition matrix estimates (more observed transitions per cell), and they exhibit higher irreducibility rates (all four states are represented in the transition data). At ≥1,000\ge1{,}000 MAU, 83% of networks have fully irreducible matrices vs. 45% across all networks. Degradation is graceful: even at ≥100\ge100 MAU (the primary evaluation threshold), mean AUC remains high at 0.917.

MIN MAUMEAN AUCCHURN RATEnn/WINDOW
≥100\ge1000.9174.8%∼\sim11,800
≥500\ge5000.9511.5%∼\sim4,900
≥1,000\ge1{,}0000.9711.0%∼\sim3,200

Table 2. AUC by minimum MAU threshold (mean across 7 windows, no-growth Health Ratio). Larger networks yield more reliable transition estimates and higher irreducibility rates.

Ablation and baseline comparisons

We compare the Health Ratio against ablation variants and non-Markov baselines (Figure 4, Table 3). Computing exact eigenvectors and growth-adjusted scores requires raw transition matrices, restricting the ablation to nn=6,092 networks with sufficient data in the dominant feature type (of 11,941 at ≥100\ge100 MAU). The excluded networks are predominantly small (<200 MAU). The ablation cohort’s AUC (0.953) is consistent with the seven-window average for similarly sized networks (Table 2).

ROC curves for ablation variants and baselines

Figure 4. ROC curves for ablation variants and baselines (ablation cohort, n=6,092n=6{,}092, Sep 2025 →\to Feb 2026). The legend’s “Eigenvector (exact)” denotes the eigenvector-based score; “1-step churn prob.” denotes the projected inactive/Churned share, not a calibrated network-churn probability.

Ablation. The six-step and eigenvector-based scores achieve AUCs of 0.953 and 0.952, respectively, indicating similar discrimination in this cohort. This comparison does not measure stationary-distribution approximation error. The growth-adjusted variant previously deployed in production trails by 0.038 AUC on this cohort, and by 0.093 AUC across the full seven-window temporal validation (§ 6.1), because compounding inflation disproportionately raises long-term scores for structurally weak but high-growth networks.

Baselines. The strongest unsupervised baseline is the one-step projected inactive/Churned share ((πfPf)L( \pi_f P_f )^L, MAU-weighted; AUC 0.932), confirming that the transition matrix itself carries substantial signal. The Health Ratio’s additional 0.021 AUC derives from the six-step projection, which distinguishes transient dips from structural trajectory toward the inactive/Churned state. Current engagement (ST score, 0.900) and network size (log-MAU, 0.857) are both predictive but capture only present-tense information; the Health Ratio adds a forward-looking structural component.

Supervised upper bound. A logistic regression trained on four features (Health Ratio, ST score, log-MAU, new-user rate) achieves 0.970 AUC under 5-fold cross-validation (+0.017 over R\mathcal{R} alone), with the Health Ratio coefficient 2.5× larger than any other feature. This establishes that supervised methods can extract meaningful additional value by combining SEP outputs with complementary signals.

Discussion

Power iteration vs. eigendecomposition. Finite-step propagation is directly expressible in SQL and retains dependence on the observed initial distribution. For non-ergodic chains, a unique stationary distribution or convergence to a stationary limit is not guaranteed. SEP therefore uses the six-step projection rather than requiring a stationary solution. In the evaluated ablation cohort, its discrimination is similar to that of the eigenvector-based score.

Leading indicator behavior. The Health Ratio is not merely a point-in-time classifier: longitudinal analysis over the 22-month observation window (§ 5) shows that eventual churners exhibit significantly lower Health Ratios eight months before churning (mean ΔR=0.111\Delta R = 0.111 at t−8t-8), widening monotonically to ΔR=0.283\Delta R = 0.283 at the prediction point. Autocorrelation decays from r=0.695r = 0.695 (lag 1) to r=0.433r = 0.433 (lag 3), confirming a persistent signal that still responds to monthly behavioral changes.

Strengths. The framework is fully interpretable: every component maps to a specific feature type and contributor role, enabling targeted intervention (e.g., “Community Posts creators are churning faster than repliers”), complementing optimization approaches that model intervention effects on social activity [22]. It is privacy-preserving (aggregate-only SQL, no individual records retained); extensible (new feature types require only a post-type flag, no retraining); and computationally efficient. Health Ratio’s weak correlation with log-MAU (r=0.06r = 0.06) confirms it captures structural information beyond size.

Relationship to discriminative interpretable models. SEP complements rather than competes with discriminative interpretable approaches such as gradient boosting with SHAP attribution [13] or Cox proportional hazards [12]. Where these methods fit a labeled distribution and attribute predictions post-hoc, SEP is a mechanistic, generative model whose

interpretability is constructive in the sense of Rudin [23]: each modeled quantity (transition probabilities, projected contributor mix, activity matrix, Health Ratio) corresponds directly to a measurable property of the system rather than to an attribution computed against a fitted predictor. However, these structural advantages come at one structural cost: arbitrary nonlinear interactions among raw features cannot be learned (§ 6.5, supervised upper bound). The two compose naturally: SEP’s per-feature Health Ratios, projected distributions, and spectral gaps can serve as engineered features for downstream supervised models, yielding attributions in terms of structural dynamics rather than raw event counts.

Limitations. The model assumes transition dynamics are approximately stationary over the six-month lookback window; rapidly shifting engagement patterns (e.g., a viral event that permanently changes the contributor mix) may violate this assumption, though the monthly re-scoring cadence bounds the impact. Networks below 100 MAU produce sparse transition matrices and noisier estimates. The score captures engagement structure, not content quality. A network with high-quality content but low structural engagement may be underrated. Finally, per-feature transition matrices are estimated independently and aggregated via MAU weighting; cross-feature dependencies are captured implicitly rather than jointly modeled, motivating future tensor-based extensions.

Conclusion

We have shown that contributor-role Markov chain projection provides a principled, label-free, and SQL-deployable framework for social network churn prediction. Across seven rolling temporal windows, the Health Ratio achieves mean AUC 0.917 (σ=0.006\sigma= 0.006) without recalibrating the continuous score. Six-step propagation achieves similar discrimination to the eigenvector-based score and outperforms the growth-adjusted production variant (ΔAUC=0.093\Delta\mathrm{AUC} = 0.093) and all single-signal baselines. The Perron–Frobenius theorem establishes convergence for ergodic chains, while finite-step propagation remains applicable to non-ergodic chains without requiring a stationary limit. The factored value model provides the interpretability that black-box alternatives lack.

Deployed on Microsoft Engage since October 2025, SEP powers an internal dashboard used by product teams to monitor tenant health, identify underperformers, and prioritize targeted interventions. Surfacing structured risk signals has enabled proactive outreach before decline becomes visible in aggregate metrics. Work is underway to combine SEP outputs with LLM-based analysis to generate automated, tenant-specific recommendations.

The framework generalizes across the Microsoft 365 collaboration surface: channel and chat retention in Teams, contributor flow on SharePoint and Loop, etc. SEP only requires role-based engagement and periodic observability. These conditions are common in enterprise settings, where organizational structure and workflow conventions naturally partition users into hierarchical contributor states. By grounding network health in a mechanistic framework rather than platform-specific heuristics, SEP offers a reusable, actionable, and interpretable foundation for churn prediction across multi-user collaborative systems.

References

  1. [1]W. L. Hamilton, J. Zhang, C. Danescu-Niculescu-Mizil, D. Jurafsky, and J. Leskovec, “Loyalty in online communities,” in Proceedings of the International AAAI Conference on Web and Social Media (ICWSM), 2017.
  2. [2]S. R. Kairam, D. J. Wang, and J. Leskovec, “The life and death of online groups: predicting group growth and longevity,” in Proceedings of the Fifth ACM International Conference on Web Search and Data Mining, pp. 673–682, 2012.
  3. [3]L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan, “Group formation in large social networks: membership, growth, and evolution,” in Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 44–54, 2006.
  4. [4]N. Ducheneaut, N. Yee, E. Nickell, and R. J. Moore, “The life and death of online gaming communities: a look at guilds in World of Warcraft,” in Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI), pp. 839–848, 2007.
  5. [5]C. Danescu-Niculescu-Mizil, R. West, D. Jurafsky, J. Leskovec, and C. Potts, “No country for old members: user lifecycle and linguistic change in online communities,” in Proceedings of the 22nd International Conference on World Wide Web, pp. 307–318, 2013.
  6. [6]A. Iriberri and G. Leroy, “A life-cycle perspective on online community success,” ACM Computing Surveys, vol. 41, no. 2, pp. 1–29, 2009.DOI
  7. [7]R. E. Kraut and P. Resnick, Building successful online communities: evidence-based social design. MIT Press, 2012.
  8. [8]P. E. Pfeifer and R. L. Carraway, “Modeling customer relationships as Markov chains,” Journal of Interactive Marketing, vol. 14, no. 2, pp. 43–55, 2000.doi.org/10.1002/(sici)1520-6653(200021)14:2<43::aid-dir4>3.0.co;2-h
  9. [9]P. S. Fader, B. G. Hardie, and K. L. Lee, “Counting your customers the easy way: an alternative to the Pareto/NBD model,” Marketing Science, vol. 24, no. 2, pp. 275–284, 2005.
  10. [10]S. Gupta, D. R. Lehmann, and J. A. Stuart, “Modeling retention in and across cohorts,” International Journal of Research in Marketing, vol. 23, no. 1, pp. 63–72, 2006.
  11. [11]W. Verbeke, K. Dejaeger, D. Martens, J. Hur, and B. Baesens, “New insights into churn prediction in the telecommunication sector: a profit driven data mining approach,” European Journal of Operational Research, vol. 218, no. 1, pp. 211–229, 2012.DOI
  12. [12]D. R. Cox, “Regression models and life-tables,” Journal of the Royal Statistical Society: Series B (Methodological), vol. 34, no. 2, pp. 187–202, 1972.
  13. [13]S. M. Lundberg and S.-I. Lee, “A unified approach to interpreting model predictions,” in Advances in Neural Information Processing Systems (NeurIPS), vol. 30, pp. 4765–4774, 2017.arxiv.org/abs/1705.07874
  14. [14]E. Ascarza, “Retention futility: targeting high-risk customers might be ineffective,” Journal of Marketing Research, vol. 55, no. 1, pp. 80–98, 2018.DOI
  15. [15]L. Wu, “Social network effects on productivity and job security: evidence from the adoption of a social networking tool,” Information Systems Research, vol. 24, no. 1, pp. 30–51, 2013.DOI
  16. [16]E. Seneta, Non-negative matrices and Markov chains. Springer, 2nd ed., 2006.
  17. [17]R. A. Horn and C. R. Johnson, Matrix analysis. Cambridge University Press, 2nd ed., 2013.
  18. [18]D. A. Levin and Y. Peres, Markov chains and mixing times. American Mathematical Society, 2nd ed., 2017.
  19. [19]J. G. Kemeny and J. L. Snell, Finite Markov chains. Springer-Verlag, 2nd ed., 1976.
  20. [20]G. H. Golub and C. F. Van Loan, Matrix computations. Johns Hopkins University Press, 4th ed., 2013.
  21. [21]J. Davis and M. Goadrich, “The relationship between Precision-Recall and ROC curves,” in Proceedings of the 23rd International Conference on Machine Learning (ICML), pp. 233–240, 2006.DOI
  22. [22]M. Farajtabar, N. Du, M. Gomez Rodriguez, I. Valera, H. Zha, and L. Song, “Shaping social activity by incentivising users,” in Advances in Neural Information Processing Systems (NeurIPS), vol. 27, 2014.arxiv.org/abs/1408.0406
  23. [23]C. Rudin, “Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead,” Nature Machine Intelligence, vol. 1, no. 5, pp. 206–215, 2019.DOI

Paper details

vlnc:W_tnhdq682
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 5

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

Not recorded for this paper · View statement →

Looking for related papers…
Contents