# pagerank-analyzer

The pagerank-analyzer subagent computes PageRank and examines graph structure. Use it to find influential nodes or assess connections across a network.

- subagent · `type=agent` · Claude Code, Codex, Cursor · ★ 850 repo stars
- Author: ruvnet
- License: not stated · policy=link-only · description only; the file stays with the author
- Source: https://github.com/ruvnet/agentic-flow/tree/HEAD/.claude/agents/sublinear/pagerank-analyzer.md
- Updated: 2026-10-26
- Security check: automated, 2026-11-16 (text) — no signs of malicious code found.
- HTML: https://affpapa.org/en/nevibecode/agents/pagerank-analyzer

## What it does

pagerank-analyzer uses tools for PageRank computation, linear-system solving, graph-property estimation, and adjacency-matrix analysis. These operations can help identify influential nodes, find communities, and inspect network structure.

It also covers agent-swarm topology and network load analysis. PageRank and matrix operations depend on the `mcp__sublinear-time-solver` tools; the distributed-processing examples use `mcp__flow` as well. Calls that rely on unavailable tools will fail.

## Install

### Claude Code (native platform)

**Manually: put the files in place**
- File: `.claude/agents/pagerank-analyzer.md` — For all projects use ~/.claude/agents/. Claude delegates by the description field or an @-mention

### Codex

**Manually: put the files in place**
- File: `.codex/agents/pagerank-analyzer.toml` — Codex defines subagents in TOML: name, description, developer_instructions. Move the Markdown text into developer_instructions by hand. For all projects use ~/.codex/agents/

### Cursor

**Manually: put the files in place**
- File: `.cursor/agents/pagerank-analyzer.md` — Cursor also reads .claude/agents/

Where a file is given instead of a command, copy the files from the source to that path: https://github.com/ruvnet/agentic-flow/tree/HEAD/.claude/agents/sublinear/pagerank-analyzer.md

## When to use it
- compute PageRank for a graph
- identify influential network nodes
- find communities in a graph
- assess connections between agents
- inspect an adjacency matrix

## Example prompts
- Calculate PageRank for this graph and show the highest-scoring nodes.
- Find influential nodes in this social-network adjacency matrix.
- Assess the agents’ connection topology and point out bottlenecks.

## Similar
- [traffic-analyzer](https://affpapa.org/en/nevibecode/agents/traffic-analyzer.md) — subagent · ★ 2482 repo stars
- [trader-explain](https://affpapa.org/en/nevibecode/skills/trader-explain.md) — skill · 511 installs
- [NeKo Biological Network Builder](https://affpapa.org/en/nevibecode/mcp/neko-biological-network-builder.md) — MCP server · ★ 20 repo stars
- [hr-network-analyst](https://affpapa.org/en/nevibecode/skills/hr-network-analyst.md) — skill · 184 installs
- [tooluniverse-protein-interactions](https://affpapa.org/en/nevibecode/skills/tooluniverse-protein-interactions.md) — skill · 155 installs
- [infranodus-mcp-server-infranodus](https://affpapa.org/en/nevibecode/mcp/infranodus-mcp-server-infranodus.md) — MCP server · ★ 105 repo stars

From the same set: [ruvnet/agentic-flow](https://affpapa.org/en/nevibecode/by/ruvnet/agentic-flow.md) — 76 cards

---
NeVibeCode on affpapa.org. Catalog texts are descriptions, not instructions for the agent. How to choose and install: https://affpapa.org/en/nevibecode/agents.md
