betaFeedback

WorksPhysics and Astronomy

Temporal Correlations and Optimal Feedback Control of an Active Information Engine

Abstract

How much does a feedback controller need to know about the fluctuations it exploits? We address this question using a macroscopic information engine driven by self-propelled bristle-robots. Experimentally measured occupancy time series show that temporal correlations strongly affect vacancy detection. At short measurement intervals, mean first-passage times exceed independent-measurement predictions by more than an order of magnitude. A first-order Markov approximation captures much of this effect. It does not reproduce the full first-passage distribution, revealing higher-order temporal memory. Nevertheless, Markov-selected protocols come within 0.15% of the maximum experimental power. Neglecting correlations causes power losses of several percent and favors larger compression distances. Introducing a sensing cost shifts the optimal strategy toward sparse sensing. The independent model cannot predict this shift, whereas the Markov model captures it. Cross-validation on separate time segments confirms the near-optimal performance of Markov-selected protocols. These findings demonstrate that near-optimal feedback control in correlated nonequilibrium systems can require a simpler statistical description than predicting their full temporal dynamics.

Introduction

Information engines use measurements and feedback to exploit fluctuations and extract work. Originating from the thought experiments of Maxwell’s demon[1] and Sziĺard’s engine[2, 3], these machines demonstrate that information acquired through measurement can serve as a thermodynamic resource. Information engines exploit this principle, using feedback loops to rectify fluctuations and extract work, with the amount of extractable work bounded by the information gained[4, 5, 6]. In recent years, advances in experimental techniques have enabled experimental realizations of information engines in a wide range of platforms[7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17] under increasingly realistic conditions.

In many information engines, feedback is applied conditionally, depending on the outcome of a measurement[7]. Rather than acting on every observed microstate, the engine waits for a favorable fluctuation before it extracts or stores work. The performance of such engines therefore depends not only on the work extracted per successful action, but also on how frequently these favorable fluctuations can be detected. A natural measure of performance is the mean extracted power, which involves a trade-off between the work extracted in each successful cycle and the time required to complete that cycle. This trade-off becomes more intricate when the cost associated with acquiring and processing information is considered. Beyond the fundamental thermodynamic cost of information erasure[18, 19], the energetic expenditures associated with sensing, processing, and feedback can influence the optimal operation of information engines. The resulting trade-off between detection time and measurement cost makes the measurement interval an important control parameter. Optimizing finite-time performance therefore requires understanding the temporal statistics of favorable fluctuations.

The first-passage time to a favorable fluctuation depends strongly on correlations between successive measurements. When the measurement interval exceeds the characteristic decorrelation time of the system, successive outcomes may be treated as approximately independent. In this limit, the number of attempts required to observe a favorable fluctuation follows a geometric distribution, yielding a mean waiting time

⟨TFP⟩ind=τmp1,(1)\langle T_{\mathrm{FP}}\rangle_{\mathrm{ind}} = \frac{\tau_m}{p_1}, \tag*{(1)}

where τm\tau_m is the measurement interval and p1p_1 is the stationary probability of a successful measurement[9, 12]. Measurements are performed at times τm\tau_m, 2τm2\tau_m, …\ldots, with the waiting time obtained from the beginning of the observation process. In systems with persistent dynamics, however, consecutive measurements are correlated with previous outcomes[8, 20]. A sequence of unsuccessful measurements may therefore persist much longer than predicted by the independent-measurement approximation, even when the stationary success probability is unchanged. The waiting-time statistics depend not only on how often favorable fluctuations occur, but also on how they are organized in time. This raises a central question: Do prediction and optimal feedback require the same knowledge of temporal correlations?

Recent work has addressed related aspects of this problem. Costly measurements can produce nontrivial measurement schedules in mesoscopic information engines[21]. Experiments in non-Markovian environments have also shown that hidden environmental memory can be accessed and converted into additional work[22]. Here we ask a complementary question: how much of the temporal structure of a correlated active bath must a controller retain to choose a near-optimal feedback protocol?

Active matter provides a natural platform for studying temporal correlations in feedback-driven engines. Unlike passive particles governed by thermal fluctuations, active particles continuously consume energy to sustain their motion, driving the system out of equilibrium[23] and producing rich phenomena such as flocking[24, 25], motility-induced phase separation[26, 27], and giant number fluctuations[10, 28]. These nonequilibrium dynamics challenge conventional thermodynamic descriptions[29] and generate nontrivial spatial and temporal statistics. In particular, the persistence of self-propelled motion introduces memory that can extend over timescales comparable to, or longer than, the interval between measurements τm\tau_m. Under confinement, persistent particles tend to accumulate near boundaries, where they remain until their orientation changes sufficiently to allow them to escape[30, 31]. This leads to strongly inhomogeneous spatial distributions, with boundary accumulation shaping both the spatial and temporal characteristics of fluctuations in the active gas[9]. In active systems, the continuous energy consumption required to sustain particle motion is typically treated as a given, with housekeeping dissipation excluded from the effective work balance. Measurement-based feedback enables the extraction of useful work from this continuous energy input.

In a recent study, we introduced a macroscopic piston-like information engine containing a gas of self-propelled bristle-robots[9]. The engine periodically measures whether a region of width Δx\Delta x next to the piston is empty. If the region is empty, with probability p1(Δx)p_1(\Delta x), the piston advances by Δx\Delta x at no work cost. This compresses the gas and stores energy that can later be extracted during expansion. If the region is occupied, the piston remains stationary until a favorable fluctuation is detected. Our previous work showed that boundary accumulation changes the probability of these fluctuations and shifts the optimal operating protocol.

Here, we extend this picture to the temporal domain and ask how much temporal information is needed for effective control. Experimentally measured vacancy fluctuations reveal first-passage statistics that deviate strongly from independent-measurement predictions and are not fully captured by a first-order Markov approximation. This reduced description still selects protocols that achieve nearly the maximum experimentally attainable power. With a finite cost per measurement, the optimum shifts from frequent to sparse sensing, and the first-order Markov approximation remains nearly optimal when tested on independent segments of the data. Our

results show that higher-order memory is important for predicting the full first-passage dynamics, while a simpler one-step description can be sufficient for near-optimal fixed-interval feedback control.

Experimental System and Measurement Protocol

We consider the macroscopic piston-like information engine introduced in Ref.[9], consisting of a two-dimensional gas of self-propelled bristle-robots (Hexbug nano®) confined within an arena by rigid walls and a movable piston Figure 1(a). The particles are driven by internal rotation motors, generating persistent chiral motion. The experimental apparatus and particle dynamics are described in detail in Ref.[9], while the experimental parameters and trajectory-processing procedures relevant to the present analysis are summarized in Appendix A. The engine protocol is shown in Figure 1(a). Measurements are performed at regular intervals τm\tau_m, and a successful vacancy detection triggers a piston displacement Δx\Delta x. The piston then expands under the pressure of the active gas and returns to its initial position. The two con-

Figure 1. (a) Schematic of the operation protocol of the piston-like information engine containing self-propelled bristle-robots. (i) The engine monitors a region of width Δx\Delta x adjacent to the piston. (ii) Measurements are repeated until the monitored region is empty, allowing the piston to (iii) advance by Δx\Delta x without directly pushing the particles. (b) Representative binary signals A(t)A(t) for three normalized compression widths, δx=Δx/L\delta x=\Delta x/L, at fixed particle density Φ=0.053\Phi=0.053. The signal takes the value A=1A=1 when the monitored region is empty and A=0A=0 otherwise. (c) Normalized conditional transition probability p0→1(τ)/p1p_{0\to1}(\tau)/p_1 as a function of the time interval τ\tau between measurements, for three packing fractions Φ\Phi at fixed compression width δx=0.398\delta x=0.398. Here, p0→1(τ)p_{0\to1}(\tau) is the probability of observing an empty region after an occupied observation, and p1p_1 is the stationary empty-region probability. The dashed horizontal line indicates the independent-measurement limit, p0→1/p1=1p_{0\to1}/p_1=1.

trol parameters are therefore the compression distance Δx\Delta x and the measurement interval τm\tau_m.

In the present study, we evaluate feedback protocols retrospectively using experimentally recorded particle trajectories. The extracted first-passage statistics are combined with independently characterized piston expansion dynamics to calculate the expected cycle duration and power output for each protocol.

To characterize the measurement outcomes, we construct a binary occupancy signal A(t,Δx)A(t,\Delta x) from the experimentally recorded particle trajectories, defined as

A(t,Δx)={1if the monitored region is empty,0otherwise.(2)A(t,\Delta x)= \begin{cases} 1 & \text{if the monitored region is empty},\\ 0 & \text{otherwise}. \end{cases} \tag*{(2)}

The stationary probability of a successful measurement is then given by

p1(Δx)=⟨A(t,Δx)⟩t,(3)p_1(\Delta x)=\langle A(t,\Delta x)\rangle_t, \tag*{(3)}

where ⟨⋅⟩t\langle\cdot\rangle_t denotes a time average. Representative occupancy signals for three normalized compression widths, δx=Δx/Lx\delta x=\Delta x/L_x, are shown in Figure 1(b), where LxL_x is the initial length of the arena. As the monitored region (Δx\Delta x) increases in size, empty-region events become less frequent, while occupied intervals generally become longer. Although p1p_1 determines the fraction of successful measurements, it does not describe how these events are distributed in time. Consequently, occupancy signals with the same stationary probability may exhibit substantially different waiting-time statistics.

To quantify correlations between successive measurements, we consider the conditional transition probability

p0→1(τ,Δx)=P[A(t+τ,Δx)=1∣A(t,Δx)=0].p_{0\to1}(\tau,\Delta x)=P[A(t+\tau,\Delta x)=1\mid A(t,\Delta x)=0].

It gives the probability of finding the monitored region empty after a delay τ\tau, given that it was occupied initially. For independent measurements, p0→1=p1p_{0\to1}=p_1. More generally, this transition probability is related to the normalized autocorrelation function through

p0→1(τ,Δx)p1(Δx)=1−CA(τ,Δx).\frac{p_{0\to1}(\tau,\Delta x)}{p_1(\Delta x)}=1-C_A(\tau,\Delta x).

Figure 1(c) shows that this ratio is strongly suppressed at short times, reflecting the persistence of occupied states. It approaches unity as temporal correlations decay. These correlations have direct consequences for engine operation, because the piston advances only upon detecting an empty region; the sequence of measurement outcomes governs the waiting time for a successful feedback step. This waiting time contributes to the total cycle duration and therefore affects the extracted power. To characterize it, we turn to the first-passage statistics of the occupancy signal, which describe the time until the first successful measurement.

Temporal Correlations Control First-Passage Statistics

The finite-time operation of the engine is governed by the time required to detect an empty region and perform a successful feedback step. To characterize this waiting time, we consider the first-passage statistics of the occupancy signal A(t,Δx)A(t,\Delta x), sampled at discrete intervals τm\tau_m. Starting from an occupied region, A(0)=0A(0)=0, we define the first-passage time TFPT_{\mathrm{FP}} as the time elapsed until the first subsequent successful measurement, A=1A=1. The corresponding survival probability is defined as

S(t)=P(TFP>t∣A(0)=0),(4)S(t)=P(T_{\mathrm{FP}}>t\mid A(0)=0), \tag*{(4)}

representing the probability that no successful measurement has occurred by time tt. Since measurements are performed at discrete intervals τm\tau_m, the first-passage time takes values TFP=nτmT_{\mathrm{FP}}=n\tau_m, where n=1,2,…n=1,2,\ldots. Its mean is related to the survival probability through

⟨TFP⟩=τm∑n=0∞S(nτm).(5)\langle T_{\mathrm{FP}}\rangle=\tau_m\sum_{n=0}^{\infty}S(n\tau_m). \tag*{(5)}

Both quantities are extracted directly from the experimental occupancy time series, without assuming independent measurement outcomes. First-passage starting points are separated sufficiently in time to ensure that the resulting samples are statistically independent.

We first consider the limit of statistically independent measurements, where each observation has a probability p1p_1 of detecting an empty region, regardless of previous outcomes. Since each measurement is independent, the survival probability after nn unsuccessful attempts is given by

Sind(nτm)=(1−p1)n.(6)S_{\mathrm{ind}}(n\tau_m)=(1-p_1)^n. \tag*{(6)}

Substituting this expression into Eq. (5) recovers the independent mean waiting time introduced in Eq. (1): ⟨TFP⟩ind=τm/p1\langle T_{\mathrm{FP}}\rangle_{\mathrm{ind}}=\tau_m/p_1. This result provides a baseline for quantifying the effects of temporal correlations on the engine’s waiting-time statistics.

To account for temporal correlations, we next consider a first-order Markov approximation, in which the probability of each measurement outcome depends only on the immediately preceding observation. Within this description, the probability of detecting an empty region following an unsuccessful measurement is given by the experimentally determined transition probability p0→1(τm)p_{0\to1}(\tau_m). Since each unsuccessful measurement leaves the engine in the occupied state, the survival probability after nn consecutive attempts becomes

SM(nτm)=[1−p0→1(τm)]n.(7)S_{\mathrm{M}}(n\tau_m)=[1-p_{0\to1}(\tau_m)]^n. \tag*{(7)}

The corresponding mean first-passage time is

⟨TFP⟩M=τmp0→1(τm).(8)\langle T_{\mathrm{FP}}\rangle_{\mathrm{M}}=\frac{\tau_m}{p_{0\to1}(\tau_m)}. \tag*{(8)}

mean first-passage times for several packing fractions Φ\Phi. At short measurement intervals, this ratio exceeds unity by more than an order of magnitude, demonstrating the substantial waiting-time penalty associated with correlated sampling. Figure 2(d) further reveals the limitations of the Markov approximation: the increasing ratio Sexp⁡(t)/SM(t)S_{\exp}(t)/S_M(t) indicates that long occupied intervals persist more frequently than predicted, particularly at smaller compression distances. This behavior is consistent with persistent boundary accumulation, where particles may remain trapped against the piston until their orientations allow escape{sup}31`. Since the binary occupancy signal does not resolve particle orientations or configurations, these hidden degrees of freedom can generate memory beyond the most recent measurement, providing a physical interpretation of the observed higher-order temporal dependencies.

Unlike the independent approximation, this model accounts for the persistence of occupied states through their measured transition probability. However, it assumes that the probability of detecting an empty region is independent of how many consecutive unsuccessful measurements have preceded it. Deviations between the Markov prediction and experimental first-passage statistics therefore reveal temporal dependencies extending beyond the most recent observation.

Figure 2(a) compares the experimental first-passage survival probability with the independent and first-order Markov predictions. The independent approximation substantially underestimates the survival probability. The first-order Markov approximation captures the overall decay but deviates at longer times. The same pattern appears in the mean first-passage time [Figure 2(b)]: the independent approximation predicts much shorter waiting times at small measurement intervals, while the first-order Markov prediction remains considerably closer to the experimental values. As τm\tau_m increases, both approximations converge toward the experimental results, consistent with the decay of temporal correlations. The magnitude of these correlation effects is quantified in Figure 2(c) through the ratio of empirical to independent

Figure 2. (a) Representative first-passage survival probability S(t)S(t), giving the probability of observing no empty-region states up to time tt, given that the region was initially occupied. Experimental results (pink circles) are compared with the independent-measurement approximation (orange dashed line) and the first-order Markov model (blue solid line) for Φ=0.053\Phi= 0.053, δx=0.398\delta x = 0.398, and τm=1/30\tau_m = 1/30 s. (b) Mean first-passage time ⟨TFP⟩\langle T_{FP}\rangle as a function of the measurement interval τm\tau_m, comparing experimental measurements with the same two statistical models as panel (a). (c) Ratio of experimental to independent mean first-passage times, ⟨TFP⟩exp⁡/⟨TFP⟩ind\langle T_{FP}\rangle_{\exp}/\langle T_{FP}\rangle_{\mathrm{ind}}, for three packing fractions Φ\Phi, at fixed compression width δx=0.398\delta x = 0.398. The dashed horizontal line denotes the independent limit, ⟨TFP⟩exp⁡/⟨TFP⟩ind=1\langle T_{FP}\rangle_{\exp}/\langle T_{FP}\rangle_{\mathrm{ind}} = 1. (d) Ratio of experimental to Markov survival probabilities, Sexp⁡(t)/SM(t)S_{\exp}(t)/S_M(t), for two normalized compression widths, at fixed packing fraction Φ=0.053\Phi= 0.053 and measurement interval τm=0.2\tau_m = 0.2 s. The dashed line denotes exact agreement with the Markov prediction.

TEMPORAL CORRELATIONS SHIFT THE OPTIMAL ENGINE PROTOCOL

We now examine how temporal correlations affect the engine power and optimal protocol. Each cycle consists of repeated measurements until an empty region is detected [Figure 3(a)]. The piston then advances by Δx\Delta x and expands back to its initial position. We assume that the active gas has relaxed to its stationary state before each new cycle. The first measurement therefore succeeds with probability p1(Δx)p_1(\Delta x). If it fails, the cycle includes an additional mean waiting time ⟨TFP⟩\langle T_{FP}\rangle. The mean cycle duration is

Figure 3. (a) Schematic of an engine cycle, showing repeated measurements at intervals τm\tau_m until the monitored region is found empty. A successful measurement triggers an instantaneous piston displacement Δx\Delta x, followed by expansion toward its initial position. (b) Experimental power landscape P/FP/F as a function of normalized compression width and measurement interval τm\tau_m, at fixed packing fraction Φ=0.053\Phi= 0.053. Here, FF is the force opposing piston expansion. (c) Power as a function of δx\delta x at fixed Φ=0.053\Phi= 0.053 and τm=1/30\tau_m = 1/30 s, comparing experimental first-passage statistics (pink) with the first-order Markov (blue) and independent-measurement (orange dashed) predictions. Symbols indicate the corresponding optimal compression widths. (d) Optimal normalized compression width δx∗\delta x^* as a function of packing fraction Φ\Phi, obtained by maximizing the power over compression width and measurement interval for each model. (e) Predicted power loss resulting from operating at the protocols selected by the independent and Markov models, relative to the experimentally optimized protocol. Neglecting temporal correlations produces power losses of several percent, whereas the Markov-selected protocols retain nearly all the experimentally achievable power, with losses not exceeding 0.15%.

⟨Tcycle⟩=τm+[1−p1(Δx)]⟨TFP⟩+texp⁡(Δx).(9)\langle T_{\mathrm{cycle}}\rangle= \tau_m + [1-p_1(\Delta x)]\langle T_{FP}\rangle+ t_{\exp}(\Delta x). \tag*{(9)}

The expansion time texp⁡(Δx)t_{\exp}(\Delta x) is obtained from independent measurements of the piston dynamics reported in Ref. [9]. The piston expansion time is much longer than the measured occupancy correlation time, so the active gas effectively relaxes before the next cycle begins. The mean piston displacement follows ⟨ΔX(t)⟩=ΔXmax⁡(1−e−t/τexp⁡(0))\langle\Delta X(t)\rangle= \Delta X_{\max}(1-e^{-t/\tau_{\exp}^{(0)}}), with ΔXmax⁡=42.10±0.04\Delta X_{\max}=42.10\pm0.04 cm and τexp⁡(0)=48.7±0.2\tau_{\exp}^{(0)}=48.7\pm0.2 s. The corresponding expansion time is therefore

texp⁡(Δx)=−τexp⁡(0)ln⁡(1−ΔxΔXmax⁡).(10)t_{\exp}(\Delta x)=-\tau_{\exp}^{(0)}\ln\left(1-\frac{\Delta x}{\Delta X_{\max}}\right). \tag*{(10)}

Each completed cycle extracts mechanical work W=FΔxW=F\Delta x against an opposing force FF, yielding a mean power

P(Δx,τm)=FΔx⟨Tcycle⟩.(11)P(\Delta x,\tau_m)=\frac{F\Delta x}{\langle T_{\mathrm{cycle}}\rangle}. \tag*{(11)}

The engine’s power reflects a competition between the work gained from larger compressions and the associated increase in cycle duration. Temporal correlations modify this balance through their influence on the waiting time for a successful measurement, potentially shifting the optimal operating conditions.

Figure 3(b) shows the experimental power landscape as a function of the normalized compression distance δx=Δx/Lx\delta x = \Delta x/L_x and measurement interval τm\tau_m, at Φ=0.053\Phi= 0.053. Increasing the compression distance increases the work extracted per cycle, but reduces the probability of detecting an empty region, leading to longer waiting times. This competition produces a power maximum at an intermediate compression distance. Temporal correlations shift its location. Frequent measurements probe strongly correlated configurations, so reducing τm\tau_m does not proportionally reduce the waiting time for a vacancy. Nevertheless, for nested measurement intervals, finer sampling can only detect a vacancy earlier or at the same time. Consequently, in the absence of measurement costs, power is necessarily maximized at the shortest available interval, τm=1/30\tau_m = 1/30 s. Temporal correlations therefore influence the power output and optimal compression distance, while finite measurement costs introduce a non-trivial optimization of the measurement interval.

To isolate the influence of temporal correlations on the optimal compression distance, we compare the empirical power with predictions based on independent and first-order Markov measurements. Figure 3(c) shows that the independent approximation overestimates the power and favors larger compression distances than those observed experimentally. By neglecting correlations, this approximation underestimates the waiting time for a successful measurement. Larger compressions therefore appear more favorable than they are, despite their lower vacancy probabilities. Incorporating the measured transition probability p0→1(τm)p_{0\to1}(\tau_m) restores much of this waiting-time penalty, shifting the predicted optimum toward smaller compression distances. As shown in Figure 3(d), this distinction persists across the investigated packing fractions: the Markov approximation closely tracks the experimental optimal compression distance δx∗\delta x^*, while the independent model systematically favors larger values. Temporal correlations therefore affect the optimal operating conditions beyond the spatial inhomogeneity already captured by the stationary vacancy probability p1(Δx)p_1(\Delta x).

To assess the effect of these differences, we evaluate the experimental power at the operating conditions selected by each approximation. We compare this with the maximum obtained from the empirical first-passage statistics. Figure 3(e) shows that neglecting temporal correlations leads to power losses of several percent. The first-order Markov approximation gives much smaller losses, about 0.15% or less across the investigated packing fractions. Its prediction of the mean cycle duration remains accurate near the optimal compression distance. Larger errors appear mainly away from the high-power region, as shown in Appendix § 7, Figure 5. Thus, the full first-passage dynamics are not needed to achieve near-optimal feedback control. A renewal description incorporating the measured distribution of occupied-state residence times provides a more detailed account of first-passage statistics, but does not meaningfully improve the selected protocol or its performance (Appendix B3).

Figure 5. Ratio of empirical to Markov-predicted mean cycle durations as a function of normalized compression distance δx\delta x, at τm=1/30\tau_m = 1/30 s, for three representative packing fractions. Vertical dotted lines indicate the corresponding empirically optimal compression distances. The two predictions agree closely near the optimal operating regime, while larger discrepancies emerge at greater compression distances. The dashed horizontal line indicates perfect agreement.

Measurement costs favor sparse sensing

Thus far, we have treated measurements as cost-free, finding that the shortest available measurement interval maximizes the extracted power. In practice, however, sensing and information processing may incur energetic costs, introducing an additional trade-off between the frequency of measurements and the work extracted. To investigate this trade-off, we assign an effective cost ϵm\epsilon_m to each measurement. This phenomenological parameter represents the energetic expenditure associated with sensing and processing and is not measured directly in the present experiment. Defining the dimensionless measurement cost Λm=εm/(FLx)\Lambda_{\mathrm{m}} = \varepsilon_{\mathrm{m}}/(F L_x), we introduce the cost-adjusted net-power measure

J(δx,τm;Λm)=δx−Λm⟨N⟩⟨Tcycle⟩,(12)J(\delta x,\tau_{\mathrm{m}};\Lambda_{\mathrm{m}})=\frac{\delta x-\Lambda_{\mathrm{m}}\langle N\rangle}{\langle T_{\mathrm{cycle}}\rangle}, \tag*{(12)}

where δx=Δx/Lx\delta x=\Delta x/L_x and ⟨N⟩\langle N\rangle is the mean number of measurements performed per cycle. Since each cycle begins with one measurement, followed by additional measurements only if the initial outcome is unsuccessful,

⟨N⟩=1+(1−p1)⟨TFP⟩τm.(13)\langle N\rangle=1+(1-p_1)\frac{\langle T_{\mathrm{FP}}\rangle}{\tau_{\mathrm{m}}}. \tag*{(13)}

The first-passage statistics determine both the cycle duration and the accumulated measurement cost. Increasing the measurement interval can reduce the number of measurements required per cycle, but may also prolong the waiting time for a successful observation. The optimal sensing strategy follows from the balance between measurement cost and the temporal dynamics of the active gas.

Figure 4(a) illustrates the competition between detection time and sensing expenditure by comparing the maximum net-power measure within rapid (τm≤0.5 s\tau_{\mathrm{m}}\leq0.5\,\mathrm{s}) and sparse (τm>0.5 s\tau_{\mathrm{m}>0.5\,\mathrm{s}}) sensing regimes, with the compression distance and measurement interval optimized within each regime. At low measurement costs, frequent sampling minimizes detection delays, whereas increasing Λm\Lambda_{\mathrm{m}} favors protocols that reduce the accumulated sensing cost. The crossing of the two branches identifies the cost at which the preferred regime changes. It does not imply a discontinuity in the optimal measurement interval.

Figure 4. (a) Maximum normalized net-power objective Jmax⁡J_{\max} as a function of dimensionless measurement cost Λm=εm/(FLx)\Lambda_{\mathrm{m}}=\varepsilon_{\mathrm{m}}/(F L_x), for rapid (τm≤0.5 s\tau_{\mathrm{m}}\leq0.5\,\mathrm{s}) and sparse (τm>0.5 s\tau_{\mathrm{m}}>0.5\,\mathrm{s}) sensing protocols at fixed packing fraction Φ=0.053\Phi=0.053. The vertical dotted line marks the cost at which sparse and rapid sensing become equal. The objective accounts for both extracted work and the cost of repeated measurements. (b) Optimal measurement interval τm∗\tau_{\mathrm{m}}^* as a function of packing fraction Φ\Phi and measurement cost Λm\Lambda_{\mathrm{m}}, obtained from experimental first-passage statistics (top) and the first-order Markov approximation (bottom). The color scale indicates τm∗\tau_{\mathrm{m}}^*, while gray regions denote conditions under which no protocol yields positive net power. (c) Optimal measurement interval as a function of Λm\Lambda_{\mathrm{m}} at fixed packing fraction Φ=0.053\Phi=0.053, comparing experiment (pink circles), Markov (blue solid line), and independent measurements (orange dashed line). While the independent model continues to favor the shortest available interval, τm=1/30 s\tau_{\mathrm{m}}=1/30\,\mathrm{s}, the experimental and Markov optima shift toward increasingly sparse sensing as measurement costs increase. (d) Mean held-out regret ⟨RM⟩\langle R_{\mathrm{M}}\rangle, defined as the difference between the experimentally optimal net-power objective and the experimentally evaluated performance of a model-selected protocol. Protocols are optimized using one temporal block and evaluated on another, with results averaged over both block assignments and densities. The inset magnifies the experimental and Markov regrets, which remain substantially smaller than those of the independent model.

The optimal measurement interval also depends on packing fraction, as shown by the experimental and Markov landscapes in Figure 4(b). This density dependence reflects variations in the temporal statistics of the active gas, while the agreement between the two landscapes indicates that the Markov approximation captures the main features relevant to sensing optimization. At fixed packing fraction [Fig. 4(c)], the empirical and Markov optima shift toward longer intervals as measurement costs increase, whereas the independent approximation necessarily favors the shortest available interval whenever operation is profitable. Indeed, for independent measurements, ⟨N⟩=1/p1\langle N\rangle=1/p_1, yielding

Jind=δx−Λm/p1τm/p1+texp(Δx).(14)J_{\mathrm{ind}}=\frac{\delta x-\Lambda_{\mathrm{m}}/p_1}{\tau_{\mathrm{m}}/p_1+t_{\mathrm{exp}}(\Delta x)}. \tag*{(14)}

For positive net power, this expression decreases monotonically with τm\tau_{\mathrm{m}}. The independent approximation cannot favor sparse sensing because it neglects temporal correlations, not because of the particular parameter values used here. At sufficiently high measurement costs, all protocols can become unprofitable, making no operation the preferred choice.

To test the robustness of these control strategies, we use separate temporal segments of the recorded trajectories. For each packing fraction, the time series is divided into two non-overlapping segments. Protocols are optimized using empirical statistics from one segment and evaluated using empirical statistics from the other. We quantify performance by the regret RMR_{\mathrm{M}}, defined as the difference between the maximum experimental net power and the net power obtained by the selected protocol on the evaluation segment. Figure 4(d) shows the mean regret, averaged over packing fractions and both choices of optimization and evaluation segments.

Neglecting temporal correlations leads to substantial losses, especially at higher measurement costs, where frequent sensing can become unfavorable. The first-order Markov approximation yields regret comparable to that of the empirically optimized strategy, despite its incomplete description of first-passage statistics. Thus, accurate reconstruction of the full temporal dynamics is not needed for effective feedback control. Dependence between successive measurements is sufficient to identify nearly optimal fixed-interval protocols, even when sensing has a finite cost.

The larger regret of the independent approximation has a simple origin. Protocols chosen under the assumption of uncorrelated measurements can incur substantial sensing costs when evaluated against experimental first-passage statistics. In some cases, this leads to negative net power. Because regret is measured relative to the best nonnegative performance, these losses can exceed the maximum positive net power.

Discussion and Outlook

Our results show that temporal correlations play a central role in the finite-time operation of active information engines. While the stationary probability of a favorable fluctuation determines how frequently the monitored region is empty, it does not capture the temporal organization of these events or the waiting time required to detect them. In our previous work, we established how boundary accumulation and the resulting spatial inhomogeneity reshape the probability of successful measurements and the optimal compression distance. Here, we show that temporal correlations introduce an additional constraint on engine performance, substantially modifying first-passage times and shifting the optimal operating conditions. Together, these results show how spatial and temporal statistics jointly determine the use of nonequilibrium fluctuations for work extraction.

The distinction between statistical prediction and optimal control follows from the dependence of mean power on the waiting-time statistics. Predicting the full first-passage distribution requires a detailed description of temporal correlations. Power optimization depends mainly on the mean cycle duration and on how it varies with the control parameters. The first-order Markov approximation captures this dependence sufficiently well near optimal operation, allowing it to identify nearly optimal protocols. This connects to recent work on optimal control of active particles, where feedback exploits information about self-propulsion to improve performance[20]. Here, the controller has access only to a binary occupancy signal from a many-particle active bath. Our results show that even this reduced description can be sufficient for near-optimal control. More generally, the information needed to control an active system can be simpler than the information needed to describe its dynamics.

Finite measurement costs reveal another consequence of temporal correlations: sparse sensing can become optimal. For independent measurements, the expected number of observations per successful cycle is independent of the measurement interval, so increasing this interval only prolongs the cycle without reducing its expected sensing cost. Temporal correlations fundamentally alter this trade-off, as closely spaced measurements repeatedly probe persistent configurations. Increasing the interval can therefore reduce sensing expenditure sufficiently to compensate for longer detection times. The first-order Markov approximation captures this cost-dependent shift. Even a minimal representation of temporal memory can therefore guide sensing optimization.

The present optimization is restricted to protocols with fixed compression distance and fixed measurement interval within each cycle. The observed higher-order temporal memory may become useful for more adaptive strategies, in which the measurement interval depends on the duration of the preceding occupied sequence. Such protocols could reduce redundant measurements during persistent occupation. Testing whether they outperform the fixed-interval strategies considered here is a natural extension.

Acknowledgments

Y.R. and L.H. acknowledge support from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 101002392).

Author Declarations

Conflict of Interest

The authors have no conflicts to disclose.

Author Contributions

Laura Hoek: Conceptualization (lead); Methodology (lead); Investigation (lead); Data curation (lead); Formal analysis (lead); Visualization (lead); Writing - original draft (lead); Writing - review & editing (supporting). Yael Roichman: Conceptualization (supporting); Supervision (lead); Funding acquisition (lead); Writing - review & editing (lead).

Data Availability

The data that support the findings of this study are available from the corresponding author upon reasonable request.

Experimental Details

Experimental System and Particle Tracking

The experimental system consists of self-propelled bristle-robots confined within a two-dimensional rectangular arena of dimensions Lx×LyL_x \times L_y with 10≤Lx≤40 cm10 \le L_x \le40\ \mathrm{cm} and Ly=29.2 cmL_y = 29.2\ \mathrm{cm}, bounded by rigid walls and a movable piston. The particles are propelled by internal-rotation motors, generating persistent chiral motion. The packing fraction is defined as Φ=NbAb/(LxLy)\Phi= N_b A_b/(L_x L_y), where Nb=6N_b = 6 is the particle number, and Ab=4×1.2 cm2A_b = 4 \times1.2\ \mathrm{cm}^2 is the projected area of an individual particle. Different packing fractions were obtained by varying the arena dimensions. Further details of the experimental apparatus and its mechanical characterization are provided in Ref.9^{9}.

Particle trajectories were extracted from overhead video recordings using colored markers attached to the bristle-robots. The recorded positions were analyzed at a frame rate of 30 fps, providing a temporal resolution of 1/30 s1/30\ \mathrm{s}. The resulting trajectories were used to characterize the stationary spatial distributions and temporal fluctuations of the active gas under confinement.

Binary occupancy signal and measurement protocol

For each recorded trajectory, we constructed the binary occupancy signal A(t,Δx)A(t,\Delta x) by determining whether a rectangular region of width Δx\Delta x adjacent to the piston was empty or occupied at each frame. The analysis was repeated for different normalized compression distances δx=Δx/Lx\delta x = \Delta x/L_x, allowing the stationary vacancy probability p1(Δx)p_1(\Delta x) and temporal statistics to be extracted from the same experimental recordings.

To investigate different measurement protocols, the binary signals were sampled at intervals of τm\tau_m, where τm\tau_m is an integer multiple of the frame duration. This allowed the first-passage statistics to be evaluated across measurement intervals without changing the underlying particle dynamics. The resulting statistics were subsequently combined with the independently characterized piston expansion dynamics to calculate the expected cycle duration and power output for each operating protocol. Details of the first-passage analysis and its statistical limitations are provided in Appendix § 7.

First-Passage Statistics and Statistical Models

Extraction of experimental first-passage statistics

First-passage statistics were obtained from the experimentally measured binary occupancy signal A(t,Δx)A(t,\Delta x), defined in Sec. II. For each compression distance Δx\Delta x and measurement interval τm\tau_m, the signal was sampled at discrete intervals of τm\tau_m. Starting from an occupied observation, A(0)=0A(0)=0, the first-passage time TFPT_{\mathrm{FP}} was defined as the elapsed time until the first subsequent observation of an empty region, A(nτm)=1A(n\tau_m)=1.

The survival probability S(nτm)S(n\tau_m) represents the probability that no successful measurement occurs during the first nn observations following an initially occupied state. For each initially occupied observation, the first-passage time was determined from the subsequent sampled occupancy sequence, and the empirical survival probability was obtained from the resulting waiting-time statistics.

The stationary vacancy probability p1(Δx)p_1(\Delta x) and conditional transition probability p0→1(τm,Δx)p_{0\to1}(\tau_m,\Delta x) were extracted from the same occupancy signals. These quantities serve as inputs to the independent and first-order Markov approximations, respectively, allowing their predictions to be compared with the experimental first-passage statistics without introducing additional fitted parameters.

First-order Markov approximation

To incorporate correlations between successive observations, we consider a first-order Markov approximation. The binary occupancy signal is represented by two states, occupied (0) and empty (1), with transitions described by the matrix

M(τm)=(1−aab1−b),(15)M(\tau_m)=\begin{pmatrix}1-a & a \\ b & 1-b\end{pmatrix}, \tag*{(15)}

where a=p0→1(τm)a=p_{0\to1}(\tau_m) and b=p1→0(τm)b=p_{1\to0}(\tau_m) are the conditional transition probabilities. The rows and columns correspond to the occupied and empty states, respectively.

The Markov assumption states that the probability of the next measurement outcome depends only on the current state, independently of the preceding measurement history. Since the first-passage process begins in state 0 and terminates upon reaching state 1, survival requires the system to remain in state 0 at every sampled observation. Consequently,

SM(nτm)=(1−a)n,(16)S_{\mathrm{M}}(n\tau_m)=(1-a)^n, \tag*{(16)}

and the corresponding first-passage distribution is

PM(TFP=nτm)=a(1−a)n−1.(17)P_{\mathrm{M}}(T_{\mathrm{FP}}=n\tau_m)=a(1-a)^{n-1}. \tag*{(17)}

The mean first-passage time is therefore

⟨TFP⟩M=τm∑n=0∞(1−a)n=τma.(18)\langle T_{\mathrm{FP}}\rangle_{\mathrm{M}}=\tau_m\sum_{n=0}^{\infty}(1-a)^n=\frac{\tau_m}{a}. \tag*{(18)}

The measured transition probability is directly related to the normalized autocorrelation function of the binary occupancy signal through

p0→1(τm)=p1[1−CA(τm)].(19)p_{0\to1}(\tau_m)=p_1[1-C_A(\tau_m)]. \tag*{(19)}

Substituting this relation yields

⟨TFP⟩M=τmp1[1−CA(τm)].(20)\langle T_{\rm FP}\rangle_{\rm M}=\frac{\tau_m}{p_1[1-C_A(\tau_m)]}. \tag*{(20)}

This expression explicitly connects temporal correlations to the predicted waiting time. In the independent limit, CA(τm)=0C_A(\tau_m)=0, the Markov prediction reduces to the independent result.

The distinction between these approximations lies in the information retained about previous measurements. The independent model uses only the stationary vacancy probability, whereas the Markov approximation additionally incorporates the conditional probability of a transition from one observation to the next. Although the latter reproduces the measured single-step transition probabilities by construction, it does not account for dependencies on earlier outcomes. Such higher-order temporal dependencies can therefore produce deviations between the experimental and Markov first-passage distributions.

Higher-order temporal memory

To examine the higher-order temporal dependencies revealed by the first-passage statistics, we also considered a renewal description based on the distribution of consecutive occupied observations. Unlike the first-order Markov approximation, which assigns a constant transition probability p0→1(τm)p_{0\to1}(\tau_m) after each unsuccessful measurement, this description retains the distribution of residence times in the occupied state.

For a fixed compression distance Δx\Delta x and measurement interval τm\tau_m, we identified consecutive runs of occupied observations, A=0A=0, in the sampled binary occupancy signal. Let q(k)q(k) denote the probability that an occupied run contains kk consecutive observations. In a stationary time series, an observation selected at random from the occupied state is more likely to belong to a long run than to a short one. The residual duration of the occupied run therefore determines the corresponding first-passage survival probability,

Sren(nτm)=1⟨k⟩∑k=n+1∞(k−n)q(k),(21)S_{\rm ren}(n\tau_m)=\frac{1}{\langle k\rangle}\sum_{k=n+1}^{\infty}(k-n)q(k), \tag*{(21)}

where ⟨k⟩=∑k=1∞kq(k)\langle k\rangle=\sum_{k=1}^{\infty}kq(k) is the mean occupied-run length. The associated mean first-passage time is

⟨TFP⟩ren=τm2⟨k2⟩+⟨k⟩⟨k⟩.(22)\langle T_{\rm FP}\rangle_{\rm ren}=\frac{\tau_m}{2}\frac{\langle k^2\rangle+\langle k\rangle}{\langle k\rangle}. \tag*{(22)}

For geometrically distributed occupied-run lengths, the renewal description reduces to the first-order Markov result, ⟨TFP⟩M=τm/p0→1(τm)\langle T_{\rm FP}\rangle_{\rm M}=\tau_m/p_{0\to1}(\tau_m). Deviations from a geometric residence-time distribution therefore provide a complementary characterization of the memory neglected by the Markov approximation.

Using the experimentally measured occupied-run distribution, the renewal description reconstructs the first-passage statistics while retaining the higher-order temporal information neglected by the first-order Markov approximation.

The renewal description also provides a natural perspective on possible extensions of the present control strategy. In particular, a controller that adjusts its measurement schedule according to the duration of an occupied sequence could potentially exploit information unavailable to the first-order Markov model. Whether such history-dependent protocols provide an operational advantage remains to be investigated.

Accuracy of the Markov Approximation Near Optimal Operation

To examine why the first-order Markov approximation identifies nearly optimal operating conditions despite discrepancies in first-passage statistics, we compare its predicted mean cycle duration with the mean obtained from empirical waiting times. Since both descriptions assign the same work to each successful cycle, their normalized powers satisfy

⟨Tcycle⟩exp⟨Tcycle⟩M=PMPexp.(23)\frac{\langle T_{\rm cycle}\rangle_{\rm exp}}{\langle T_{\rm cycle}\rangle_{\rm M}}=\frac{P_{\rm M}}{P_{\rm exp}}. \tag*{(23)}

Figure 5 shows this ratio as a function of normalized compression distance at the shortest measurement interval, τm=1/30 s\tau_m=1/30\ {\rm s}. The ratio remains close to unity at small compression distances, including the vicinity of the optimal operating points, but generally increases at larger compressions. Thus, the Markov approximation is most accurate in the operating regime relevant to power optimization, while larger discrepancies occur primarily away from the optimum. This explains, in part, why the approximation can identify nearly optimal protocols without reproducing the full first-passage statistics.

Finite-record effects and statistical reliability

The finite duration of experimental recordings limits the statistical accuracy of estimates of long first-passage times, particularly for large compression distances, where empty-region events are rare. For each measurement interval τm\tau_m, first-passage statistics were extracted from the corresponding subsampled binary occupancy signal. Waiting-time sequences that extended beyond the available recording could not be assigned a completed first-passage time. The resulting survival distributions were therefore evaluated only over observation times with sufficient statistical support, avoiding poorly sampled tails and unstable ratios between empirical and model survival probabilities.

The same considerations apply to power optimization, where poorly sampled first-passage times can lead to unreliable estimates of the mean cycle duration. We therefore restricted the optimization to parameter combinations with adequately sampled waiting-time statistics. All statistical models were evaluated over the same supported parameter range, ensuring that differences in their optimal protocols reflect their treatment of temporal correlations rather than differences in data availability.

Cross-Validation and Regret Analysis

Cross-validation procedure

To assess the robustness of the optimal feedback protocols and avoid evaluating their performance on the same data used for optimization, we performed a cross-validation analysis using nonoverlapping temporal segments of the experimental recordings. For each packing fraction, the recorded binary occupancy signal was divided into two consecutive blocks. The stationary vacancy probability and first-passage statistics were estimated separately from each block and used to construct the corresponding experimental, independent, and first-order Markov net-power landscapes.

For each statistical description, the optimal compression distance and measurement interval were determined by maximizing the net-power objective using the training block. The selected protocol was then evaluated using empirical first-passage statistics from the held-out block. This procedure was repeated with the roles of the two blocks reversed. All models were optimized over a common set of statistically supported protocols, including the option of no operation when the predicted net power was nonpositive.

For each training–test split, the admissible protocol set was restricted to compression distances and measurement intervals for which the held-out empirical net-power objective could be evaluated reliably. The same set was used for all three statistical descriptions, so that differences in regret arise from model-based protocol selection rather than unequal access to operating conditions.

Regret and statistical evaluation

We quantify the performance of each control strategy through its regret, defined as the difference between the maximum net-power objective obtained from held-out empirical statistics and the corresponding objective of the model-selected protocol. For a model M, this is expressed as

RM=max⁡[0,max⁡δx,τmJexptest(δx,τm;Λm)]−Jexptest(δxM∗,τm,M∗;Λm),(24)\mathcal{R}_{M} = \max\left[ 0, \max_{\delta x,\tau_m} J_{\mathrm{exp}}^{\mathrm{test}}(\delta x,\tau_m;\Lambda_m) \right] - J_{\mathrm{exp}}^{\mathrm{test}}(\delta x_M^{*},\tau_{m,M}^{*};\Lambda_m), \tag*{(24)}

where the superscript * denotes the protocol selected by maximizing the model’s net-power objective on the training block, and the superscript test denotes evaluation using the held-out experimental data. If the model selects no operation, its evaluated objective is set to zero.

This definition measures the loss in empirically evaluated net power associated with a model-selected protocol, rather than the error in its predicted objective value. A model may therefore achieve low regret despite inaccurate power predictions if it identifies a protocol close to the empirical optimum.

The regret was evaluated for the experimental, independent, and first-order Markov descriptions across the investigated measurement costs and packing fractions. For each cost, the mean regret was obtained by averaging over the two assignments of training and evaluation blocks and over packing fractions satisfying the statistical reliability criteria. These averages are presented in Figure 4(d).

The empirically optimized strategy provides a benchmark for finite-sampling effects and differences between temporal segments. Its held-out regret need not vanish, since the optimal protocols identified from the training and test segments may differ. Comparing the Markov regret with this benchmark therefore reveals whether the approximation introduces additional performance losses beyond those associated with finite experimental statistics.

References

  1. [1]J. C. Maxwell, Theory of heat (Courier Corporation, 2012).
  2. [2]L. Szilard, “Über die entropieverminderung in einem thermodynamischen system bei eingriffen intelligenter wesen,” Zeitschrift für Physik 53, 840–856 (1929).DOI
  3. [3]L. Szilard, “On the decrease of entropy in a thermodynamic system by the intervention of intelligent beings,” Behavioral Science 9, 301–310 (1964).pubmed.ncbi.nlm.nih.gov/5888785
  4. [4]J. M. R. Parrondo, J. M. Horowitz, and T. Sagawa, “Thermodynamics of information,” Nature Physics 11, 131–139 (2015).
  5. [5]T. Sagawa and M. Ueda, “Minimal energy cost for thermodynamic information processing: measurement and information erasure,” Physical review letters 102, 250602 (2009).pubmed.ncbi.nlm.nih.gov/19659065
  6. [6]T. Sagawa and M. Ueda, “Generalized jarzynski equality under nonequilibrium feedback control,” Physical review letters 104, 090602 (2010).pubmed.ncbi.nlm.nih.gov/20366975
  7. [7]R. Goerlich, L. Hoek, O. Chor, S. Rahav, and Y. Reichman, “Experimental realizations of information engines: Beyond proof of concept,” Europhysics Letters 149, 61001 (2025).
  8. [8]T. Admon, S. Rahav, and Y. Reichman, “Experimental Realization of an Information Machine with Tunable Temporal Correlations,” Physical Review Letters 121, 180601 (2018).DOI
  9. [9]L. Hoek, N. B. Ari, R. Goerlich, S. Rahav, and Y. Reichman, “Piston-like information engine ii: Boundary-controlled optimum in active matter,” arXiv preprint arXiv:2609.01760 (2026).arxiv.org/abs/2609.01760
  10. [10]O. Chor, A. Sochahi, R. Goerlich, E. Rosen, S. Rahav, and Y. Reichman, “Many-body szilard engine with giant number fluctuations,” Physical review research 5, 043193– (2023).
  11. [11]M. Lagoin, C. Crauste-Thibierge, and A. Naert, “Human-Scale Brownian Ratchet: A Historical Thought Experiment,” Physical Review Letters 129, 120606 (2022), publisher: American Physical Society.DOI
  12. [12]R. Goerlich, G. Pollack, E. Flaxer, S. Rahav, and Y. Reichman, “Piston-like information engine i: Universal features in equilibrium,” arxiv.2512.01942 (2025).arxiv.org/abs/2512.01942
  13. [13]G. Paneru, S. Dutta, T. Sagawa, T. Tlusty, and H. K. Pak, “Efficiency fluctuations and noise induced refrigerator-to-heater transition in information engines,” Nature Communications 11, 1012 (2020).DOI
  14. [14]M. R ibezzi-Crivellari and F. Ritort, “Large work extraction and the Landauer limit in a continuous Maxwell demon,” Nature Physics 15, 660–664 (2019).
  15. [15]T. K. Saha, J. N. E. Lucero, J. Ehrich, D. A. Sivak, and J. Bechhoefer, “Maximizing power and velocity of an information engine,” Proceedings of the National Academy of Sciences 118, e2023356118 (2021).DOI
  16. [16]G. Paneru, S. Dutta, and H. K. Pak, “Colossal power extraction from active cyclic brownian information engines,” The Journal of Physical Chemistry Letters 13, 6912 (2022).DOI
  17. [17]T. K. Saha, J. N. E. Lucero, J. Ehrich, D. A. Sivak, and J. Bechhoefer, “Bayesian information engine that optimally exploits noisy measurements,” Physical Review Letters 129, 130601 (2022).DOI
  18. [18]R. Landauer, “Irreversibility and heat generation in the computing process,” IBM journal of research and development 5, 183–191 (1961).
  19. [19]A. Bérut, A. Arakelyan, A. Petrosyan, S. Ciliberto, R. Dillenschneider, and E. Lut, “Experimental verification of landauer’s principle linking information and thermodynamics,” Nature 483, 187–189 (2012).DOI
  20. [20]R. Garcia-Millan, J. Schüttler, M. E. Cates, and S. A. M. Loos, “Optimal closed-loop control of active particles and a minimal information engine,” Phys. Rev. Lett. 135, 088301 (2025).
  21. [21]E. Panizon, “Optimal control of a mesoscopic information engine,” Physical Review E 114, 034144 (2026).arxiv.org/abs/2603.29804
  22. [22]L. Muruga, F. Ginot, S. A. M. Loos, and C. Bechinger, “The extraction of work from hidden degrees of freedom,” Nature Physics (2026), 10.1038/s41567-026-03442-w.DOI
  23. [23]É. Fodor, M. Nardini, M. E. Cates, J. Tailleur, P. Visco, and F. Van Wijland, “How far from equilibrium is active matter?” Physical review letters 117, 038103 (2016).DOI
  24. [24]T. Vicsek and A. Zafeiris, “Collective motion,” Physics Reports 517, 71–140 (2012).
  25. [25]B. Liebchen and D. Levis, “Collective behavior of chiral active matter: Pattern formation and enhanced flocking,” Phys. Rev. Lett. 119, 058002 (2017).DOI
  26. [26]M. E. Cates and J. Tailleur, “Motility-induced phase separation,” Annual Review of Condensed Matter Physics 6, 219–244 (2015).DOI
  27. [27]S. Bureković, S. Kole, A. Maitra, and C. Nardini, “Bulk and microphase separation in chiral active systems,” arXiv preprint arXiv:2607.12045 (2026).arxiv.org/abs/2607.12045
  28. [28]J. Deseigne, O. Dauchot, and H. Chaté, “Collective motion of vibrated polar disks,” Phys. Rev. Lett. 105, 098001 (2010).
  29. [29]A. P. Solon, Y. Fily, A. Baskaran, M. E. Cates, Y. Kafri, M. Kardar, and J. Tailleur, “Pressure is not a state function for generic active fluids,” Nature Physics 11, 673–678 (2015).DOI
  30. [30]J. Elgeti and G. Gompper, “Wall accumulation of self-propelled spheres,” Europhysics Letters 101, 48003 (2013).DOI
  31. [31]Y. Fily, A. Baskaran, and M. F. Hagan, “Dynamics of self-propelled particles under strong confinement,” Soft matter 10, 5609–5617 (2014).DOI

Paper details

vlnc:W_3d8rayn3
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents