Sawyer Jack Robertson

According to our database, Sawyer Jack Robertson authored at least 5 papers between 2024 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

Robust Graph-Based Semi-Supervised Learning via <i>p</i>-Conductances.

Sawyer Jack Robertson, Chester Holtz, Zhengchao Wan, Gal Mishne, Alexander Cloninger

CoRR, February, 2025

On a Generalization of Wasserstein Distance and the Beckmann Problem to Connection Graphs.

Sawyer Jack Robertson, Dhruv Kohli, Gal Mishne, Alexander Cloninger

SIAM J. Sci. Comput., 2025

2024

Random Walks, Conductance, and Resistance for the Connection Graph Laplacian.

Alexander Cloninger, Gal Mishne, Andreas Oslandsbotn, Sawyer Jack Robertson, Zhengchao Wan, Yusu Wang

SIAM J. Matrix Anal. Appl., 2024

Matrix Concentration for Random Signed Graphs and Community Recovery in the Signed Stochastic Block Model.

Sawyer Jack Robertson

CoRR, 2024

All You Need is Resistance: On the Equivalence of Effective Resistance and Certain Optimal Transport Problems on Graphs.

Sawyer Jack Robertson, Zhengchao Wan, Alexander Cloninger

CoRR, 2024