B. Aditya Prakash Graduate Student
Computer Science Department
School of Computer Science
Carnegie Mellon University

NEW - Graduating!

I am graduating in 2012 and am on the job market. Here are my application materials:

About Me

Hello, I am Aditya and am a final year doctoral student in the Computer Science Department at CMU. I am a citizen of India and a native of Bangalore, but was raised in Bhilai. I lived in Bombay for 4 years during my bachelors. My dad works for the Bhilai Steel Plant and my mother is a Sr. Lecturer in the M.G.M. School there. I also have a wonderful elder brother. And I like Cricket (the sport), Hindustani Classical music (I play the Tabla) and Calvin&Hobbes. I also blog very occasionally.

Education

Research Interests

How do opinions get formed in online forums? Which people should we immunize, to prevent an epidemic as fast as possible? My principal long term research interest is to solve large real-world problems, by understanding and managing efficiently, dynamical mechanisms on networks, occurring across natural, social, and technological systems. My research combines theoretical analysis of models, developing efficient algorithms and empirical studies on tera-byte scale data. I have also worked on time-series modeling and mining, privacy and anomaly detection.

My advisor is Prof. Christos Faloutsos and I work in the Database Group. Earlier at IIT Bombay, my advisor was Prof. S. Sudarshan where I worked on Query Optimization. Apart from Computer Science, I like Physics and World History.

If you're around CMU on a Monday afternoon and are interested in data mining/databases or want a quick bite, please attend the DB Seminar at 4p.m. in GHC 8115. Brownie points for those who volunteer to give a talk! Send me an email indicating such a desire.

Pre-prints and Manuscripts

Please mail me if you want a copy of any tech-report or pre-print.
  1. Fractional Immunization on Networks
    B. Aditya Prakash, Lada Adamic, Theodore Iwashnya, Hanghang Tong, Christos Faloutsos
  2. How much of Twitter is Influence?
    B. Aditya Prakash, Deepayan Chakrabarti, Kunal Punera
  3. Worst-case footprints in the SIS model
    B. Aditya Prakash, Varun Gupta, Christos Faloutsos
  4. Competing Viruses on Composite Networks: Who wins?
    Xuetao Wei, Nicholas Valler, B. Aditya Prakash, Iulian Neamtiu, Michalis Faloutsos and Christos Faloutsos
  5. Gelling, and Melting, Large Graphs through Edge Manipulation
    Hanghang Tong, B. Aditya Prakash, Tina Eliassi-Rad, Michalis Faloutsos, Christos Faloutsos

Publications

Disclaimer: All pdfs here are the author's version of the work. They are posted here by permission of ACM/IEEE/Springer for your personal use, not for re-distribution. The definitive version was published in the respective conference proceedings/journal issue.

My DBLP entry (contains a subset of my publications)

(in reverse chronological order)
  1. Rise and Fall Patterns of Information Diffusion: Model and Implications [PDF]
    Yasuko Matsubara, Yasushi Sakurai, B. Aditya Prakash, Lei Li and Christos Faloutsos
    in SIGKDD 2012, Beijing
  2. Interacting Viruses on a Network: Can both survive? [PDF]
    Alex Beutel, B. Aditya Prakash, Roni Rosenfeld and Christos Faloutsos
    in SIGKDD 2012, Beijing
  3. Threshold Conditions for Arbitrary Cascade Models on Arbitrary Networks [PDF]
    B. Aditya Prakash, Deepayan Chakrabarti, Michalis Faloutsos, Nicholas Valler, Christos Faloutsos
    in Knowledge and Information Systems Journal, Springer. 2012.
  4. Winner-takes-all: Competing Viruses on fair-play networks [PDF]
    B. Aditya Prakash, Alex Beutel, Roni Rosenfeld, Christos Faloutsos
    in WWW 2012, Lyon
  5. Threshold Conditions for Arbitrary Cascade Models on Arbitrary Networks [PDF] [extended arXiv version]
    B. Aditya Prakash, Deepayan Chakrabarti, Michalis Faloutsos, Nicholas Valler, Christos Faloutsos
    in IEEE ICDM 2011, Vancouver
    Invited to KAIS Journal Special Issue (ICDM Best papers)
  6. Time Series Clustering: Complex is Simpler! [PDF]
    Lei Li, B. Aditya Prakash
    in ICML 2011, Bellevue
  7. Epidemic Spread in Mobile Ad Hoc Networks: Determining the Tipping Point [PDF]
    Nicholas Valler, B. Aditya Prakash, Hanghang Tong, Michalis Faloutsos, Christos Faloutsos
    in IFIP NETWORKING 2011, Valencia
  8. On the Vulnerability of Large Graphs [PDF][CODE]
    Hanghang Tong, B. Aditya Prakash, Charalampos Tsourakakis, Tina Eliassi-Rad, Christos Faloutsos, Duen Horng Chau
    in IEEE ICDM 2010, Sydney
  9. Virus Propagation on Time-Varying Networks: Theory and Immunization Algorithms [PDF]
    B. Aditya Prakash, Hanghang Tong, Nicholas Valler, Michalis Faloutsos, Christos Faloutsos
    in ECML-PKDD 2010, Barcelona
  10. Parsimonious Linear Fingerprinting for Time Series [PDF][CODE]
    Lei Li, B. Aditya Prakash, Christos Faloutsos
    in VLDB 2010, Singapore
  11. MetricForensics: A Multi-Level Approach for Mining Volatile Graphs [PDF]
    Keith Henderson, Tina Eliassi-Rad, Christos Faloutsos, Leman Akoglu, Lei Li, Koji Maruhashi, B. Aditya Prakash, Hanghang Tong
    in SIGKDD 2010, Washington DC
  12. EigenSpokes: Surprising Patterns and Scalable Community Chipping in Large Graphs [PDF][CODE]
    B. Aditya Prakash, Ashwin Sridharan, Mukund Seshadri, Sridhar Machiraju, Christos Faloutsos
    in PAKDD 2010, Hyderabad
  13. BGP-lens: Patterns and Anomalies in Internet Routing Updates [PDF][CODE]
    B. Aditya Prakash, Nicholas Valler, David Andersen, Michalis Faloutsos, Christos Faloutsos
    in SIGKDD 2009, Paris
  14. FRAPP: A framework for high-accuracy privacy-preserving mining [PDF]
    Shipra Agrawal, Jayant R. Haritsa, B. Aditya Prakash
    in Data Mining and Knowldge Discovery Journal, Springer, 2008
  15. Complex Group-by Queries for XML [PDF]
    C. Gokhale, N. Gupta, P. Kumar, L. V. S. Lakshmanan, R. Ng, B. Aditya Prakash
    in ICDE 2007, Istanbul, Turkey

Other Publications

  1. Formalizing the BGP stability problem: Patterns and a Chaotic model
    B. Aditya Prakash, Michalis Faloutsos, Christos Faloutsos
    CMU-TR, Preliminary Version in IEEE INFOCOM NetSciCom Workshop 2011
  2. Surprising Patterns and Scalable Community Detection in Large Graphs [PDF]
    B. Aditya Prakash, Ashwin Sridharan, Mukund Seshadri, Sridhar Machiraju, Christos Faloutsos
    in IEEE ICDM Large Scale Data Mining Workshop 2009
  3. On Query Optimization Issues in Fine-Grained Authorization
    B. Aditya Prakash
    B.Tech Thesis, IIT Bombay, 2007
  4. Query Optimization
    B. Aditya Prakash
    Junior Thesis, IIT Bombay, 2006

Patents

  1. Determining User Communities in Communication Networks
    Ashwin Sridharan, Mukund Seshadri, James Schneider, B. Aditya Prakash, Christos Faloutsos, Sridhar Machiraju
    filed by Sprint Inc. in March 2010
  2. Analysis of Computer Network Activity by Successively Removing Accepted Types of Access Events
    B. Aditya Prakash, Alice Zheng, Jack Stokes, Eric Fitzgerald, Theodore Hardy
    filed by Microsoft Inc. in April 2010

Software Tools

  1. Netshield: fast algorithm to reduce vulnerability of static graphs [CODE]
  2. PLiF: efficient method to learn sparse, interpretable and useful features from set of time-series [CODE]
  3. SpokEn: effective community detection on large social networks [CODE]
  4. BGP-Lens: tool to quickly find hidden anomalies in bursty time-sequences [CODE]

Contact

Office

Gates Hillman Complex 6008
Computer Science Department
Carnegie Mellon University
5000 Forbes Avenue
Pittsburgh PA 15213
USA
Phone: 412-268-7375

Email

invert(cs.cmu.edu @ badityap)

Collaborators

Some of the people I had the opportunity to work with (in alphabetical order)
Lada Adamic, David Andersen, Deepayan Chakrabarti, Anirban Dasgupta, Christos Faloutsos, Michalis Faloutsos, Varun Gupta, Maxim Gurevich, Theodore Iwashnya, Lei Li, Laks Lakshmananan, Sridhar Machiraju, Kunal Punera, Roni Rosenfeld, S. Sudarshan, Jack Stokes, Hanghang Tong, Nicholas Valler, Alice Zheng
Designed by Polo Chau