On the properties of Gromov matrices and their applications in network inference
The spanning tree heuristic is a commonly adopted procedure in network inference and estimation. It allows one to generalize an inference method developed for trees, which is usually based on a statistically rigorous approach, to a heuristic procedure for general graphs by (usually randomly) choosin...
Saved in:
Main Authors: | Ji, Feng, Tang, Wenchang, Tay, Wee Peng |
---|---|
其他作者: | School of Electrical and Electronic Engineering |
格式: | Article |
語言: | English |
出版: |
2020
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/145422 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
The consecutive ones submatrix problem for sparse matrices
由: Tan, J., et al.
出版: (2014) -
The central limit theorem for weighted minimal spanning trees on random points
由: Kesten, H., et al.
出版: (2014) -
Approximating the Spanning k-Tree Forest Problem
由: Liao, C.-S., et al.
出版: (2014) -
Reliable broadcasting and secure distributing in channel networks
由: Bao, F., et al.
出版: (2016) -
Partial spatial protection for provisioning differentiated reliability in FSTR-based Metro Ethernet networks
由: Shan, D.M., et al.
出版: (2014)