activity
20192023
most citedDrug-Target Interaction Prediction with Graph Attention networks

18 citations · 19 across the 5 of their papers we have counts for

collaborators

7 papers

cs.IT2023

New Codes on High Dimensional Expanders

Irit Dinur, Siqi Liu, Rachel Yun Zhang

We describe a new parameterized family of symmetric error-correcting codes with low-density parity-check matrices (LDPC). Our codes can be described in two seemingly different ways…

math.CO2022

Local and global expansion in random geometric graphs

Siqi Liu, Sidhanth Mohanty, Tselil Schramm +1

Consider a random geometric 2-dimensional simplicial complex sampled as follows: first, sample vectors uniformly at random on $\m…

cs.CC2021

Hypercontractivity on High Dimensional Expanders: Approximate Efron-Stein Decompositions for -Product Spaces

Tom Gur, Noam Lifshitz, Siqi Liu

We prove hypercontractive inequalities on high dimensional expanders. As in the settings of the p-biased hypercube, the symmetric group, and the Grassmann scheme, our inequalities…

math.PR2021★ 1 cited

Testing thresholds for high-dimensional sparse random geometric graphs

Siqi Liu, Sidhanth Mohanty, Tselil Schramm +1

In the random geometric graph model , we identify each of our vertices with an independently and uniformly sampled vector from the -dimensional unit sph…

q-bio.QM2021★ 18 cited

Drug-Target Interaction Prediction with Graph Attention networks

Haiyang Wang, Guangyu Zhou, Siqi Liu +2

Motivation: Predicting Drug-Target Interaction (DTI) is a well-studied topic in bioinformatics due to its relevance in the fields of proteomics and pharmaceutical research. Althoug…

cs.DS2021

On statistical inference when fixed points of belief propagation are unstable

Siqi Liu, Sidhanth Mohanty, Prasad Raghavendra

Many statistical inference problems correspond to recovering the values of a set of hidden variables from sparse observations on them. For instance, in a planted constraint satisfa…

cs.DM2019

High-Dimensional Expanders from Expanders

Siqi Liu, Sidhanth Mohanty, Elizabeth Yang

We present an elementary way to transform an expander graph into a simplicial complex where all high order random walks have a constant spectral gap, i.e., they converge rapidly to…