activity
20192024
most citedDensest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity

14 citations · 32 across the 8 of their papers we have counts for

collaborators

8 papers

cs.LG2024

ULTRA-MC: A Unified Approach to Learning Mixtures of Markov Chains via Hitting Times

Fabian Spaeh, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis

This study introduces a novel approach for learning mixtures of Markov chains, a critical process applicable to various fields, including healthcare and the analysis of web users.…

cs.LG2023

On the Role of Edge Dependency in Graph Generative Models

Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos +1

In this work, we introduce a novel evaluation framework for generative models of graphs, emphasizing the importance of model-generated graph overlap (Chanpuriya et al., 2021) to en…

cs.LG2023

ADAMM: Anomaly Detection of Attributed Multi-graphs with Metadata: A Unified Neural Network Approach

Konstantinos Sotiropoulos, Lingxiao Zhao, Pierre Jinghong Liang +1

Given a complex graph database of node- and edge-attributed multi-graphs as well as associated metadata for each graph, how can we spot the anomalous instances? Many real-world pro…

cs.SI2023★ 14 cited

Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity

Atsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos +1

Dense subgraph discovery methods are routinely used in a variety of applications including the identification of a team of skilled individuals for collaboration from a social netwo…

cs.LG2021★ 1 cited

On the Power of Edge Independent Graph Models

Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos +1

Why do many modern neural-network-based graph generative models fail to reproduce typical real-world network characteristics, such as high triangle density? In this work we study t…

cs.LG2021★ 1 cited

DeepWalking Backwards: From Embeddings Back to Graphs

Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos +1

Low-dimensional node embeddings play a key role in analyzing graph datasets. However, little work studies exactly what information is encoded by popular embedding methods, and how…

cs.LG2020★ 13 cited

Node Embeddings and Exact Low-Rank Representations of Complex Networks

Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos +1

Low-dimensional embeddings, from classical spectral embeddings to modern neural-net-inspired methods, are a cornerstone in the modeling and analysis of complex networks. Recent wor…

cs.SI2019★ 3 cited

TwitterMancer: Predicting Interactions on Twitter Accurately

Konstantinos Sotiropoulos, John W. Byers, Polyvios Pratikakis +1

This paper investigates the interplay between different types of user interactions on Twitter, with respect to predicting missing or unseen interactions. For example, given a set o…