We present a heuristic algorithm for the optimization of transport on complex networks.
Previously proposed network transport optimization algorithms aim at avoiding or reducing link …

… A node has k-coreness k c if it belongs to the k c -core but not to the k c +1-core. An edge
has k-density k d if it belongs to the k d -core but not to the k d +1-core. The error bars indicate …

Coronavirus disease 2019 (COVID-19) is a mild to moderate respiratory tract infection, however,
a subset of patients progress to severe disease and respiratory failure. The mechanism …

Uniform sampling from graphical realizations of a given degree sequence is a fundamental
component in simulation-based measurements of network observables, with applications …

A large number of complex networks are scale-free 1 , 2 — that is, they follow a power-law
degree distribution. Here we propose that the emergence of many scale-free networks is tied …

We study the realizability of scale-free networks with a given degree sequence, showing
that the fraction of realizable sequences undergoes two first-order transitions at the values 0 …

Angiotensin-converting enzyme 2 (ACE2) and accessory proteases (TMPRSS2 and CTSL)
are needed for severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) cellular entry…

The community structure of a complex network can be determined by finding the partitioning
of its nodes that maximizes modularity. Many of the proposed algorithms for doing this work …

… is very close to unity, which means that kNk is independent of k and the other parameters
in the scaling regime. Since k is the influence of a leader with k followers, kNk represents the …

… COVID-19 macrophages were mapped to IPF or control macrophages based on a kNN (k-…
imity analysis based on a k-nearest neighbors classifier revealed a significant similarity of …