38 citations · 38 across the 5 of their papers we have counts for
5 papers
Fast Searching The Densest Subgraph And Decomposition With Local Optimality
Yugao Zhu, Shenghua Liu, Wenjie Feng +1
Densest Subgraph Problem (DSP) is an important primitive problem with a wide range of applications, including fraud detection, community detection and DNA motif discovery. Edge-bas…
Hypergraphs with Edge-Dependent Vertex Weights: Spectral Clustering based on the 1-Laplacian
Yu Zhu, Boning Li, Santiago Segarra
We propose a flexible framework for defining the 1-Laplacian of a hypergraph that incorporates edge-dependent vertex weights. These weights are able to reflect varying importance o…
Hypergraph Cuts with Edge-Dependent Vertex Weights
Yu Zhu, Santiago Segarra
We develop a framework for incorporating edge-dependent vertex weights (EDVWs) into the hypergraph minimum s-t cut problem. These weights are able to reflect different importance o…
Estimating Network Processes via Blind Identification of Multiple Graph Filters
Yu Zhu, Fernando J. Iglesias, Antonio G. Marques +1
This paper studies the problem of jointly estimating multiple network processes driven by a common unknown input, thus effectively generalizing the classical blind multi-channel id…
Network Inference from Consensus Dynamics with Unknown Parameters
Yu Zhu, Michael T. Schaub, Ali Jadbabaie +1
We explore the problem of inferring the graph Laplacian of a weighted, undirected network from snapshots of a single or multiple discrete-time consensus dynamics, subject to parame…