Ballistic deposition patterns beneath a growing KPZ interface

We consider a (1+1)-dimensional ballistic deposition process with next-nearest neighbor interaction, which belongs to the KPZ universality class, and introduce for this discrete model a variational formulation similar to that for the randomly forced continuous Burgers equation. This allows to identify the characteristic structures in the bulk of a growing aggregate ("clusters" and "crevices") with minimizers and shocks in the Burgers turbulence, and to introduce a new kind of equipped Airy process for ballistic growth. We dub it the "hairy Airy process" and investigate its statistics numerically. We also identify scaling laws that characterize the ballistic deposition patterns in the bulk: the law of "thinning" of the forest of clusters with increasing height, the law of transversal fluctuations of cluster boundaries, and the size distribution of clusters. The corresponding critical exponents are determined exactly based on the analogy with the Burgers turbulence and simple scaling considerations.Comment: 10 pages, 5 figures. Minor edits: typo corrected, added explanation of two acronyms. The text is essentially equivalent to version

Analytic calculation of energies and wave functions of the quartic and pure quartic oscillators

Ground state energies and wave functions of quartic and pure quartic oscillators are calculated by first casting the Schr\"{o}dinger equation into a nonlinear Riccati form and then solving that nonlinear equation analytically in the first iteration of the quasilinearization method (QLM). In the QLM the nonlinear differential equation is solved by approximating the nonlinear terms by a sequence of linear expressions. The QLM is iterative but not perturbative and gives stable solutions to nonlinear problems without depending on the existence of a smallness parameter. Our explicit analytic results are then compared with exact numerical and also with WKB solutions and it is found that our ground state wave functions, using a range of small to large coupling constants, yield a precision of between 0.1 and 1 percent and are more accurate than WKB solutions by two to three orders of magnitude. In addition, our QLM wave functions are devoid of unphysical turning point singularities and thus allow one to make analytical estimates of how variation of the oscillator parameters affects physical systems that can be described by the quartic and pure quartic oscillators.Comment: 8 pages, 12 figures, 1 tabl

How good are your fits? Unbinned multivariate goodness-of-fit tests in high energy physics

Multivariate analyses play an important role in high energy physics. Such analyses often involve performing an unbinned maximum likelihood fit of a probability density function (p.d.f.) to the data. This paper explores a variety of unbinned methods for determining the goodness of fit of the p.d.f. to the data. The application and performance of each method is discussed in the context of a real-life high energy physics analysis (a Dalitz-plot analysis). Several of the methods presented in this paper can also be used for the non-parametric determination of whether two samples originate from the same parent p.d.f. This can be used, e.g., to determine the quality of a detector Monte Carlo simulation without the need for a parametric expression of the efficiency.Comment: 32 pages, 12 figure

On rr-Simple kk-Path

An $r$-simple $k$-path is a {path} in the graph of length $k$ that passes through each vertex at most $r$ times. The $r$-SIMPLE $k$-PATH problem, given a graph $G$ as input, asks whether there exists an $r$-simple $k$-path in $G$. We first show that this problem is NP-Complete. We then show that there is a graph $G$ that contains an $r$-simple $k$-path and no simple path of length greater than $4\log k/\log r$. So this, in a sense, motivates this problem especially when one's goal is to find a short path that visits many vertices in the graph while bounding the number of visits at each vertex. We then give a randomized algorithm that runs in time $$\mathrm{poly}(n)\cdot 2^{O( k\cdot \log r/r)}$$ that solves the $r$-SIMPLE $k$-PATH on a graph with $n$ vertices with one-sided error. We also show that a randomized algorithm with running time $\mathrm{poly}(n)\cdot 2^{(c/2)k/ r}$ with $c<1$ gives a randomized algorithm with running time \poly(n)\cdot 2^{cn} for the Hamiltonian path problem in a directed graph - an outstanding open problem. So in a sense our algorithm is optimal up to an $O(\log r)$ factor

Enhanced Transmission Due to Disorder

The transmissivity of a one-dimensional random system that is periodic on average is studied. It is shown that the transmission coefficient for frequencies corresponding to a gap in the band structure of the average periodic system increases with increasing disorder while the disorder is weak enough. This property is shown to be universal, independent of the type of fluctuations causing the randomness. In the case of strong disorder the transmission coefficient for frequencies in allowed bands is found to be a non monotonic function of the strength of the disorder. An explanation for the latter behavior is provided.Comment: 9 pages, RevTeX 3.0, 4 Postscript figure

Exact transmission moments in one-dimensional weak localization and single-parameter scaling

We obtain for the first time the expressions for the mean and the variance of the transmission coefficient for an Anderson chain in the weak localization regime, using exact expansions of the complex transmission- and reflection coefficients to fourth order in the weakly disordered site energies. These results confirm the validity of single-parameter scaling theory in a domain where the higher transmission cumulants may be neglected. We compare our results with earlier results for transmission cumulants in the weak localization domain based on the phase randomization hypothesis

Optimal energy management for a flywheel-assisted battery electric vehicle

Battery electric vehicles are crucial to the reduction in the dependence on fossil fuels and for moving towards a zero-emission transport system. Although battery electric vehicle technology has been rapidly improving, the limited driving range and the high cost are significant impediments to the popularity of electric vehicles. The battery is the main element which affects the range and the cost of the vehicle. The batteries can provide either high power or high energy but not both. Hybridisation of the energy source is one of the methods to improve the energy efficiency of the vehicle, which involves combining a high-energy battery with a high-power source. High-speed flywheels have attractive properties and low-cost potential which makes them excellent secondary energy storage devices to be used in hybrid and electric vehicles. They are utilised to load the battery to a level so as to protect it from peak loads and to enhance its capacity and life. The flywheel is coupled to the drive line with a continuously variable transmission. This paper presents the optimal energy management strategy for a mechanically connected flywheel-assisted battery electric vehicle powertrain. The optimisation problem is complex because of factors such as the small storage capacity of the flywheel, the kinematic constraints and the slipping of clutches. Dynamic programming is used to calculate the optimal control strategy for torque distribution during operation in real-world driving cycles. The results show significant potential for reduction in the energy consumption in extra-urban and highway cycles, while reducing the peak battery loads during all cycles. The results give a benchmark of the energy-saving potential for such a powertrain and insights into how a real suboptimal controller can be designed

Multiple-copy state discrimination: Thinking globally, acting locally

We theoretically investigate schemes to discriminate between two nonorthogonal quantum states given multiple copies. We consider a number of state discrimination schemes as applied to nonorthogonal, mixed states of a qubit. In particular, we examine the difference that local and global optimization of local measurements makes to the probability of obtaining an erroneous result, in the regime of finite numbers of copies $N$, and in the asymptotic limit as $N \rightarrow \infty$. Five schemes are considered: optimal collective measurements over all copies, locally optimal local measurements in a fixed single-qubit measurement basis, globally optimal fixed local measurements, locally optimal adaptive local measurements, and globally optimal adaptive local measurements. Here, adaptive measurements are those for which the measurement basis can depend on prior measurement results. For each of these measurement schemes we determine the probability of error (for finite $N$) and scaling of this error in the asymptotic limit. In the asymptotic limit, adaptive schemes have no advantage over the optimal fixed local scheme, and except for states with less than 2% mixture, the most naive scheme (locally optimal fixed local measurements) is as good as any noncollective scheme. For finite $N$, however, the most sophisticated local scheme (globally optimal adaptive local measurements) is better than any other noncollective scheme, for any degree of mixture.Comment: 11 pages, 14 figure

On positive solutions and the Omega limit set for a class of delay differential equations

This paper studies the positive solutions of a class of delay differential equations with two delays. These equations originate from the modeling of hematopoietic cell populations. We give a sufficient condition on the initial function for $t\leq 0$ such that the solution is positive for all time $t>0$. The condition is "optimal". We also discuss the long time behavior of these positive solutions through a dynamical system on the space of continuous functions. We give a characteristic description of the $\omega$ limit set of this dynamical system, which can provide informations about the long time behavior of positive solutions of the delay differential equation.Comment: 15 pages, 2 figure

Cosmological particle production and the precision of the WKB approximation

Particle production by slow-changing gravitational fields is usually described using quantum field theory in curved spacetime. Calculations require a definition of the vacuum state, which can be given using the adiabatic (WKB) approximation. I investigate the best attainable precision of the resulting approximate definition of the particle number. The standard WKB ansatz yields a divergent asymptotic series in the adiabatic parameter. I derive a novel formula for the optimal number of terms in that series and demonstrate that the error of the optimally truncated WKB series is exponentially small. This precision is still insufficient to describe particle production from vacuum, which is typically also exponentially small. An adequately precise approximation can be found by improving the WKB ansatz through perturbation theory. I show quantitatively that the fundamentally unavoidable imprecision in the definition of particle number in a time-dependent background is equal to the particle production expected to occur during that epoch. The results are illustrated by analytic and numerical examples.Comment: 14 pages, RevTeX, 5 figures; minor changes, a clarification in Sec. II