4 citations · 6 across the 5 of their papers we have counts for
8 papers
Majority Dynamics on Resampled Sparse Erdős--Rényi Graphs: Gaussian Winner Selection and Pace to Unanimity
Ioana Dumitriu, Muchen Ju, Hai-Xiao Wang
We study the two-opinion majority dynamics process: at each time step, every vertex adopts the majority opinion among its neighbors, retaining its current opinion if there is a tie…
Majority Dynamics on Assortative Sparse Stochastic Block Models
Ioana Dumitriu, Muchen Ju, Hai-Xiao Wang
Majority dynamics is a two-opinion process in which each vertex repeatedly updates to the majority opinion among its neighbors. We study this process on a resampled sparse binary s…
Optimal and exact recovery on the general nonuniform Hypergraph Stochastic Block Model
Ioana Dumitriu, Hai-Xiao Wang
Consider the community detection problem in random hypergraphs under the non-uniform hypergraph stochastic block model (HSBM), where each hyperedge appears independently with some…
Partial recovery and weak consistency in the non-uniform hypergraph Stochastic Block Model
Ioana Dumitriu, Hai-Xiao Wang, Yizhe Zhu
We consider the community detection problem in sparse random hypergraphs under the non-uniform hypergraph stochastic block model (HSBM), a general model of random networks with com…
Rank One Completion for Higher Order Tensors
Linghao Zhang, Ioana Dumitriu, Jiawang Nie
We study the rank one completion problem for tensors of arbitrary orders. The notion of rank one determinable tensors is introduced. We explore its properties and propose a recursi…
Fast and Inverse-Free Algorithms for Deflating Subspaces
James Demmel, Ioana Dumitriu, Ryan Schneider
This paper explores a key question in numerical linear algebra: how can we compute projectors onto the deflating subspaces of a regular matrix pencil , in particular without…