TASK	DATASET	MODEL	METRIC NAME	METRIC VALUE	GLOBAL RANK	REMOVE

Randomized Shortest Paths with Net Flows and Capacity Constraints

4 Oct 2019 • Sylvain Courtain • Pierre Leleux • Ilkka Kivimaki • Guillaume Guex • Marco Saerens

This work extends the randomized shortest paths (RSP) model by investigating the net flow RSP and adding capacity constraints on edge flows. The standard RSP is a model of movement, or spread, through a network interpolating between a random-walk and a shortest-path behavior [30, 42, 49]... (read more)

PDF Abstract

Code

Add Remove Mark official

No code implementations yet. Submit your code now

Tasks

Add Remove

NODE CLUSTERING

Datasets

Add Datasets introduced or used in this paper

Results from the Paper

Edit

Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper

Add Remove

METHOD	TYPE
Entropy Regularization	Regularization

Edit Social Preview

Randomized Shortest Paths with Net Flows and Capacity Constraints Edit social preview

Code Edit Add Remove Mark official

Tasks Edit Add Remove

Datasets Edit

Results from the Paper Edit

Methods used in the Paper Edit Add Remove