Journal of Complex Networks 2019
Top Research Directions
The 2 research directions with Journal of Complex Networks 2019 papers, ranked by paper count. Share is the fraction of the edition’s papers in the direction.
| # | Direction | Papers | Share |
|---|---|---|---|
| 1 | Generalizing Graph Algorithms to Directed and Weighted Networks | 1 | 50.0% |
| 2 | Zero One Laws for Random Graph Connectivity | 1 | 50.0% |
Download all directions as CSV
Institutions
Institutions credited by Journal of Complex Networks 2019 papers: a paper credits every institution named in its affiliations, once. 7 institutions share 2 credited papers.
| # | Institution | Papers | Share |
|---|---|---|---|
| 1 | Delft University of Technology | 1 | 50.0% |
| 2 | Moscow Institute of Physics and Technology | 1 | 50.0% |
| 3 | SGH Warsaw School of Economics | 1 | 50.0% |
| 4 | The Alan Turing Institute | 1 | 50.0% |
| 5 | Toronto Metropolitan University | 1 | 50.0% |
| 6 | University of Oxford | 1 | 50.0% |
| 7 | Yandex (Russia) | 1 | 50.0% |
Download all institutions as CSV
About this data
Papers. Journal of Complex Networks 2019 lists 2 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.
Directions. Directions are Lacuna’s clustering of the concept elements extracted from each paper, so a paper can belong to several and direction counts add up to more than the paper count. A direction’s share is its papers divided by the edition’s papers.
Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 2 of 2 papers (100.0%) credit at least one institution and are the base for institution shares; the rest have no resolved affiliation yet.
Data. Counts come from Lacuna’s data build of 2026-11-18 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “Journal of Complex Networks 2019”, https://lacuna.tiptreesystems.com/venue/journal-of-complex-networks/2019.
Papers
| Title |
|---|
| Local clustering coefficient of spatial preferential attachment model |
| The simplex geometry of graphs |