Curved Markov Chain Monte Carlo for Network Learning

We present a geometrically enhanced Markov chain Monte Carlo sampler for networks based on a discrete curvature measure defined on graphs. Specifically, we incorporate the concept of graph Forman curvature into sampling procedures on both the nodes and edges of a network explicitly, via the transition probability of the Markov chain, as well as implicitly, via the target stationary distribution, which gives a novel, curved Markov chain Monte Carlo approach to learning networks. We show that integrating curvature into the sampler results in faster convergence to a wide range of network statistics demonstrated on deterministic networks drawn from real-world data.

[1]  Robin Forman,et al.  Bochner's Method for Cell Complexes and Combinatorial Ricci Curvature , 2003, Discret. Comput. Geom..

[2]  Kevin P. Murphy,et al.  Machine learning - a probabilistic perspective , 2012, Adaptive computation and machine learning series.

[3]  Emil Saucan,et al.  Discrete curvatures and network analysis , 2017 .

[4]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[5]  J. Jost,et al.  Forman curvature for complex networks , 2016, 1603.00386.

[6]  Christos Faloutsos,et al.  Sampling from large graphs , 2006, KDD '06.

[7]  Edoardo M. Airoldi,et al.  Network sampling and classification: An investigation of network model representations , 2011, Decis. Support Syst..

[8]  Jeffrey Xu Yu,et al.  On random walk based graph sampling , 2015, 2015 IEEE 31st International Conference on Data Engineering.

[9]  A. Vespignani,et al.  The architecture of complex weighted networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Jérôme Kunegis,et al.  KONECT: the Koblenz network collection , 2013, WWW.

[11]  Emil Saucan,et al.  Forman-Ricci Flow for Change Detection in Large Dynamic Data Sets , 2016, Axioms.