We prove tight mixing time bounds for natural random walks on bases of matroids,
determinantal distributions, and more generally distributions associated with log-concave …

We introduce a versatile technique called spectral independence for the analysis of Markov
chain Monte Carlo algorithms in high-dimensional probability and statistics. We rigorously …

The minimum spanning tree problem in graphs under budget-type degree constraints
(DCMST) is a well-known NP-hard problem. Spanning trees do not always exist, and the …

The Sweeny algorithm for the Q-state random-cluster model in two dimensions is shown to
exhibit a rich mixture of critical dynamical scaling behaviors. As Q decreases, the so-called …

We consider the challenge of implementing the link‐cut tree data structure. This data
structure is well known and has had a wide impact on several theoretical results. However …

An extensive range of problems in machine learning deals with data structured over
networks/graphs. The examples vary from drug discovery to traffic forecasting, social …

Resumé Un large éventail de problèmes d'apprentissage automatique traite des données
structurées sur des réseaux/graphes. Les exemples vont de la découverte de médicaments …

If we carefully observe our daily lives and the systems in which we participate, we naturally
perceive that everything is somehow connected. From species evolution to social relations …

algorithms Page 1 algorithms Editorial Editorial: Special Issue on Efficient Data Structures
Jesper Jansson Department of Computing, The Hong Kong Polytechnic University, Hung …