Integration of spatial and single-cell data across modalities with weakly linked features

S Chen, B Zhu, S Huang, JW Hickey, KZ Lin… - Nature …, 2024 - nature.com
Although single-cell and spatial sequencing methods enable simultaneous measurement of
more than one biological modality, no technology can capture all modalities within the same …

Robust single-cell matching and multimodal analysis using shared and distinct features

B Zhu, S Chen, Y Bai, H Chen, G Liao, N Mukherjee… - Nature …, 2023 - nature.com
The ability to align individual cellular information from multiple experimental sources is
fundamental for a systems-level understanding of biological processes. However, currently …

Matching recovery threshold for correlated random graphs

J Ding, H Du - The Annals of Statistics, 2023 - projecteuclid.org
Matching recovery threshold for correlated random graphs Page 1 The Annals of Statistics
2023, Vol. 51, No. 4, 1718–1743 https://doi.org/10.1214/23-AOS2305 © Institute of …

Optimal thresholds and algorithms for a model of multi-modal learning in high dimensions

C Keup, L Zdeborová - arXiv preprint arXiv:2407.03522, 2024 - arxiv.org
This work explores multi-modal inference in a high-dimensional simplified model,
analytically quantifying the performance gain of multi-modal inference over that of analyzing …

Integration of spatial and single-cell data across modalities with weak linkage

S Chen, B Zhu, S Huang, JW Hickey, KZ Lin, M Snyder… - bioRxiv, 2023 - biorxiv.org
Abstract single-cell sequencing methods have enabled the profiling of multiple types of
molecular readouts at cellular resolution, and recent developments in spatial barcoding, in …

Database matching under noisy synchronization errors

S Bakirtas, E Erkip - IEEE Transactions on Information Theory, 2024 - ieeexplore.ieee.org
The re-identification or de-anonymization of users from anonymized data through matching
with publicly available correlated user data has raised privacy concerns, leading to the …

A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation

J Ding, Z Li - arXiv preprint arXiv:2306.00266, 2023 - arxiv.org
We propose an efficient algorithm for matching two correlated Erd\H {o} s--R\'enyi graphs
with $ n $ vertices whose edges are correlated through a latent vertex correspondence …

Database matching under adversarial column deletions

S Bakirtas, E Erkip - 2023 IEEE Information Theory Workshop …, 2023 - ieeexplore.ieee.org
The de-anonymization of users from anonymized microdata through matching or aligning
with publicly-available correlated databases has been of scientific interest recently. While …

Matching Map Recovery with an Unknown Number of Outliers

A Minasyan, T Galstyan, S Hunanyan… - International …, 2023 - proceedings.mlr.press
We consider the problem of finding the matching map between two sets of $ d $-dimensional
noisy feature-vectors. The distinctive feature of our setting is that we do not assume that all …

A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation

J Ding, Z Li - arXiv preprint arXiv:2212.13677, 2022 - arxiv.org
Motivated by the problem of matching vertices in two correlated Erd\H {o} sR\'enyi graphs,
we study the problem of matching two correlated Gaussian Wigner matrices. We propose an …