activity
20212026
most citedRelaxation shortcuts through boundary coupling

52 citations · 126 across the 5 of their papers we have counts for

collaborators

6 papers

cs.SD2026

SEA-HELM Audio: Evaluating Multilingual ASR-LLM Pipeline Performance Across SEA-HELM Subsets

Yixian Tan, Aulia Adila, Jonathan Heng +3

We introduce SEA-HELM Audio, a Southeast Asian (SEA) multilingual evaluation framework that extends the text-based SEA-HELM benchmark to assess performance degradation in cascaded…

cond-mat.soft2023★ 22 cited

Metastability of Discrete-Symmetry Flocks

Brieuc Benvegnen, Omer Granek, Sunghan Ro +6

We study the stability of the ordered phase of flocking models with a scalar order parameter. Using both the active Ising model and a hydrodynamic description, we show that droplet…

cond-mat.stat-mech2022★ 39 cited

Eigenvalue crossing as a phase transition in relaxation dynamics

Gianluca Teza, Ran Yaacoby, Oren Raz

When a system's parameter is abruptly changed, a relaxation towards the new equilibrium of the system follows. We show that a crossing between the second and third eigenvalues of t…

cond-mat.stat-mech2022★ 2 cited

Far from equilibrium relaxation in the weak coupling limit

Ran Yaacoby, Oren Raz, Gianluca Teza

It is commonly assumed that a large system, weakly coupled to a thermal environment through its boundaries, relaxes quasistatically towards the new equilibrium even when the temper…

cond-mat.stat-mech2021★ 52 cited

Relaxation shortcuts through boundary coupling

Gianluca Teza, Ran Yaacoby, Oren Raz

When a hot system cools down faster than an equivalent cold one, it exhibits the Mpemba Effect. This counterintuitive phenomenon was observed in several systems including water, ma…

cond-mat.dis-nn2021★ 11 cited

A comparison between D-wave and a classical approximation algorithm and a heuristic for computing the ground state of an Ising spin glass

Ran Yaacoby, Nathan Schaar, Leon Kellerhals +3

Finding the ground state of an Ising-spin glass on general graphs belongs to the class of NP-hard problems, widely believed to have no efficient polynomial-time algorithms for solv…