USVT | R Documentation |

estimates the network probability matrix by the universal singular value thresholding of Chatterjee (2015), with the improvement mentioned in Zhang et. al. (2017).

```
USVT(A)
```

`A` |
adjacency matrix |

Instead of using the original threshold in Chatterjee (2015), the estimate is generated by taking the n^(1/3) leading spectral components. The method was mentioned in Zhang et. al. (2017) and suggested by an anonymous reviewer.

The estimated probability matrix.

Tianxi Li and Can M. Le

Maintainer: Tianxi Li tianxili@virginia.edu

S. Chatterjee. Matrix estimation by universal singular value thresholding. The Annals of Statistics, 43(1):177-214, 2015. Y. Zhang, E. Levina, and J. Zhu. Estimating network edge probabilities by neighbourhood smoothing. Biometrika, 104(4):771-783, 2017.

`LSM.PGD`

```
dt <- RDPG.Gen(n=600,K=2,directed=TRUE)
A <- dt$A
fit <- USVT(A)
```

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.