◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Rik Sarkar

University of Edinburgh

13 papers hereh-index 263.7k citations65 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author6
  • last author7

Across the 13 of 13 papers where every author was matched, so the position is known.

fields
  • cs.LG7
  • cs.SI4
  • cs.CG1
  • cs.DS1
affiliations
  • University of Edinburgh
Homepage
same name
  • Rik Sarkar — 12 papers, h 10
  • Rik Sarkar — 5 papers, h 2
  • Rik Sarkar — 4 papers, h 1
  • Rik Sarkar — 1 paper
  • Rik Sarkar — 1 paper, h 0

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20182022
most citedGEMSEC: Graph Embedding with Self Clustering

63 citations · 88 across the 9 of their papers we have counts for

collaborators
Showing cs.SIShow all

4 papers · 1 filter

cs.SI2021★ 7 cited

Twitch Gamers: a Dataset for Evaluating Proximity Preserving and Structural Role-based Node Embeddings

Benedek Rozemberczki, Rik Sarkar

Proximity preserving and structural role-based node embeddings have become a prime workhorse of applied graph mining. Novel node embedding techniques are often tested on a restrict…

cs.SI2020

Heterogeneous Interventions Reduce the Spread of COVID-19 in Simulations on Real Mobility Data

Haotian Wang, Abhirup Ghosh, Jiaxin Ding +2

Major interventions have been introduced worldwide to slow down the spread of the SARS-CoV-2 virus. Large-scale lockdowns of human movements are effective in reducing the spread, b…

cs.SI2020★ 2 cited

Little Ball of Fur: A Python Library for Graph Sampling

Benedek Rozemberczki, Oliver Kiss, Rik Sarkar

Sampling graphs is an important task in data mining. In this paper, we describe Little Ball of Fur a Python library that includes more than twenty graph sampling algorithms. Our go…

cs.SI2018★ 63 cited

GEMSEC: Graph Embedding with Self Clustering

Benedek Rozemberczki, Ryan Davies, Rik Sarkar +1

Modern graph embedding procedures can efficiently process graphs with millions of nodes. In this paper, we propose GEMSEC -- a graph embedding algorithm which learns a clustering o…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.