An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs
From MaRDI portal
Publication:6130647
DOI10.1137/23m1553790arXiv2212.12839OpenAlexW4392163651MaRDI QIDQ6130647
Braxton Osting, Zachary M. Boyd, Jeremy L. Marzuola, Peter J. Mucha, Nicolas Fraiman
Publication date: 3 April 2024
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.12839
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Continuum limit of total variation on point clouds
- A testing based extraction algorithm for identifying significant communities in networks
- Clustering and community detection in directed networks: a survey
- A variational approach to the consistency of spectral clustering
- An existence result for a class of shape optimization problems
- Auction dynamics: a volume constrained MBO scheme
- A diffusion generated method for computing Dirichlet partitions
- Mean curvature, threshold dynamics, and phase field theory on finite graphs
- PageRank Beyond the Web
- Consistency of Cheeger and Ratio Graph Cuts
- Detecting high log-densities
- $O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Finding Dense Subgraphs with Size Bounds
- Communities in Networks
- Consistency of Dirichlet Partitions
- Spectral convergence of the connection Laplacian from random samples
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities
- A continuum limit for the PageRank algorithm
- Stratification as a General Variance Reduction Method for Markov Chain Monte Carlo
- Graph Merriman--Bence--Osher as a SemiDiscrete Implicit Euler Scheme for Graph Allen--Cahn Flow
- Stochastic Processes and Applications
- Sharp Entrywise Perturbation Bounds for Markov Chains
- Local Partitioning for Directed Graphs Using PageRank
- Regularity of optimal shapes for the Dirichlet's energy with volume constraint
- Optimal Rate of Convergence of the Bence--Merriman--Osher Algorithm for Motion by Mean Curvature
- Convergence of an Algorithm for the Anisotropic and Crystalline Mean Curvature Flow
- Expander flows, geometric embeddings and graph partitioning
- Graph partitioning using single commodity flows
- The dense \(k\)-subgraph problem
This page was built for publication: An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs
