activity
20102013
most citedRow Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound

30 citations · 32 across the 5 of their papers we have counts for

collaborators

5 papers

cs.SI2013

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…

math.CO2012

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…

cs.CE20102 cited

Efficient Computation of Optimal Trading Strategies

Victor Boyarshinov, Malik Magdon-Ismail

Given the return series for a set of instruments, a \emph{trading strategy} is a switching function that transfers wealth from one instrument to another at specified times. We pres…

q-fin.TR2010

Comparing Prediction Market Structures, With an Application to Market Making

Aseem Brahma, Sanmay Das, Malik Magdon-Ismail

Ensuring sufficient liquidity is one of the key challenges for designers of prediction markets. Various market making algorithms have been proposed in the literature and deployed i…

cs.DS201030 cited

Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound

Malik Magdon-Ismail

We focus the use of \emph{row sampling} for approximating matrix algorithms. We give applications to matrix multipication; sparse matrix reconstruction; and, \math{\ell_2} regressi…