495 citations · 1.2k across the 35 of their papers we have counts for
36 papers
Majority Dynamics on Resampled Sparse Erdős--Rényi Graphs: Gaussian Winner Selection in Collaborative Agent Networks
Ioana Dumitriu, Muchen Ju, Hai-Xiao Wang
Collective decisions in agent networks emerge from repeated local interactions, as agents update their opinions (colors) based on their neighbors, potentially leading to consensus.…
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…
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…
Structured Divide-and-Conquer for the Definite Generalized Eigenvalue Problem
James Demmel, Ioana Dumitriu, Ryan Schneider
This paper presents a fast, randomized divide-and-conquer algorithm for the definite generalized eigenvalue problem, which corresponds to pencils in which and are H…
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…
Generalized Pseudospectral Shattering and Inverse-Free Matrix Pencil Diagonalization
James Demmel, Ioana Dumitriu, Ryan Schneider
We present a randomized, inverse-free algorithm for producing an approximate diagonalization of any matrix pencil . The bulk of the algorithm rests on a randomi…