Searcharxiv⌕ Search

arXiv subjects

A. Thompson

Publications and source records attributed to A. Thompson.

20 records · Page 2Linked to original sources

Self-organizing Knotted Magnetic Structures in Plasma

We perform full-MHD simulations on various initially helical configurations and show that they reconfigure into a state where the magnetic field lines span nested toroidal surfaces. This relaxed configuration is not a Taylor state, as is often assumed for relaxing plasma, but a state where the Lorentz force is balanced by the hydrostatic pressure, which is lowest on the central ring of the nested tori. Furthermore, the structure is characterized by a spatially slowly varying rotational transform, which leads to the formation of a few magnetic islands at rational surfaces. We then obtain analytic expressions that approximate the global structure of the quasi-stable linked and knotted plasma configurations that emerge, using maps from $S^3$ to $S^2$ of which the Hopf fibration is a special case. The knotted plasma configurations have a highly localized magnetic energy density and retain their structure on time scales much longer than the Alfvenic time scale.

physics.plasm-ph↗

Spectral Clustering: An empirical study of Approximation Algorithms and its Application to the Attrition Problem

Clustering is the problem of separating a set of objects into groups (called clusters) so that objects within the same cluster are more similar to each other than to those in different clusters. Spectral clustering is a now well-known method for clustering which utilizes the spectrum of the data similarity matrix to perform this separation. Since the method relies on solving an eigenvector problem, it is computationally expensive for large datasets. To overcome this constraint, approximation methods have been developed which aim to reduce running time while maintaining accurate classification. In this article, we summarize and experimentally evaluate several approximation methods for spectral clustering. From an applications standpoint, we employ spectral clustering to solve the so-called attrition problem, where one aims to identify from a set of employees those who are likely to voluntarily leave the company from those who are not. Our study sheds light on the empirical performance of existing approximate spectral clustering methods and shows the applicability of these methods in an important business optimization related problem.

cs.LG↗