activity
20102023
most citedSimplicial Closure and higher-order link prediction

555 citations · 2.9k across the 55 of their papers we have counts for

collaborators
Showing 2018Show all

5 papers · 1 filter

cs.DM2018★ 55 cited

Flow Smoothing and Denoising: Graph Signal Processing in the Edge-Space

Michael T. Schaub, Santiago Segarra

This paper focuses on devising graph signal processing tools for the treatment of data defined on the edges of a graph. We first show that conventional tools from graph signal proc…

cs.SI2018★ 222 cited

Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplacian

Michael T. Schaub, Austin R. Benson, Paul Horn +2

Focusing on coupling between edges, we generalize the relationship between the normalized graph Laplacian and random walks on graphs by devising an appropriate normalization for th…

cs.SI2018★ 6 cited

Structured networks and coarse-grained descriptions: a dynamical perspective

Michael T. Schaub, Jean-Charles Delvenne, Renaud Lambiotte +1

This chapter discusses the interplay between structure and dynamics in complex networks. Given a particular network with an endowed dynamics, our goal is to find partitions aligned…

cs.SI2018★ 49 cited

Multiscale dynamical embeddings of complex networks

Michael T. Schaub, Jean-Charles Delvenne, Renaud Lambiotte +1

Complex systems and relational data are often abstracted as dynamical processes on networks. To understand, predict and control their behavior, a crucial step is to extract reduced…

cs.SI2018★ 555 cited

Simplicial Closure and higher-order link prediction

Austin R. Benson, Rediet Abebe, Michael T. Schaub +2

Networks provide a powerful formalism for modeling complex systems by using a model of pairwise interactions. But much of the structure within these systems involves interactions t…