Co-Author Network Distance Calculator: How Close Are Researchers? Free

Academic worlds are small, and knowing how closely two researchers are connected helps you pick reviewers, avoid conflicts, and find introductions. This free tool measures the network distance between two researchers: how many co-authorship steps separate them, with the shortest path spelled out.

What the tool does

You paste co-author pairs, one per line, and name two researchers. The tool builds a graph from your pairs and runs a shortest-path search between the two names. The answer is a number, the distance, plus the path itself: Ana Ruiz to Kenji Sato to Maria Chen is distance two. A distance of one means the two people have co-authored directly. A distance of zero means you entered the same person twice. If no path exists in your data, the tool says so plainly instead of inventing a connection.

How to use it

Collect co-author pairs from publication lists, keeping names spelled identically every time, since Ana Ruiz and A. Ruiz will be treated as different people. Paste one pair per line in the format Name A | Name B, enter the two researchers you want to connect, and press the button. Start with a small, reliable set of pairs, such as the co-authors of a few key papers, and expand only if the first result shows no path. Check the path itself, not just the number, because the intermediate names often matter more than the distance.

Worked example

Suppose your pairs are Ana Ruiz with Kenji Sato, Kenji Sato with Maria Chen, and Maria Chen with Li Wei. The distance from Ana Ruiz to Li Wei is three, through Kenji and Maria. The distance from Ana Ruiz to Kenji Sato is one, a direct co-authorship. If you then ask for the distance from Ana Ruiz to someone with no shared co-authors in your list, the tool reports no path, which usually means your pair list is incomplete rather than that the researchers are truly unconnected.

Reading the results honestly

Network distance measures graph steps, not real closeness. Two researchers one step apart may have co-authored a fifty-author paper and never met, while two researchers three steps apart may have shared a lab for years. Distance is also sensitive to missing data: one omitted pair can turn a distance of two into no path at all. Use the result as a starting point for questions, such as who could introduce you, or whether a reviewer is closer to the authors than you realised, and verify anything important against publication records.

Honest limits

This tool only knows the pairs you paste. It does not query publication databases, does not resolve name variants, and cannot distinguish two researchers who share a name. Large graphs typed by hand will contain errors, and a single misspelt name breaks the path through that person. For serious network analysis, use a bibliographic database with author identifiers; this tool is for quick, small-scale questions where you already hold the pair list.

Practical tips

Before a conference, map the distances between yourself and the speakers you want to meet: a distance of two means you share a mutual co-author who can introduce you, which is a warmer opening than a cold email. When screening reviewers, a distance of one or two from the paper’s authors deserves a conflict check, while a larger distance is usually reassuring but never proof of independence. Keep your pair lists saved with your project notes so you can reuse them instead of rebuilding them each time.

Using distance at conferences

Before a conference, list the speakers you most want to meet and work out your distance to each. A distance of two gives you a natural introduction route through a shared co-author, which is far warmer than a cold email and far more likely to lead to a real conversation.

Embed this tool on your website — free

Copy the code below to add this working tool to your own page. A small credit link stays with it — that’s all we ask.