Tony Savostianov
@antsav.me
Applied Math Researcher
RWTH Aachen Computational Network Science
Network analysis, numerical methods, complex systems, solar activity
https://antsav.me
Mastodon: http://mathstodon.xyz/@mryodo
RWTH Aachen Computational Network Science
Network analysis, numerical methods, complex systems, solar activity
https://antsav.me
Mastodon: http://mathstodon.xyz/@mryodo
i finally get to share this thing we have been working on for a year!
basically, if you want a sparser simplicial complex and keep Hodge Laplacians close, you can subsample simplices from an easily obtainable (well, now 😉) measure (i.e. Spielmann sparsification)
#NetSci #mlsky
basically, if you want a sparser simplicial complex and keep Hodge Laplacians close, you can subsample simplices from an easily obtainable (well, now 😉) measure (i.e. Spielmann sparsification)
#NetSci #mlsky
February 15, 2025 at 9:47 AM
As a result, you can look how different choices of shift operators and random graph models affect convergence (in terms of the singular value and the actual rate) which is at least exponential
Enjoy!
Enjoy!
January 29, 2025 at 12:39 PM
As a result, you can look how different choices of shift operators and random graph models affect convergence (in terms of the singular value and the actual rate) which is at least exponential
Enjoy!
Enjoy!
We show that the convergence rate is governed by the smallest possible singular value of a minor of the composite graph matrix defined by the labeled set. The size of the labeled set then controls the convergence rate (with the dip at the num. of node features)
And you can formally show all this!
And you can formally show all this!
January 29, 2025 at 12:39 PM
We show that the convergence rate is governed by the smallest possible singular value of a minor of the composite graph matrix defined by the labeled set. The size of the labeled set then controls the convergence rate (with the dip at the num. of node features)
And you can formally show all this!
And you can formally show all this!