34 citations · 42 across the 6 of their papers we have counts for
6 papers
Seeding Influential Nodes in Non-Submodular Models of Information Diffusion
Elliot Anshelevich, Ameya Hate, Malik Magdon-Ismail
We consider the model of information diffusion in social networks from \cite{Hui2010a} which incorporates trust (weighted links) between actors, and allows actors to actively parti…
Spreading Processes and Large Components in Ordered, Directed Random Graphs
Paul Horn, Malik Magdon-Ismail
Order the vertices of a directed random graph \math{v_1,...,v_n}; edge \math{(v_i,v_j)} for \math{i<j} exists independently with probability \math{p}. This random graph model is re…
A Note On Estimating the Spectral Norm of A Matrix Efficiently
Malik Magdon-Ismail
We give an efficient algorithm which can obtain a relative error approximation to the spectral norm of a matrix, combining the power iteration method with some techniques from matr…
Using a Non-Commutative Bernstein Bound to Approximate Some Matrix Algorithms in the Spectral Norm
Malik Magdon-Ismail
We focus on \emph{row sampling} based approximations for matrix algorithms, in particular matrix multipication, sparse matrix reconstruction, and \math{\ell_2} regression. For \mat…
Embedding a Forest in a Graph
Mark Goldberg, Malik Magdon-Ismail
For \math{p\ge 1}, we prove that every forest with \math{p} trees whose sizes are can be embedded in any graph containing at least vertices…
Maximum Likelihood Fitting of Tidal Streams With Application to the Sagittarius Dwarf Tidal Tails
Nathan Cole, Heidi Jo Newberg, Malik Magdon-Ismail +10
We present a maximum likelihood method for determining the spatial properties of tidal debris and of the Galactic spheroid. With this method we characterize Sagittarius debris usin…