A fast algorithm to approximate the spectral density of locally tree-like networks with assortativity.
- Published in:
- Journal of Complex Networks, 2023, v. 11, n. 2, p. 1, doi. 10.1093/comnet/cnad005
- By:
- Publication type:
- Article
Works matching IS 20511310 AND DT 2023 AND VI 11 AND IP 2
Results: 7
1
2
Correction to: Structural analysis of water networks.
- Published in:
- 2023
- Publication type:
- Correction Notice
3
A method based on link prediction for identifying set of super-spreaders in complex networks.
- Published in:
- Journal of Complex Networks, 2023, v. 11, n. 2, p. 1, doi. 10.1093/comnet/cnad007
- By:
- Publication type:
- Article
4
Comparing directed networks via denoising graphlet distributions.
- Published in:
- Journal of Complex Networks, 2023, v. 11, n. 2, p. 1, doi. 10.1093/comnet/cnad006
- By:
- Publication type:
- Article
5
Targeted Community Merging provides an efficient comparison between collaboration clusters and departmental partitions.
- Published in:
- Journal of Complex Networks, 2023, v. 11, n. 2, p. 1, doi. 10.1093/comnet/cnad012
- By:
- Publication type:
- Article
6
Non-linear consensus dynamics on temporal hypergraphs with random noisy higher-order interactions.
- Published in:
- Journal of Complex Networks, 2023, v. 11, n. 2, p. 1, doi. 10.1093/comnet/cnad009
- By:
- Publication type:
- Article
7
The concentration of edge betweenness in the evolution of planar graphs and street networks.
- Published in:
- Journal of Complex Networks, 2023, v. 11, n. 2, p. 1, doi. 10.1093/comnet/cnad004
- By:
- Publication type:
- Article