how to get a subgraph of a graph that is representative of the whole graph 03-06-2015d1051

2015-04-23

how to get a subgraph of a graph that is representative of the whole graph 03-06-2015d1051
reduce the size of a graph and maintain many of the same properties
representative subgraph
approximating a network
reduce network size
approximating networks

03-06-2015d1023
S: how to get a subgraph of a graph that is representative of the whole graph
-[Metropolis Algorithms for Representative Subgraph Sampling]
--http://mlg.eng.cam.ac.uk/pub/pdf/HueBorKriGha08.pdf
-A new algorithm for extracting a small representative subgraph from a very large graph
--http://arxiv.org/abs/1207.4825
-Representative Subgraph Sampling using Markov Chain Monte Carlo Methods
--http://research.ics.aalto.fi/events/MLG08/papers/session1/paper7.pdf
-Preserving Pairwise Relationships in Subgraphs
--http://www.cs.cmu.edu/~deepay/mywww/papers/icml11-ppvpreserving.pdf
-Efficient Subgraph Matching on Billion Node Graphs
--http://vldb.org/pvldb/vol5/p788_zhaosun_vldb2012.pdf
--looks like kind of an interesting paper, but not exactly like what I am looking for
-Representative Frequent Approximate Subgraph Mining in Multi-Graph Collections
--http://ccc.inaoep.mx/portalfiles/CCC-15-001.pdf

Some items
-emailed nacosta@ccc.inaoep.mx; 4-23-15
{
approximate subgraph from larger graph
1 message
Kurt Whittemore <kurtwhittemore@gmail.com>	Thu, Apr 23, 2015 at 4:36 PM
To: nacosta@ccc.inaoep.mx
Hi Niusvel Acosta-Mendoza,

I would like to make subgraphs of larger graphs so that I can analyze them in a variety of ways.  I saw your document titled "Representative Frequent Approximate Subgraph Mining in Multi-Graph Collections", and I thought you might know something about this topic.  Do you have a program I could use to input a graph and obtain a representative subgraph?  I would rather not write code from scratch to achieve this goal.

Thanks for any help and information you have to offer me!

Best regards,
Kurt Whittemore
-emailed deepay@yahoo-inc.com, maximg@yahoo-inc.com, avattani@cs.ucsd.edu; 4-23-15
}
-emailed Harish Sethu; 4-23-15
{
approximate subgraphs of larger graphs
1 message
Kurt Whittemore <kurtwhittemore@gmail.com>	Thu, Apr 23, 2015 at 4:23 PM
To: xiaoyu.chu@drexel.edu
Hi Harish Sethu,

I would like to make subgraphs of larger graphs so that I can analyze them in a variety of ways.  I saw your paper "A new algorithm for extracting a small representative subgraph from a very large graph".  Do you have a program I could use to input a graph and obtain a representative subgraph?  I would rather not write code from scratch to mimic your algorithm.

Thanks for any help and information you have to offer me!

Best regards,
Kurt Whittemore
}
-contacted an author of "Metropolis Algorithms for Representative Subgraph Sampling" to see if they had a program for their algorithm
{
Christian Hübler
huebler@ifi.lmu.de
-email message failed to deliver

Hans-Peter Kriegel
kriegel@dbs.iﬁ.lmu.de
}

azim58wiki: