---
title: 'Co-Editing Networks: Methods & Dynamics'
url: https://www.emergentmind.com/topics/co-editing-networks
type: topic
---

# Co-Editing Networks: Methods & Dynamics

Co-editing networks are network representations of collaborative editing activity in which nodes may denote developers, editors, language communities, journals, or multimodal artifacts, and edges encode editing-based relations such as editing code previously written by another developer, editing after another editor in a revision sequence, statistically significant shared interest in editing the same concepts, or shared membership on editorial boards [2509.26173] [1904.08139] [1603.04225] [1908.09120]. As an analytic object, the co-editing network links low-level edit traces to meso- and macro-level phenomena including burstiness, activity cascades, controversy signatures, cultural borders, editorial power, productivity, churn, and the protocol design of real-time co-editors.

## 1. Definitions and major variants

Across research domains, the term denotes different but structurally related projections of editing behavior.

| Setting | Nodes | Edge semantics |
|---|---|---|
| OSS developer co-editing | Developers | \(A \to B\) when \(A\) edits code previously written by \(B\) |
| Wikipedia revision network | Editors of one article | \(v_i \to v_j\) when \(v_i\) edits immediately after \(v_j\) |
| Multilingual co-editing similarity | Language editions | Weighted tie from significant shared interest in editing the same concepts |
| Interlocking editorship | Journals | Weighted tie by number of common editors |

In Open Source Software, the central interpretive move is to treat one developer editing code previously written by another as a proxy for social interaction and potential social influence. The resulting network is temporal and directed, and it serves as the substrate on which “activity cascades” are defined and tested [2509.26173]. In line- and block-level mining, the same relation is formalized as a time-stamped event \((A,B;t,w)\), where \(A\) modifies code originally authored by \(B\) at time \(t\), with effort weight \(w\) derived from textual change [1903.10180].

Wikipedia work uses two distinct network constructions. At the article level, a revision network is a simple directed graph in which an edge \((v_i,v_j)\) means that editor \(v_i\) edited the article after editor \(v_j\); self-loops are excluded and repeated adjacency does not create multi-edges [1904.08139]. At the cross-language level, the nodes are 110 Wikipedia language editions and the edge weight \(z_{ij}\) measures how strongly two language communities co-edit the same concepts beyond null-model expectations [1603.04225].

A related but distinct one-mode projection appears in scholarly communication. An Interlocking Editorship network links journals that share editorial-board members, with edge weight equal to the number of common editors. In that setting, the network is interpreted as a map of editorial power and shared gatekeeping [1908.09120].

## 2. Construction and mathematical representation

In Git-based software repositories, a canonical co-editing event is
\[
e = (\text{editor}, \text{edited}, t) = (A,B,t),
\]
meaning that at time \(t\) developer \(A\) edited code previously written by developer \(B\). A temporal adjacency can be written as
\[
A_{ij}(t) =
\begin{cases}
1 & \text{if at time } t \text{ there is at least one co-edit } i \to j,\\
0 & \text{otherwise,}
\end{cases}
\]
and a windowed weight as
\[
w_{ij} = \text{number of co-editing events from } i \text{ to } j \text{ in a given time window.}
\]
This event-level construction is extracted from Git histories by `git2net`, which decomposes commits into hunks, runs `git blame` on the parent revision, and reconstructs line-level or block-level ownership transfer [2509.26173] [1911.09484].

The finer-grained representation used in `git2net` is
\[
(A,B;t,w),
\]
where \(w\) is often the Levenshtein distance between pre-edit and post-edit text, used as a proxy for editing effort. The tool also computes Shannon entropy,
\[
S = -\sum_k p_k \log_2 p_k,
\]
to identify high-entropy text-encoded binary content that would otherwise distort effort statistics [1903.10180].

For a Wikipedia article with revision history ordered by adjacent edits, the revision network is
\[
G=(V,E), \qquad
(v_i,v_j)\in E \iff v_i \text{ edits immediately after } v_j,
\]
with no self-loops and no multi-edges. Conceptually, its adjacency matrix is
\[
A_{ij} =
\begin{cases}
1 & \text{if } (v_i,v_j)\in E,\\
0 & \text{otherwise.}
\end{cases}
\]
This construction deliberately abstracts away from edit semantics and focuses on temporal interaction structure [1904.08139].

For multilingual Wikipedia, co-editing is defined at the concept level. If \(k_i^c\) is the number of edits by language edition \(i\) on concept \(c\), then the empirical co-editing weight is
\[
w_{ij}^{c} = k_i^c k_j^c.
\]
With \(M\) total edits, \(p_i = \frac{1}{M}\sum_c k_i^c\), and \(n_c = \sum_i k_i^c\), the null expectation is
\[
\mathrm{E}[w_{ij}^{c}] = n_c(n_c-1)p_i p_j.
\]
A concept-level z-score is
\[
z_{ij}^{c} = \frac{w_{ij}^{c} - \mathrm{E}[w_{ij}^{c}]}{\sigma_{ij}^{c}},
\]
and the aggregate similarity edge is
\[
z_{ij} = \sum_c z_{ij}^{c}.
\]
This yields a statistically filtered co-editing similarity network among languages [1603.04225].

## 3. Temporal dynamics, burstiness, and activity cascades

A major line of work studies co-editing networks as dynamic substrates for accelerated response processes. In OSS communities, commit histories are bursty at both project and developer level. Given commit times \(\{t_1,\dots,t_n\}\), inter-event times are \(\tau_k=t_{k+1}-t_k\), and the burstiness coefficient is
\[
B = \frac{\sigma_\tau-\mu_\tau}{\sigma_\tau+\mu_\tau}
  = \frac{\mathrm{CV}_\tau-1}{\mathrm{CV}_\tau+1}.
\]
Empirically, individual-level mean burstiness is \(B \approx 0.36\) with standard deviation \(0.22\), versus shuffled mean \(B_{\text{shuffled}} \approx 0.09\); project-level mean is \(B \approx 0.54\), and all projects satisfy \(B>0.19\) [2509.26173].

The same study defines a co-edit \((A,B,t_{\text{edit}})\) as a potential trigger for a fast response by \(B\). Let \(H[B]\) be \(B\)’s commit times. The response interval is
\[
\Delta t_{\text{resp}} = t^{\text{next}} - t_{\text{edit}},
\]
where \(t^{\text{next}}\) is the first commit time of \(B\) after the co-edit. If the percentile rank of \(\Delta t_{\text{resp}}\) within \(B\)’s own historical inter-commit intervals is at most \(25\%\), the event is classified as a trigger. Cascades are then temporal chains
\[
e_1=(u_0,u_1,t_1),\ e_2=(u_1,u_2,t_2),\ \dots,\ e_L=(u_{L-1},u_L,t_L),
\]
in which every \(e_k\) is a trigger and \(t_k>t_{k-1}\). Using 100 temporally shuffled null realizations per project, the authors report that **56% (28/50)** of projects show a statistically significant excess of cascades under temporal shuffling, with some effect sizes reaching roughly 27 standard deviations above the null mean. Cascades are typically shallow, with average depth about \(2.0\)–\(2.5\) trigger events and about \(2.0\)–\(3.0\) distinct developers per cascade [2509.26173].

A more general dynamic formalism treats time-varying networks as a sequence \(G^{(1)},\dots,G^{(G)}\) on a common vertex set. In a co-editing context, each \(G^{(g)}\) would be the co-editing graph in time window \(g\). Co-community structure is then captured by snapshot-specific membership matrices \(H_g\) and a shared co-membership matrix \(H\), estimated by
\[
\min_{\{H_g\},H}\;
\sum_{g=1}^{G}\|A_g-H_gH_g^T\|_F^2
+\lambda_1\sum_{g=1}^{G}\|H_g-H\|_1
+\lambda_2\|H\|_1.
\]
This formulation is designed to recover persistent communities together with dynamic deviations [1111.1365].

## 4. Higher-order structure and mesoscopic organization

Beyond dyads and paths, co-editing networks have been studied through motifs, communities, and cross-network comparison. For Wikipedia revision networks, motif analysis is based on the 13 connected directed triads and the Subgraph Ratio Profile. For triad type \(i\),
\[
\Delta_i =
\frac{N_i^{\text{real}} - \langle N_i^{\text{rand}}\rangle}
     {N_i^{\text{real}} + \langle N_i^{\text{rand}}\rangle + \epsilon},
\qquad \epsilon=4,
\]
and
\[
SRP_i = \frac{\Delta_i}{\left(\sum_j \Delta_j^2\right)^{1/2}}.
\]
On **21,631** English Wikipedia articles, controversial articles show over-representation of triads **111D**, **111U**, and **201**, and cluster at high values of the first principal component, which explains **53.7%** of variance; PC2 explains **22.3%**, and PC3 **6.7%** [1904.08139].

At the cross-language scale, Infomap on the weighted co-editing similarity network identifies **21 multi-language clusters plus 9 languages forming their own clusters**. English forms a single-language cluster. The strongest explanatory factors for cross-language co-editing similarity are **bilingualism**, **shared language family**, and **shared religion**, while **geographic distance** is the weakest among the tested hypotheses. In the full MRQAP model, adjusted \(R^2 \approx 0.1458\) [1603.04225].

Interlocking Editorship networks reveal another mesoscopic layer. Here journals are nodes, weights count shared editors, and Jaccard dissimilarity between journal editor sets is compared with analogous dissimilarities in co-citation and interlocking authorship. Across statistics, economics, and information and library sciences, the three network families are positively associated. The strongest distance correlation is always between co-citation and interlocking authorship, while interlocking editorship is consistently the sparsest network type. Its communities, however, have the highest modularity in all three fields: **0.400** in statistics, **0.528** in information and library sciences, and **0.444** in economics [1908.09120].

## 5. Prediction, performance, and collaborative outcomes

Co-editing networks have been used not only descriptively but also for forecasting and performance analysis. In OSS communities, developer churn is modeled with **Logistic Regression** over non-overlapping **12-month windows**, evaluated in a leave-one-repository-out setting with **SMOTE** and balanced class weights. Balanced accuracy ranges from about **58% to 84%** across projects. The strongest features are `Maximum Inactivity Time` (**1.011**), `Neighbors’ Max Inactivity Time` (**0.605**), and `Neighbors’ Mean Inactivity Time` (**0.467**); among structural variables, `Out-degree` (**0.364**) and `Distance to founder` (**0.263**) are larger than `In-degree` (**0.046**) and `Betweenness` (**0.008**) [2509.26173].

A related large-scale Git study uses more than **1.2 million commits** and more than **25,000 developers** to test whether productivity is higher when developers edit their own code than when they edit foreign code. Productivity is defined as
\[
\text{prod}=\frac{lev}{ict},
\]
with \(lev\) the Levenshtein effort and \(ict\) the inter-commit time. Across six OSS projects, mixed-effects models show a positive, statistically significant effect for the own-code fraction, with relative productivity increases ranging from about **14%** in FFmpeg to about **128%** in igraph when working on own rather than foreign code [1911.09484].

In Wikipedia WikiProjects, the coeditor network is the directed unweighted graph in which an edge from editor \(i\) to editor \(j\) exists if \(i\) edits an article and later \(j\) edits the same article. Project performance is
\[
P(W)=\frac{f(W)+g(W)}{n(W)},
\]
where \(f(W)\) and \(g(W)\) are the numbers of Featured and Good Articles, and efficiency at grade threshold \(G\) is
\[
E(W,G)=\left[\frac{1}{N(W,G)}\sum_{t\in T(W,G)}\frac{r(t)}{g(t)}\right]^{-1}.
\]
Empirically, low-degree coeditor networks are associated with both high performance and high efficiency. In the performance regression, standardized coefficients are **−0.7** for log mean degree, **−0.4** for log out-degree skew, and **−0.33** for log mean path length [1804.03763].

## 6. Trust, quality assurance, and reviewer selection

A complementary line of work models collaborative editing platforms as trust networks and propagates article satisfaction rather than editing influence. The network is
\[
G := ((V,E),T,B),
\]
where \(V\) is the user set, \((i,j)\in E\) means that user \(i\) trusts user \(j\), \(t_{ij}\in[0,1]\) is trust, and \(b_i\in[0,1]\) is the minimum satisfaction threshold for user \(i\). With a set of raters \(N_R\) and ratings \(R\), non-rater satisfaction is defined by
\[
s_i =
\frac{
\alpha \sum_{j_1\in N_R(i)} t_{ij_1}^2 s_{j_1}
+ (1-\alpha)\sum_{j_2\in N_N(i)} t_{ij_2}^2 s_{j_2}
}{
\alpha \sum_{j_1\in N_R(i)} t_{ij_1}
+ (1-\alpha)\sum_{j_2\in N_N(i)} t_{ij_2}
},
\]
while \(s_i=r_i\) for raters. Under the convention that users with no trust path to any rater receive \(s_i=0\), the system has a unique solution in \([0,1]^N\) [1202.2888].

Reviewer selection becomes the **MAXIMUM-SATISFACTION** problem: choose at most \(\kappa\) raters to maximize the number of satisfied users. That problem is NP-hard by reduction from Maximum \(k\)-Cover. The proposed greedy strategy iteratively adds the non-rater with highest marginal satisfaction gain. In simulations on directed Erdős–Rényi graphs with **10,000** users and uniform rater score \(r=1\), only about **20%** of users need to review to satisfy almost everyone under typical parameter choices, and the marginal-satisfaction greedy algorithm substantially outperforms random selection and a simpler incoming-trust heuristic [1202.2888].

This quality-control model is not itself a co-editing graph in the narrow sense. It is, however, a graph-theoretic overlay on collaborative editing platforms in which review effort, trust, and satisfaction can be optimized without requiring all participants to inspect the current version.

## 7. System architectures, controversies, and multimodal expansion

At the systems level, co-editing networks are also distributed infrastructures that propagate operations among replicas. OT and CRDT have often been presented as competing paradigms, but detailed comparative work argues that both follow the same general transformation approach for text co-editors: users generate position-based operations on external state, and the system must transform or reinterpret those operations so that replicas converge while preserving causality and user intention [1905.01517] [1810.02137].

OT systems are typically organized around a **Transparent Adaptation** architecture with a **Single-user application**, a **Collaboration Adapter**, and a **Generic Collaboration Engine**. Canonical communication topologies include server-based OT, distributed OT with a message server, and fully distributed OT. The same comparative literature argues that the claim “OT needs a central server; CRDT doesn’t” is false: both OT and CRDT can use scalar or vector timestamps, both can be embedded in client–server or more distributed topologies, and actual CRDT-based co-editors still rely on servers for at least session management or broadcast [1905.01517].

The empirical asymmetry in deployment is clear in the surveyed literature. OT underlies systems such as Google Wave/Docs, ShareJS, CKEditor collaborative editing, Etherpad, Dropbox Paper, Box Notes, and Codox Apps, while CRDT-based text co-editors are mostly represented by smaller prototypes such as Teletype and Alchemy Book. The critique of CRDT in this setting focuses on hidden transformation steps, tombstone or identifier overhead, and unresolved correctness anomalies in specific sequence designs [1810.02137].

A different expansion of the concept appears in multimodal story-writing systems. Vistoria defines co-editing as synchronized, bidirectional manipulation of text and images treated as “co-equal narrative materials.” Its basic unit is a card containing an image, a corresponding story fragment, and object keywords; highlights, comments, and cluster-panel aggregations connect cards through shared characters, objects, and scenes. Operations such as lasso, collage, filters, and perspective shift propagate across modalities rather than within a single text stream [2509.13646]. This suggests that the notion of a co-editing network is broadening from user–user and user–document projections toward networks of artifacts, references, and structurally mapped cross-modal entities.

Current research also delineates recurrent limitations. In OSS cascade analysis, the trigger threshold is fixed at the 25% quantile, cascade tracing is restricted to the top 20% most active initiators, and only Git co-editing is modeled, excluding issues, pull-request comments, mailing lists, and chat. In Wikipedia revision networks, temporal adjacency is assumed to represent meaningful interaction, while edit content and off-platform coordination are ignored. These constraints motivate multi-layer interaction models, semantic augmentation, and generative temporal models such as Hawkes processes as natural next steps [2509.26173] [1904.08139].

Source: https://www.emergentmind.com/topics/co-editing-networks