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 |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/145422 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
The consecutive ones submatrix problem for sparse matrices
by: Tan, J., et al.
Published: (2014) -
The central limit theorem for weighted minimal spanning trees on random points
by: Kesten, H., et al.
Published: (2014) -
Approximating the Spanning k-Tree Forest Problem
by: Liao, C.-S., et al.
Published: (2014) -
Reliable broadcasting and secure distributing in channel networks
by: Bao, F., et al.
Published: (2016) -
Partial spatial protection for provisioning differentiated reliability in FSTR-based Metro Ethernet networks
by: Shan, D.M., et al.
Published: (2014)