12 citations · 15 across the 5 of their papers we have counts for
5 papers
Tight bounds for expected propagation time of probabilistic zero forcing
Mehdi Jelassi, Julien Portier, Rik Sarkar
We study the probabilistic zero forcing process, a probabilistic variant of the classical zero forcing process. We show that for every connected graph on vertices, there ex…
On problems in extremal multigraph theory
Victor Falgas-Ravry, Adva Mond, Rik Sarkar +1
A multigraph G is said to be an (s,q)-graph if every s-set of vertices in G supports at most q edges (counting multiplicities). In this paper we consider the maximal sum and produc…
Analyzing Recursiveness in Multimodal Generative Artificial Intelligence: Stability or Divergence?
Javier Conde, Tobias Cheung, Gonzalo Martínez +2
One of the latest trends in generative Artificial Intelligence is tools that generate and analyze content in different modalities, such as text and images, and convert information…
Karate Club: An API Oriented Open-source Python Framework for Unsupervised Learning on Graphs
Benedek Rozemberczki, Oliver Kiss, Rik Sarkar
We present Karate Club a Python framework combining more than 30 state-of-the-art graph mining algorithms which can solve unsupervised machine learning tasks. The primary goal of t…
Distributed Submodular Maximization
Baharan Mirzasoleiman, Amin Karbasi, Rik Sarkar +1
Many large-scale machine learning problems--clustering, non-parametric learning, kernel machines, etc.--require selecting a small yet representative subset from a large dataset. Su…