Mean Field Analysis of Personalized PageRank with Implications for Local Graph Clustering

06/20/2018
by   Konstantin Avrachenkov, et al.
0

We analyse a mean-field model of Personalized PageRank on the Erdos-Renyi random graph containing a denser planted Erdos-Renyi subgraph. We investigate the regimes where the values of Personalized PageRank concentrate around the mean-field value. We also study the optimization of the damping factor, the only parameter in Personalized PageRank. Our theoretical results help to understand the applicability of Personalized PageRank and its limitations for local graph clustering.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2019

Mean field models for large data-clustering problems

We consider mean-field models for data--clustering problems starting fro...
research
04/06/2022

A Short Tutorial on Mean-Field Spin Glass Techniques for Non-Physicists

This tutorial is based on lecture notes written for a class taught in th...
research
07/09/2020

On the role of solute drag in reconciling laboratory and natural constraints on olivine grain growth kinetics

We investigate the effect of solute drag on grain growth (GG) kinetics i...
research
05/09/2012

Optimization of Structured Mean Field Objectives

In intractable, undirected graphical models, an intuitive way of creatin...
research
05/29/2022

Mean Field inference of CRFs based on GAT

In this paper we propose an improved mean-field inference algorithm for ...
research
04/16/2020

Refined Mean Field Analysis of the Gossip Shuffle Protocol – extended version –

Gossip protocols form the basis of many smart collective adaptive system...
research
12/10/2020

Detecting Structured Signals in Ising Models

In this paper, we study the effect of dependence on detecting a class of...

Please sign up or login with your details

Forgot password? Click here to reset