SearcharxivSearch

arXiv subjects

Riya Verma

Publications and source records attributed to Riya Verma.

2 recordsLinked to original sources

Resetting dynamics in a system with quenched disorder

Although resetting has widespread applicability, applying it to the dynamics in the presence of spatial quenched disorder, which is essential in many physical problems, is challenging. In this study, we consider a well-known one-dimensional model of particle hopping on a lattice with quenched disorder in the form of site-dependent hopping probabilities, drawn from a power-law distribution, and apply the resetting formalism. As a physical example, we recast the growth dynamics of microtubules with sudden catastrophic disassembly events as a resetting dynamics. We consider two distinct regimes for growth dynamics: a strongly biased case and a less biased case. Motivated by experimental results, we take a Gamma distribution for the resetting time. Our results show that occasional disassembly events are crucial for the experimentally observed distribution of reset (or catastrophe) lengths. We also analyze steady-state distributions under different resetting protocols-resetting to the initial position versus a random site. We also investigate the distribution of first-passage times to a fixed distance following reset. Finally, by considering other resetting probability distributions, we identify a regime where the mean displacement grows as slowly as $\log^2 t$. We also elucidate the role of disorder in the system properties under the resetting dynamics. Our study paves the way to treat the dynamics of complex physical systems using resetting.

cond-mat.stat-mech

A Step Toward Deep Online Aggregation (Extended Version)

For exploratory data analysis, it is often desirable to know what answers you are likely to get before actually obtaining those answers. This can potentially be achieved by designing systems to offer the estimates of a data operation result -- say op(data) -- earlier in the process based on partial data processing. Those estimates continuously refine as more data is processed and finally converge to the exact answer. Unfortunately, the existing techniques -- called Online Aggregation (OLA) -- are limited to a single operation; that is, we cannot obtain the estimates for op(op(data)) or op(...(op(data))). If this Deep OLA becomes possible, data analysts will be able to explore data more interactively using complex cascade operations. In this work, we take a step toward Deep OLA with evolving data frames (edf), a novel data model to offer OLA for nested ops -- op(...(op(data))) -- by representing an evolving structured data (with converging estimates) that is closed under set operations. That is, op(edf) produces yet another edf; thus, we can freely apply successive operations to edf and obtain an OLA output for each op. We evaluate its viability with Wake, an edf-based OLA system, by examining against state-of-the-art OLA and non-OLA systems. In our experiments on TPC-H dataset, Wake produces its first estimates 4.93x faster (median) -- with 1.3x median slowdown for exact answers -- compared to conventional systems. Besides its generality, Wake is also 1.92x faster (median) than existing OLA systems in producing estimates of under 1% relative errors.

cs.DB