activity
20182026
most citedSubexponential-Time Algorithms for Sparse PCA

19 citations · 70 across the 39 of their papers we have counts for

collaborators

49 papers

math.PR2026

Convergence of Kikuchi matrices to -independent and -Gaussian limits

Afonso S. Bandeira, Dmitriy Kunisky, Petar Nizić-Nikolac +2

Kikuchi matrices are a family of structured matrices that were introduced to study problems involving tensors and hypergraphs. We show that, as the ambient dimension grows, dense r…

math.PR2026

Matrix Concentration and Equivalent Operators on Fock Spaces

Afonso S. Bandeira, Dmitriy Kunisky, Petar Nizić-Nikolac +2

We develop a method for proving matrix concentration inequalities by identifying random matrices with associated deterministic operators acting on suitable Fock spaces and controll…

stat.ME2026

Global Synchronization for Multi-Source Data Integration under Blockwise Missing Patterns

Runbing Zheng, Dmitriy Kunisky

Multi-source data integration problems over datasets from different sources covering different but possibly overlapping sets of entities have become increasingly important in many…

cs.DS2026

Improved polynomial-time algorithms for detecting and recovering planted -cliques

Dmitriy Kunisky, Songtao Mao

In the planted clique problem, one observes either an Erdős--Rényi graph on vertices or such a graph with a clique added to vertices, and seeks to detect or recover…

math.CO2026

Inequalities for rank-two permanents and finite free convolutions

Dmitriy Kunisky, Daniel A. Spielman, Xifan Yu

Bang (1976) proved the inequality for matrix permanents , where is the all-ones matrix and is any…

math.CO2026

The Hypergraph Moore Bound

Afonso S. Bandeira, Dmitriy Kunisky, Petar Nizić-Nikolac +2

The hypergraph Moore bound conjectured by Feige (2008) controls the size of the smallest even cover in a -uniform hypergraph in terms of the average density of hyperedges. An ev…