Searcharxiv⌕ Search

arXiv subjects

Satya N. Majumdar

Publications and source records attributed to Satya N. Majumdar.

At least 361 records · Page 20Linked to original sources
arXiv2004

Clustering of advected passive sliders on a fluctuating surface

We study the clustering properties of advected, non-interacting,passive scalar particles in a Burgers fluid with noise, a problem which maps to that of passive sliding particles moving under gravity on a surface evolving through the Kardar-Parisi-Zhang equation. Numerical simulations show that both the density-density correlation function and the single-site mass distribution scale with system size. The scaling functions diverge at small argument, indicating strong clustering of particles. We analytically evaluate the scaling functions for the two-point correlation and mass distribution of noninteracting particles in thermal equilibrium in a random landscape, and find that the results are remarkably similar to those for nonequilibrium advection.

cond-mat.stat-mech↗
arXiv2004

Survival in equilibrium step fluctuations

We report the results of analytic and numerical investigations of the time scale of survival or non-zero-crossing probability $S(t)$ in equilibrium step fluctuations described by Langevin equations appropriate for attachment/detachment and edge-diffusion limited kinetics. An exact relation between long-time behaviors of the survival probability and the autocorrelation function is established and numerically verified. $S(t)$ is shown to exhibit simple scaling behavior as a function of system size and sampling time. Our theoretical results are in agreement with those obtained from an analysis of experimental dynamical STM data on step fluctuations on Al/Si(111) and Ag(111) surfaces.

cond-mat.stat-mech↗
arXiv2004

Landau theory of glassy dynamics

An exact solution of a Landau model of an order-disorder transition with activated critical dynamics is presented. The model describes a funnel-shaped topography of the order parameter space in which the number of energy lowering trajectories rapidly diminishes as the ordered ground-state is approached. This leads to an asymmetry in the effective transition rates which results in a non-exponential relaxation of the order-parameter fluctuations and a Vogel-Fulcher-Tammann divergence of the relaxation times, typical of a glass transition. We argue that the Landau model provides a general framework for studying glassy dynamics in a variety of systems.

cond-mat.stat-mech↗
arXiv2004

Exact Maximal Height Distribution of Fluctuating Interfaces

We present an exact solution for the distribution P(h_m,L) of the maximal height h_m (measured with respect to the average spatial height) in the steady state of a fluctuating Edwards-Wilkinson interface in a one dimensional system of size L with both periodic and free boundary conditions. For the periodic case, we show that P(h_m,L)=L^{-1/2}f(h_m L^{-1/2}) for all L where the function f(x) is the Airy distribution function that describes the probability density of the area under a Brownian excursion over a unit interval. For the free boundary case, the same scaling holds but the scaling function is different from that of the periodic case. Numerical simulations are in excellent agreement with our analytical results. Our results provide an exactly solvable case for the distribution of extremum of a set of strongly correlated random variables.

cond-mat.stat-mech↗
arXiv2003

Persistence of a particle in the Matheron-de Marsily velocity field

We show that the longitudinal position $x(t)$ of a particle in a $(d+1)$-dimensional layered random velocity field (the Matheron-de Marsily model) can be identified as a fractional Brownian motion (fBm) characterized by a variable Hurst exponent $H(d)=1-d/4$ for $d<2$ and $H(d)=1/2$ for $d>2$. The fBm becomes marginal at $d=2$. Moreover, using the known first-passage properties of fBm we prove analytically that the disorder averaged persistence (the probability of no zero crossing of the process $x(t)$ upto time $t$) has a power law decay for large $t$ with an exponent $θ=d/4$ for $d<2$ and $θ=1/2$ for $d\geq 2$ (with logarithmic correction at $d=2$), results that were earlier derived by Redner based on heuristic arguments and supported by numerical simulations (S. Redner, Phys. Rev. E {\bf 56}, 4967 (1997)).

cond-mat.stat-mech↗
arXiv2003

An Anisotropic Ballistic Deposition Model with Links to the Ulam Problem and the Tracy-Widom Distribution

We compute exactly the asymptotic distribution of scaled height in a (1+1)--dimensional anisotropic ballistic deposition model by mapping it to the Ulam problem of finding the longest nondecreasing subsequence in a random sequence of integers. Using the known results for the Ulam problem, we show that the scaled height in our model has the Tracy-Widom distribution appearing in the theory of random matrices near the edges of the spectrum. Our result supports the hypothesis that various growth models in $(1+1)$ dimensions that belong to the Kardar-Parisi-Zhang universality class perhaps all share the same universal Tracy-Widom distribution for the suitably scaled height variables.

cond-mat.stat-mech↗
arXiv2003

Persistence Exponents and the Statistics of Crossings and Occupation Times for Gaussian Stationary Processes

We consider the persistence probability, the occupation-time distribution and the distribution of the number of zero crossings for discrete or (equivalently) discretely sampled Gaussian Stationary Processes (GSPs) of zero mean. We first consider the Ornstein-Uhlenbeck process, finding expressions for the mean and variance of the number of crossings and the `partial survival' probability. We then elaborate on the correlator expansion developed in an earlier paper [G. C. M. A. Ehrhardt and A. J. Bray, Phys. Rev. Lett. 88, 070602 (2001)] to calculate discretely sampled persistence exponents of GSPs of known correlator by means of a series expansion in the correlator. We apply this method to the processes d^n x/dt^n=η(t) with n > 2, incorporating an extrapolation of the series to the limit of continuous sampling. We extend the correlator method to calculate the occupation-time and crossing-number distributions, as well as their partial-survival distributions and the means and variances of the occupation time and number of crossings. We apply these general methods to the d^n x/dt^n=η(t) processes for n=1 (random walk), n=2 (random acceleration) and larger n, and to diffusion from random initial conditions in 1-3 dimensions. The results for discrete sampling are extrapolated to the continuum limit where possible.

cond-mat.stat-mech↗
arXiv2003

Survival Probability of a Ballistic Tracer Particle in the Presence of Diffusing Traps

We calculate the survival probability P_S(t) up to time t of a tracer particle moving along a deterministic trajectory in a continuous d-dimensional space in the presence of diffusing but mutually noninteracting traps. In particular, for a tracer particle moving ballistically with a constant velocity c, we obtain an exact expression for P_S(t), valid for all t, for d<2. For d \geq 2, we obtain the leading asymptotic behavior of P_S(t) for large t. In all cases, P_S(t) decays exponentially for large t, P_S(t) \sim \exp(-θt). We provide an explicit exact expression for the exponent θin dimensions d \leq 2, and for the physically relevant case, d=3, as a function of the system parameters.

cond-mat.stat-mech↗
arXiv2003

Traveling Front Solutions to Directed Diffusion Limited Aggregation, Digital Search Trees and the Lempel-Ziv Data Compression Algorithm

We use the traveling front approach to derive exact asymptotic results for the statistics of the number of particles in a class of directed diffusion limited aggregation models on a Cayley tree. We point out that some aspects of these models are closely connected to two different problems in computer science, namely the digital search tree problem in data structures and the Lempel-Ziv algorithm for data compression. The statistics of the number of particles studied here is related to the statistics of height in digital search trees which, in turn, is related to the statistics of the length of the longest word formed by the Lempel-Ziv algorithm. Implications of our results to these computer science problems are pointed out.

cond-mat.stat-mech↗
arXiv2003

Persistence of Manifolds in Nonequilibrium Critical Dynamics

We study the persistence P(t) of the magnetization of a d' dimensional manifold (i.e., the probability that the manifold magnetization does not flip up to time t, starting from a random initial condition) in a d-dimensional spin system at its critical point. We show analytically that there are three distinct late time decay forms for P(t) : exponential, stretched exponential and power law, depending on a single parameter ζ=(D-2+η)/z where D=d-d' and η, z are standard critical exponents. In particular, our theory predicts that the persistence of a line magnetization decays as a power law in the d=2 Ising model at its critical point. For the d=3 critical Ising model, the persistence of the plane magnetization decays as a power law, while that of a line magnetization decays as a stretched exponential. Numerical results are consistent with these analytical predictions.

cond-mat.stat-mech↗
arXiv2002

Formal Solution of a Class of Reaction-Diffusion Models: Reduction to a Single-Particle Problem

We consider the trapping reaction A + B -> B in space dimension d<=2. By formally eliminating the B particles from the problem we derive an effective dynamics for the A particles from which the survival probability of a given A particle and the statistics of its spatial fluctuations can be calculated in a rather general way. The method can be extended to the study of annihilation/coalescence reactions, B + B -> 0 or B, in d=2.

cond-mat.stat-mech↗
arXiv2002

Slow Relaxation in a Constrained Ising Spin Chain: a Toy Model for Granular Compaction

We present detailed analytical studies on the zero temperature coarsening dynamics in an Ising spin chain in presence of a dynamically induced field that favors locally the `-' phase compared to the `+' phase. We show that the presence of such a local kinetic bias drives the system into a late time state with average magnetization m=-1. However the magnetization relaxes into this final value extremely slowly in an inverse logarithmic fashion. We further map this spin model exactly onto a simple lattice model of granular compaction that includes the minimal microscopic moves needed for compaction. This toy model then predicts analytically an inverse logarithmic law for the growth of density of granular particles, as seen in recent experiments and thereby provides a new mechanism for the inverse logarithmic relaxation. Our analysis utilizes an independent interval approximation for the particle and the hole clusters and is argued to be exact at late times (supported also by numerical simulations).

cond-mat.stat-mech↗
arXiv2002

The Local Time Distribution of a Particle Diffusing on a Graph

We study the local time distribution of a Brownian particle diffusing along the links on a graph. In particular, we derive an analytic expression of its Laplace transform in terms of the Green's function on the graph. We show that the asymptotic behavior of this distribution has non-Gaussian tails characterized by a nontrivial large deviation function.

cond-mat.stat-mech↗
arXiv2002

Exact Asymptotic Results for Persistence in the Sinai Model with Arbitrary Drift

We obtain exact asymptotic results for the disorder averaged persistence of a Brownian particle moving in a biased Sinai landscape. We employ a new method that maps the problem of computing the persistence to the problem of finding the energy spectrum of a single particle quantum Hamiltonian, which can be subsequently found. Our method allows us analytical access to arbitrary values of the drift (bias), thus going beyond the previous methods which provide results only in the limit of vanishing drift. We show that on varying the drift, the persistence displays a variety of rich asymptotic behaviors including, in particular, interesting qualitative changes at some special values of the drift.

cond-mat.stat-mech↗
arXiv2002

Exact Occupation Time Distribution in a Non-Markovian Sequence and Its Relation to Spin Glass Models

We compute exactly the distribution of the occupation time in a discrete {\em non-Markovian} toy sequence which appears in various physical contexts such as the diffusion processes and Ising spin glass chains. The non-Markovian property makes the results nontrivial even for this toy sequence. The distribution is shown to have non-Gaussian tails characterized by a nontrivial large deviation function which is computed explicitly. An exact mapping of this sequence to an Ising spin glass chain via a gauge transformation raises an interesting new question for a generic finite sized spin glass model: at a given temperature, what is the distribution (over disorder) of the thermally averaged number of spins that are aligned to their local fields? We show that this distribution remains nontrivial even at infinite temperature and can be computed explicitly in few cases such as in the Sherrington-Kirkpatrick model with Gaussian disorder.

cond-mat.stat-mech↗
arXiv2002

Exact Solution of a Drop-push Model for Percolation

Motivated by a computer science algorithm known as `linear probing with hashing' we study a new type of percolation model whose basic features include a sequential `dropping' of particles on a substrate followed by their transport via a `pushing' mechanism. Our exact solution in one dimension shows that, unlike the ordinary random percolation model, the drop-push model has nontrivial spatial correlations generated by the dynamics itself. The critical exponents in the drop-push model are also different from that of the ordinary percolation. The relevance of our results to computer science is pointed out.

cond-mat.stat-mech↗
arXiv2002

Phase Transition in a Random Fragmentation Problem with Applications to Computer Science

We study a fragmentation problem where an initial object of size x is broken into m random pieces provided x>x_0 where x_0 is an atomic cut-off. Subsequently the fragmentation process continues for each of those daughter pieces whose sizes are bigger than x_0. The process stops when all the fragments have sizes smaller than x_0. We show that the fluctuation of the total number of splitting events, characterized by the variance, generically undergoes a nontrivial phase transition as one tunes the branching number m through a critical value m=m_c. For m m_c they are anomalously large and non-Gaussian. We apply this general result to analyze two different search algorithms in computer science.

cond-mat.stat-mech↗