• # RNAexpNumNbors

• Referenced in 1 article [sw23799]
• algorithm, where 〈N〉 denotes the Boltzmann expected network degree. If the network is regular ... every node has the same degree), then the mean first passage time (MFPT) computed ... this is not true for non-regular networks. In particular, RNA secondary structure folding kinetics ... software to compute the expected degree of the network of secondary structures of a given...
• # VNDS

• Referenced in 6 articles [sw07586]
• neighborhood search Finding communities or clusters, in networks, or graphs, has been the subject ... minus the expected number of inner edges assuming the same distribution of degrees. Numerous heuristics...
• # LPAm+

• Referenced in 6 articles [sw07587]
• neighborhood search Finding communities or clusters, in networks, or graphs, has been the subject ... minus the expected number of inner edges assuming the same distribution of degrees. Numerous heuristics...
• # Hyperbolic graph generator

• Referenced in 5 articles [sw19944]
• properties like heterogeneous degree distributions and strong clustering. Recent research on network geometry has shown ... that those real networks can be adequately modeled as random geometric graphs in hyperbolic spaces ... generate such graphs. Besides real-world-like networks, the program can generate random graphs from ... simulations show a good match between the expected values of different network structural properties...
• # EBPCC

• Referenced in 1 article [sw20118]
• model is then analyzed to provide the expectation value of nodes within the monitored region ... whole network. Experimental results show that the proposed $k$-degree coverage algorithm improves the network...