%\documentclass{sig-alternate-sigmod06}
%\documentclass[times, 10pt,twocolumn]{article}
% \documentclass[twoside,leqno,twocolumn]{article}
\documentclass{sig-alt-release2}
% \usepackage{ltexpprt}
% \usepackage{times}
% \usepackage{personal}
% \usepackage{multirow}
% \input defs.tex
\begin{document}
\conferenceinfo{WICOW'08,} {October 30, 2008, Napa Valley, California, USA.} 

\CopyrightYear{2008}

\crdata{978-1-60558-259-7/08/10} 

\title{Graph Mining and Influence Propagation }
\author{Christos
Faloutsos\\ Carnegie Mellon University \\
\{christos\}@cs.cmu.edu }
 \date{}
 \maketitle

\category{H.2.8}[Database~Applications][Data~mining]

\terms{Algorithms}
\keywords{Graph Mining}


% TITLE: Graph Mining and Influence Propagation
% SPEAKER: Christos Faloutsos (CMU)

\begin{abstract}
How do graphs look like? How do they evolve over time?
How can we generate realistic-looking graphs?
We review some static and temporal 'laws',
and we describe the ``Kronecker'' graph generator,
which naturally matches all of the known properties of real graphs.

We also describe some case studies.
The  first is on influence and virus propagation on real graphs,
where we show that the so-called ``epidemic threshold'' of a graph
depends only on the first eigenvalue of the adjacency matrix.
The second shows how to spot patterns in e-bay interaction
graphs, indicative of  the ``non-delivery'' type of fraud.
The last is analysis on blog cascades and some surprising patterns there.
\end{abstract}


{\bf BIOGRAPHICAL NOTE}

Christos Faloutsos is a Professor at Carnegie Mellon University.
He has received the Presidential Young Investigator Award by
the National Science Foundation (1989), 
the Research Contributions Award in ICDM 2006,
twelve ``best paper'' awards, and several teaching awards.
He has served as a member of the executive committee of SIGKDD;
he has published over 160 refereed articles, 11 book chapters
and one monograph.  He holds five patents and 
he has given over 20 tutorials and over 10 invited distinguished lectures.
His research interests include data mining
for streams and networks, fractals, indexing for 
multimedia and bio-informatics data, and database performance.

% \small
% \bibliographystyle{abbrv}
% \bibliography{paper,christosref}
\end{document}
