EDA with Graphs. Chris Volinsky Shannon Laboratory AT&T Labs-Research Workshop on Statistical Inference, Computing and Visualization for Graphs Stanford University August 2, 2003. Introduction. Some suggestions about looking at graphs Our way of analyzing graphs: COI
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Workshop on Statistical Inference, Computing and Visualization for Graphs
August 2, 2003
Main point – sometimes EDA is all you need!
Lets look at some…
Is this EDA?
This model works for me….do you agree?
OInformative overlap score
wao = weight of edge from a to o
wob = weight of edge from o to b
wo= sum weight of edges to o
dao, dob are the graph distances from a and b to o
Calls fade out over time;
The larger q is , the longer the call has non-negligible weight