Search Results for author:
Found 6 papers, 5 papers with code
Dominant Z-Eigenpairs of Tensor Kronecker Products are Decoupled and Applications to Higher-Order Graph Matching
This theorem implies low rank structure ought to be present in the iterates of tensor power methods on Kronecker products.
Flow-Based Local Graph Clustering with Better Seed Set Inclusion
Our first contribution is a generalized objective function that allows practitioners to place strict and soft penalties on excluding specific seed nodes from the output set.
Social and Information Networks Data Structures and Algorithms
A Projection Method for Metric-Constrained Optimization
We outline a new approach for solving optimization problems which enforce triangle inequalities on output variables.
Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering
Graph clustering, or community detection, is the task of identifying groups of closely related objects in a large network.
Data Structures and Algorithms Social and Information Networks
Retrospective Higher-Order Markov Processes for User Trails
In this paper we propose the retrospective higher-order Markov process (RHOMP) as a low-parameter model for such sequences.
Neighborhoods are good communities
The communities of a social network are sets of vertices with more connections inside the set than outside.
Social and Information Networks Discrete Mathematics Data Structures and Algorithms Physics and Society
