Stefan Steinerberger

Orcid: 0000-0002-7745-4217

Affiliations:
  • University of Washington, Department of Mathematics, Seattle, WA, USA
  • Yale University, New Haven, CT, USA


According to our database1, Stefan Steinerberger authored at least 68 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Conformally rigid graphs.
CoRR, 2024

2023
Free Convolution Powers Via Roots of Polynomials.
Exp. Math., October, 2023

The boundary of a graph and its isoperimetric inequality.
Discret. Appl. Math., October, 2023

Approximate Solutions of Linear Systems at a Universal Rate.
SIAM J. Matrix Anal. Appl., September, 2023

Guessing cards with complete feedback.
Adv. Appl. Math., September, 2023

Curvature on graphs via equilibrium measures.
J. Graph Theory, July, 2023

Max-Cut via Kuramoto-Type Oscillators.
SIAM J. Appl. Dyn. Syst., June, 2023

An elementary proof of a lower bound for the inverse of the star discrepancy.
J. Complex., April, 2023

A Common Variable Minimax Theorem for Graphs.
Found. Comput. Math., April, 2023

The first eigenvector of a distance matrix is nearly constant.
Discret. Math., April, 2023

The product of two high-frequency Graph Laplacian eigenfunctions is smooth.
Discret. Math., 2023

Spectrahedral Geometry of Graph Sparsifiers.
CoRR, 2023

2022
Refined least squares for support recovery.
Signal Process., 2022

Dimensionality Reduction via Dynamical Systems: The Case of t-SNE.
SIAM Rev., 2022

How well-conditioned can the eigenvector problem be?
Math. Comput., 2022

Fast Localization of Eigenfunctions via Smoothed Potentials.
J. Sci. Comput., 2022

Magnetic Schrödinger operators and landscape functions.
CoRR, 2022

Random Walks, Equidistribution and Graphical Designs.
CoRR, 2022

Sums of Distances on Graphs and Embeddings into Euclidean Space.
CoRR, 2022

May the force be with you.
Proceedings of the 58th Annual Allerton Conference on Communication, 2022

2021
Randomly aggregated least squares for support recovery.
Signal Process., 2021

Randomized Kaczmarz Converges Along Small Singular Vectors.
SIAM J. Matrix Anal. Appl., 2021

A weighted randomized Kaczmarz method for solving linear systems.
Math. Comput., 2021

On the Dual Geometry of Laplacian Eigenfunctions.
Exp. Math., 2021

Fundamental component enhancement via adaptive nonlinear activation functions.
CoRR, 2021

Quantile-Based Random Kaczmarz for corrupted linear systems of equations.
CoRR, 2021

How well-conditioned can the eigenvalue problem be?
CoRR, 2021

A 0.502·MaxCut Approximation using Quadratic Programming.
CoRR, 2021

t-SNE, Forceful Colorings and Mean Field Limits.
CoRR, 2021

2020
The Best Way to Reconcile Your Past Is Exponentially.
Am. Math. Mon., 2020

Transport and Interface: An Uncertainty Principle for the Wasserstein Distance.
SIAM J. Math. Anal., 2020

Numerical integration on graphs: Where to sample and how to weigh.
Math. Comput., 2020

Generalized designs on graphs: Sampling, spectra, symmetries.
J. Graph Theory, 2020

Positive-Definite Functions, Exponential Sums and the Greedy Algorithm: a Curious Phenomenon.
J. Complex., 2020

Randomized near-neighbor graphs, giant components and applications in data science.
J. Appl. Probab., 2020

The Spectral Underpinning of word2vec.
Frontiers Appl. Math. Stat., 2020

Neural Collapse with Cross-Entropy Loss.
CoRR, 2020

Surrounding the solution of a Linear System of Equations from all sides.
CoRR, 2020

Stochastic Gradient Descent applied to Least Squares regularizes in Sobolev spaces.
CoRR, 2020

A Spectral Approach to the Shortest Path Problem.
CoRR, 2020

Spectral Clustering Revisited: Information Hidden in the Fiedler Vector.
CoRR, 2020

Regularized Potentials of Schrödinger Operators and a Local Landscape Function.
CoRR, 2020

Non-Convex Planar Harmonic Maps.
CoRR, 2020

2019
Clustering with t-SNE, Provably.
SIAM J. Math. Data Sci., 2019

Recovering Trees with Convex Clustering.
SIAM J. Math. Data Sci., 2019

A nonlocal functional promoting low-discrepancy point sets.
J. Complex., 2019

On Algorithms to Calculate Integer Complexity.
Integers, 2019

Extreme Values of the Fiedler Vector on Trees.
CoRR, 2019

On the Wasserstein Distance between Classical Sequences and the Lebesgue Measure.
CoRR, 2019

Heavy-Tailed Kernels Reveal a Finer Cluster Structure in t-SNE Visualisations.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

2018
Ulam Sequences and Ulam Sets.
Integers, 2018

Well-Distributed Great Circles on S<sup>2</sup>.
Discret. Comput. Geom., 2018

The Aesthetics of Mathematical Explanations.
Proceedings of the 40th Annual Meeting of the Cognitive Science Society, 2018

2017
Carrier Frequencies, Holomorphy, and Unwinding.
SIAM J. Math. Anal., 2017

A Hidden Signal in the Ulam Sequence.
Exp. Math., 2017

Efficient Algorithms for t-distributed Stochastic Neighborhood Embedding.
CoRR, 2017

Randomized Near Neighbor Graphs, Giant Components, and Applications in Data Science.
CoRR, 2017

Stability, Fairness and Random Walks in the Bargaining Problem.
CoRR, 2017

2016
On the discrepancy of jittered sampling.
J. Complex., 2016

2015
A remark on the numerical integration of harmonic functions in the plane.
J. Complex., 2015

On the number of positions in chess without promotion.
Int. J. Game Theory, 2015

2014
A filtering technique for Markov chains with applications to spectral embedding.
CoRR, 2014

A Remark on Disk Packings and Numerical Integration of Harmonic Functions.
CoRR, 2014

A short note on integer complexity.
Contributions Discret. Math., 2014

2012
Random restricted matching and lower bounds for combinatorial optimization.
J. Comb. Optim., 2012

2010
A new lower bound for the geometric traveling salesman problem in terms of discrepancy.
Oper. Res. Lett., 2010

A note on the number of different inner products generated by a finite set of vectors.
Discret. Math., 2010

The Asymptotic Behavior of the Average <i>L<sup>p</sup></i>-Discrepancies and a Randomized Discrepancy.
Electron. J. Comb., 2010


  Loading...