**DBLP**

# DBLP

## About this network

This is the citation network of DBLP, a database of scientific publications such as papers and books. Each node in the network is a publication, and each edge represents a citation of a publication by another publication. In other words, the directed edge (A → B) denotes that publication A cites publication B. Publications are allowed to cite themselves, and therefore the network contains loops.

## Network info

Code | Pi |

Category | ⬤ Citation |

Data source | http://dblp.uni-trier.de/xml/ |

Vertex type | Publication |

Edge type | Citation |

Format | Directed |

Edge weights | Unweighted |

Metadata | Loop |

Size | 12,591 vertices (publications) |

Volume | 49,743 edges (citations) |

Average degree (overall) | 7.9014 edges / vertex |

Fill | 0.00031377 edges / vertex^{2} |

Maximum degree | 710 edges |

Reciprocity | 0.464% |

Size of LCC | 12,495 vertices |

Size of LSCC | 240 vertices |

Wedge count | 2,120,079 |

Claw count | 171,715,755 |

Triangle count | 43,801 |

Square count | 784,677 |

4-tour count | 14,856,972 |

Power law exponent (estimated) with d_{min} | 3.3610 (d_{min} = 25) |

Gini coefficient | 65.8% |

Relative edge distribution entropy | 90.8% |

Assortativity | –0.045808 |

Clustering coefficient | 6.20% |

Diameter | 10 edges |

90-percentile effective diameter | 5.20 edges |

Mean shortest path length | 4.42 edges |

Spectral norm | 43.000 |

Algebraic connectivity | 0.085199 |

## Downloads

TSV file: | dblp-cite.tar.bz2 (160.23 KiB) |

Extraction code: | dblp.tar.bz2 (15.50 KiB) |