More Like this

1. Lipid-driven condensation and interfacial ordering of FUS

   https://doi.org/10.1126/sciadv.abm7528  

   Chatterjee, Sayantan; Maltseva, Daria; Kan, Yelena; Hosseini, Elnaz; Gonella, Grazia; Bonn, Mischa; Parekh, Sapun H. (August 2022, Science Advances)

   Disordered protein condensation is highly sensitive to nonspecific protein-lipid interactions. 

   more » « less
2. Adjacencies on random ordering polytopes and flow polytopes

   https://doi.org/10.1016/j.jmp.2023.102768  

   Doignon, Jean-Paul; Saito, Kota (June 2023, Journal of Mathematical Psychology)
3. Dynamic polymers: invariant measures and ordering by noise

   https://doi.org/10.1007/s00440-021-01099-5  

   Bakhtin, Yuri; Chen, Hong-Bin (June 2022, Probability Theory and Related Fields)
4. Incremental Topological Ordering and Cycle Detection with Predictions

   McCauley, S; Moseley, B; Niaparast, A; Singh, S (July 2024, Icml)
5. Incremental topological ordering and cycle detection with predictions

   Mccauley, Samuel; Moseley, Benjamin; Niaparast, Aidin; Singh, Shikha (January 2025, PMLR)

   Salakhutdinov, Ruslan; Kolter, Zico; Heller, Katherine; Weller, Adrian; Oliver, Nuria; Scarlett, Jonathan; Berkenkamp, Felix (Ed.)

   This paper leverages the framework of algorithms-with-predictions to design data structures for two fundamental dynamic graph problems: incremental topological ordering and cycle detection. In these problems, the input is a directed graph on n nodes, and the m edges arrive one by one. The data structure must maintain a topological ordering of the vertices at all times and detect if the newly inserted edge creates a cycle. The theoretically best worst-case algorithms for these problems have high update cost (polynomial in n and m). In practice, greedy heuristics (that recompute the solution from scratch each time) perform well but can have high update cost in the worst case. In this paper, we bridge this gap by leveraging predictions to design a learned new data structure for the problems. Our data structure guarantees consistency, robustness, and smoothness with respect to predictions--that is, it has the best possible running time under perfect predictions, never performs worse than the best-known worst-case methods, and its running time degrades smoothly with the prediction error. Moreover, we demonstrate empirically that predictions, learned from a very small training dataset, are sufficient to provide significant speed-ups on real datasets. 

   more » « less