activity
20182026
most citedDank or Not? -- Analyzing and Predicting the Popularity of Memes on Reddit

42 citations · 140 across the 14 of their papers we have counts for

collaborators

15 papers

cs.LG2026

The Critical Role of Model Selection in Causal Inference: A Comparative Analysis of Classification Models within the InferBERT Framework for Pharmacovigilance

Csaba Kiss, Roland Molontay, Gabriele Pergola

Distinguishing causal adverse drug events (ADEs) from spurious correlations remains a central challenge in pharmacovigilance. The InferBERT framework integrates transformer models…

cs.CY2024

Meme Template Identification in the Wild: Comparing Methods for Semi-Open-Set Recognition

Levente Murgás, Huy Nguyen, Donát Ákos Köller +4

Image-with-text memes are a dominant form of online communication, and much of their spread happens through meme templates which are recurring visual formats that users adapt with…

physics.soc-ph2022

Towards a Better Understanding of the Characteristics of Fractal Networks

Enikő Zakar-Polyák, Marcell Nagy, Roland Molontay

The fractal nature of complex networks has received a great deal of research interest in the last two decades. Similarly to geometric fractals, the fractality of networks can also…

cs.SI2022★ 5 cited

Investigating the Origins of Fractality Based on Two Novel Fractal Network Models

Enikő Zakar-Polyák, Marcell Nagy, Roland Molontay

Numerous network models have been investigated to gain insights into the origins of fractality. In this work, we introduce two novel network models, to better understand the growin…

math.PR2022★ 1 cited

Color-avoiding percolation in edge-colored Erdős-Rényi graphs

Balázs Ráth, Kitti Varga, Panna Tímea Fekete +1

We study a variant of the color-avoiding percolation model introduced by Krause et al., namely we investigate the color-avoiding bond percolation setup on (not necessarily properly…

math.OC2022★ 27 cited

Tournament schedules and incentives in a double round-robin tournament with four teams

László Csató, Roland Molontay, József Pintér

In a round-robin tournament, a team may lack the incentive to win if its final rank does not depend on the outcome of the matches still to be played. This paper introduces a classi…

cs.SI2021★ 24 cited

Comparative Analysis of Box-Covering Algorithms for Fractal Networks

Péter Tamás Kovács, Marcell Nagy, Roland Molontay

Research on fractal networks is a dynamically growing field of network science. A central issue is to analyze fractality with the so-called box-covering method. As this problem is…

cs.SI2020★ 42 cited

Dank or Not? -- Analyzing and Predicting the Popularity of Memes on Reddit

Kate Barnes, Tiernon Riesenmy, Minh Duc Trinh +3

Internet memes have become an increasingly pervasive form of contemporary social communication that attracted a lot of research interest recently. In this paper, we analyze the dat…

physics.soc-ph2020★ 2 cited

Twenty Years of Network Science: A Bibliographic and Co-Authorship Network Analysis

Roland Molontay, Marcell Nagy

Two decades ago three pioneering papers turned the attention to complex networks and initiated a new era of research, establishing an interdisciplinary field called network science…

cs.LG2019

Copula-based anomaly scoring and localization for large-scale, high-dimensional continuous data

Gábor Horváth, Edith Kovács, Roland Molontay +1

The anomaly detection method presented by this paper has a special feature: it does not only indicate whether an observation is anomalous or not but also tells what exactly makes a…

cs.SI2019★ 3 cited

On the Structural Properties of Social Networks and their Measurement-calibrated Synthetic Counterparts

Marcell Nagy, Roland Molontay

Data-driven analysis of large social networks has attracted a great deal of research interest. In this paper, we investigate 120 real social networks and their measurement-calibrat…

cs.SI2019★ 29 cited

Two Decades of Network Science as seen through the co-authorship network of network scientists

Roland Molontay, Marcell Nagy

Complex networks have attracted a great deal of research interest in the last two decades since Watts & Strogatz, Barabási & Albert and Girvan & Newman published their highly-cited…

cs.DM2018★ 1 cited

On the complexity of color-avoiding site and bond percolation

Roland Molontay, Kitti Varga

The mathematical analysis of robustness and error-tolerance of complex networks has been in the center of research interest. On the other hand, little work has been done when the a…

cs.SI2018

Network Classification Based Structural Analysis of Real Networks and their Model-Generated Counterparts

Marcell Nagy, Roland Molontay

Data-driven analysis of complex networks has been in the focus of research for decades. An important area of research is to study how well real networks can be described with a sma…

math.CO2018★ 6 cited

Transfinite fractal dimension of trees and hierarchical scale-free graphs

Júlia Komjáthy, Roland Molontay, Károly Simon

In this paper, we introduce a new concept: the transfinite fractal dimension of graph sequences motivated by the notion of fractality of complex networks proposed by Song et al. We…