Sharp-interface limit of the Allen-Cahn action functional in one space dimension

Kohn, Robert V.; Reznikoff, Maria G.; Tonegawa, Yoshihiro
April 2006
Calculus of Variations & Partial Differential Equations;Apr2006, Vol. 25 Issue 4, p503
Academic Journal
We analyze the sharp-interface limit of the action minimization problem for the stochastically perturbed Allen-Cahn equation in one space dimension. The action is a deterministic functional which is linked to the behavior of the stochastic process in the small noise limit. Previously, heuristic arguments and numerical results have suggested that the limiting action should �count� two competing costs: the cost to nucleate interfaces and the cost to propagate them. In addition, constructions have been used to derive an upper bound for the minimal action which was proved optimal on the level of scaling. In this paper, we prove that for d = 1, the upper bound achieved by the constructions is in fact sharp. Furthermore, we derive a lower bound for the functional itself, which is in agreement with the heuristic picture. To do so, we characterize the sharp-interface limit of the space-time energy measures. The proof relies on an extension of earlier results for the related elliptic problem.


Related Articles

  • Overall Station Balance and Decomposability for Non-Markovian Queueing Networks. Fakinos, D.; Economou, A. // Advances in Applied Probability;Sep98, Vol. 30 Issue 3, p870 

    Highlights a study which discussed the concept of overall station balance which extends the notion of station balance to non-Markovian queueing networks. Overview of the overall station balance; Information on the Jackson-type queueing networks; Examples of non-Markovian queueing networks.

  • A Logical and Computational Theory of Located Resource. COLLINSON, MATTHEW; MONAHAN, BRIAN; PYM, DAVID // Journal of Logic & Computation;Dec2009, Vol. 19 Issue 6, p1207 

    Experience of practical systems modelling suggests that the key conceptual components of a model of a system are processes, resources, locations and environment. In recent work, we have given a process-theoretic account of this view in which resources as well as processes are first-class...

  • COMMENTS ON A PAPER BY A. NOVAES AND E. FRANKEL, "A QUEUING MODEL FOR UNITIZED CARGO GENERATION". Brown, J. F. // Operations Research;May/Jun67, Vol. 15 Issue 3, p572 

    Some discrepancies in an earlier paper describing a bulk service queuing situation with customer balking or reneging are pointed out. Necessary modifications to make the model more valid are incorporated in a reformulation and an approach for developing the state-time probabilities of the system...

  • Optimal Server Location on a Network Operating as an M/G/1 Queue. Berman, Oded; Larson, Richard C.; Chiu, Samuel S. // Operations Research;Jul/Aug85, Vol. 33 Issue 4, p746 

    This paper extends Hakimi's one-median problem by embedding it in a general queueing context. Demands for service arise solely on the nodes of a network G and occur in time as a Poisson process. A single mobile server resides at a facility located on G. The server, when available, is dispatched...

  • TAIL BEHAVIOR OF THE QUEUE SIZE AND WAITING TIME IN A QUEUE WITH DISCRETE AUTOREGRESSIVE ARRIVALS. Kim, Bara; Sohraby, Khosrow // Advances in Applied Probability;Dec2006, Vol. 38 Issue 4, p1116 

    Autoregressive arrival models are described by a few parameters and provide a simple means to obtain analytical models for matching the first- and second-order statistics of measured data. We consider a discrete-time queueing system where the service time of a customer occupies one slot and the...

  • A single-server finite-capacity queueing system with Markov flow and discrete-time service. Bocharov, P.; Viskova, E. // Automation & Remote Control;Feb2005, Vol. 66 Issue 2, p233 

    Concepts of a discrete Markov flow and discrete-time Markov service are defined. A single-server finite-capacity queueing system with Markov flow and discrete-time service is studied. An algorithm for computing the stationary state probability distribution of the system is designed. The main...

  • Martingale Methods for Analyzing the M|M|1 Retrial Queue with Negative Arrivals. Berdjoudj, L.; Aïssani, D. // Journal of Mathematical Sciences;Dec2005, Vol. 131 Issue 3, p5595 

    Applies the martingale technique to the M∣M∣1 queuing system allowing the simultaneous presence of classical and constant repeated attempts and negative arrivals. Description of the mathematical model; Probabilistic elements; Definition of the stopping time; Condition for regularity of...

  • ON STABILITY OF QUEUEING NETWORKS WITH JOB DEADLINES. Ward, Amy R.; Bambos, Nicholas // Journal of Applied Probability;Jun2003, Vol. 40 Issue 2, p293 

    Considers a single-server queue with stationary input, where each job joining the queue has an associated deadline. Stability of a priority service discipline; Service discipline with a large strong stability region; Stability of networks with global deadline.

  • IMBEDDED MARKOV CHAIN.  // Encyclopedia of Operations Research & Management Science;2001, p379 

    A definition of the term "imbedded Markov chain" is presented. It refers to an analysis technique used to analyze a queueing system that is not a continuous-time Markov chain. The system is appraised at selected time points that allow the system to be analyzed via a discrete-parameter Markov chain.


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics