betaFeedback

WorksMathematics

A Model for Fast Mining Blockchains

Abstract

We study a Markovian model for a blockchain mining process. In the limit where there is an infinite number of miners, the model satisfies a functional law of large numbers due to Barbour and Luczac (2008), leading to an infinite set of coupled ODEs characterising the blockchain heights. We show that the sequence of solutions to this system converges uniformly, to a limiting profile in an appropriate comoving frame. Utilising asymptotic arguments inspired by Brunet and Derrida (1997), we derive an explicit expression for the position of the travelling front, which exhibits a leading order logarithmic Bramson correction in time. For a finite number of miners, we further derive a correction to the travelling speed which is logarithmic in the number of miners. Finally, by application of a computation due to Ablowitz and Zeppetella (1979), we identify that, for a specific choice of the travelling speed, the Painlevé integrable, travelling wave solution of the Fisher-KPP equation with drift accurately matches our limiting profile. Our results are supported by numerical simulations.

Introduction

A blockchain is constructed by miners each of whom works to discover new blocks according to a process that is well-approximated by a Poisson process [13], with a rate that is proportional to the miner’s computational power. Each block that is mined must reference a parent block and that block in turn must reference its parent block all the way back to the original block, the genesis block. The height of a block is the number of ancestor blocks that lie between it and the genesis block, and the length of a branch is determined by the block of maximum height. We shall refer to the longest branch that an individual miner knows about as its local blockchain. If a miner knows of two or more different branches of the same length then its local blockchain is given by the one that it knew about first. At any given time a miner is working to append a new block to its local blockchain. We say that it is mining on top of its local blockchain.

A miner’s local blockchain can progress in two ways.

  1. The miner can discover a new block. In this case, it appends the block to its local blockchain and copies the block to the other miners via a peer-to-peer network of nodes.

  2. The miner can receive a block copied from another miner. In this case, the miner will validate the proof-of-work and the transactions in the block. If these are in order and if the height of the newly-received block is greater than the height of the block at the head of its local blockchain, it will acquire previous blocks if necessary and institute the new branch as its local blockchain, That is, it will start mining on top of the new block. It will also forward the new block to other adjacent nodes.

MSC2020 subject classifications. Primary 60G, Stochastic processes; secondary 60J27, Continuous-time Markov processes on discrete state spaces; secondary 39A60, Applications of difference equations.

Keywords and phrases. Continuous time Markov process, Differential-difference equation, Fisher-KPP equation.

If there are two or more different branches of the same length present in the network, then at least two different miners must have different local blockchains. In a slow mining blockchain, this situation is resolved when a miner discovers a new block on top of one of the versions and propagates this new block to the rest of the miners. This has a high probability of occurring before any other miner discovers a new block. Our interest in this paper is to consider what will happen in a fast mining blockchain where the time that it takes to mine a new block is of the same order as the time that it takes to communicate the block to a second miner and for that miner to validate it - we call this the propagation delay. In this case, it is likely that other blocks will be mined while newly discovered blocks are being propagated and it is not clear that the local blockchains at the different miners will ever be the same.

We build on previous models of the blockchain forking process [24, 13] to consider fast mining blockchains. We develop a simple continuous-time Markov chain (CTMC) model for this case to examine whether the community of miners will ever reach consensus. Proposition 1 shows that no matter how far the blockchains at the individual miners diverge, the local blockchains will almost surely return to consensus in finite expected time. Furthermore, even as the mining delay becomes so short that consensus is only rarely reached, we demonstrate using a functional law of large numbers that miners typically agree on all blocks except those that lie within a bounded distance of the head of the longest local blockchain.

Specifically, in the limit of infinitely many miners, our fast mining blockchain model satisfies a functional law of large numbers, [6 Theorem 3.1], and hence the limiting miner density profile satisfies a deterministic system of ODEs. The limiting distribution function of miner heights then satisfies the nonlinear differential-difference equation (Proposition 8)

{φ˙n(t)=−λ(φn−φn−1)−ωφn(1−φn),n≥0,φn(0)=1,n≥0,(1)\begin{cases} \dot{\varphi}_n(t)=-\lambda(\varphi_n-\varphi_{n-1})-\omega\varphi_n(1-\varphi_n), & n\ge0,\\ \varphi_n(0)=1, & n\ge0, \tag*{(1)} \end{cases}

with boundary condition φ−1≡0\varphi_{-1}\equiv0. This system of equations forms the basis of study for the rest of the paper. We note here that our system only includes a first order difference and that a related system with second order difference was studied in [12].

Convergence of the limiting distribution function profile in the large height and large time limit is given by Theorem 12 in § 4. This result is proved using a commuting frame and technical uniform estimates. This limiting profile is a traveling wave profile with shape defined implicitly by Theorem 12, and admits the universal leading order logarithmic Bramson correction to the wave speed. We demonstrate this via an asymptotic argument originally due to [16]. By comparison with a continuum approximation and application of Painlevé integrability for a special choice of rates [2] we provide an explicit approximate analytic formula for the shape of the limiting profile. We confirm a good fit with the corresponding solution of (1.1) by numerical comparison.

The convergence of the travelling wave speed of the finite NN-miner process to the travelling wave speed of the limiting N=∞N=\infty-miner process is shown to exhibit Brunet-Derrida behaviour, that is a logarithmic correction in NN first observed in [16] for a cut-off modified Fisher-KPP system.

Outline of paper

The rest of the paper is organised as follows: In § 2 we formally define our blockchain mining model and prove consensus is positive recurrent for any finite number of miners. In § 3, we show that that the height dynamics of our blockchain model, under a normalised occupation representation, satisfies a functional law of large numbers. We then derive and state the set of equations (18) which form the basis for the analysis of the rest of the paper. In § 4, we show that the sequence of solutions to (18) converge uniformly to a limiting profile, in an appropriate moving frame - this result is stated formally in Theorem 12. In § 5, we derive an explicit expression for the position of the travelling front and its leading order logarithmic Bramson correction using an asymptotic analysis [16]. We then provide an approximate analytic expression for the limiting profile. We obtain this expression using an asymptotic argument that reduces our set of equations (18) to a travelling wave Fisher-KPP equation with drift, and then applying a result from [2], which gives an explicit analytic solution made possible by theory concerning Painlevé integrability. In Section 6, we derive an explicit expression for the shift in speed of the travelling wave for a finite number of miners compared to that obtained in the infinite miner limit. Via an application of a perturbation computation from [16], this leads to a logarithmic Brunet-Derrida correction.

Model motivation: Blockchain mining

Our model

Our model of the blockchain for NN miners is expressed in terms of a continuous-time Markov chain (CTMC) with states

B=(B1,B2,…,BN)∈BN,N≥2,B = (B_1,B_2,\ldots,B_N) \in\mathbb{B}^{N}, \qquad N \ge2,

with each component taking values in the space of positive increasing finite integer sequences with first value equal to 1, that is

B:={B∈⋃n≥1Nn∣1=b1<b2⋯<bn},\mathbb{B} := \left\{ B \in\bigcup_{n\ge1} \mathbb{N}^{n} \mid1 = b^{1} < b^{2} \cdots< b^{n} \right\},

where bjb^{j} is the jjth sequential component of BB. We interpret BiB_i as representing the sequence of connected blocks of the iith miner, which we call its local blockchain, and assume all miners begin mining on top of the first block, called the genesis block, with block label b1=1b^{1}=1. We say this local blockchain has ∣Bi∣|B_i| blocks with distance from the genesis block equal to ∣Bi∣−1|B_i|-1, which we call its height. The space B\mathbb{B} represents the space of all possible local blockchains.

Mining

Each miner is continuously trying to mine the next block, with successes occurring according to a Poisson process with parameter λ>0\lambda> 0. It follows that, at any given time t≥0t \ge0, the total number of blocks L(t)∈NL(t) \in\mathbb{N}, equivalently the label of the most recently mined block, is distributed as

L(t)∼1+Poisson⁡(Nλt).L(t) \sim1 + \operatorname{Poisson}(N\lambda t).

Block propagation

Each miner continuously communicates their local blockchain to the other N−1N-1 miners according to a Poisson process with parameter ω>0\omega> 0. Whenever such a communication event occurs, with uniform probability 1N−1\frac{1}{N-1} a given one of the other N−1N-1 miners receives the communication. In this case, it will perform the necessary proof-of-work tests, and if the newly received blockchain is both valid, and has height greater than the height of the receiving miner’s current local blockchain, it will abandon its local blockchain and start mining on top of this newly received local blockchain. We call this a block propagation event. Any blocks that were in the receiving miner’s abandoned local blockchain that are not present elsewhere in the network are called orphan blocks. They cannot be present in the long-term blockchain.

To illustrate, if the jjth miner sends the communication and the iith miner receives the communication, then we say a block propagation event occurs from miner jj to miner ii, if the height of the local blockchain of miner jj is greater than that of miner ii, that is, ∣Bj∣>∣Bi∣|B_j| > |B_i|. In this case, we say that miner jj has propagated its local blockchain to miner ii. If ∣Bj∣≤∣Bi∣|B_j| \le|B_i|, then miner ii ignores the communication from miner jj and will continue to mine on its current local blockchain.

Consensus

We say the network of miners BB is in consensus if

Bi=Bj,for all i,j∈[N],(2)B_i = B_j,\qquad\text{for all } i,j \in[N], \tag*{(2)}

that is, all local blockchains are identical.

Blocktree

There is always a connected sequence of at least one block at the beginning of each local blockchain that every miner agrees on. It follows that each state BB corresponds to a rooted tree, which we call the Blocktree.

Example: N=7N=7 miners

Consider a state BB where the local blockchains are given by

Bi(t)={(1,2,3),if i=1,(1,2,4),if i=2,5,(1,2,3,6),if i=6,(1,2,3,5,8),if i=3,4,7.(3)B_i(t)= \begin{cases} (1,2,3), & \text{if } i=1,\\ (1,2,4), & \text{if } i=2,5,\\ (1,2,3,6), & \text{if } i=6,\\ (1,2,3,5,8), & \text{if } i=3,4,7. \end{cases} \tag*{(3)}

This state corresponds to the blocktree illustrated in Figure 1. The longest local blockchain is (1,2,3,5,8)(1,2,3,5,8), with height equal to 4, which miners 3, 4, 7 know about. The block with label 7 is not present in any of the local blockchains. This must be because block 8 was mined on top of block 5 by one of the three miners 3, 4, 7 and then propagated to the other two miners, one of which had previously mined block 7. Block 7 is thus an example of an orphan block: it does not belong to any local blockchain, and will not be present in the long term blocktree.

Figure 1. The blocktree corresponding to (3): The nodes represent blocks with their respective block labels; the numbers next to the nodes represent miners whose local blockchain ends in that node. The block with label 7 is an orphan block and is no longer considered part of the blocktree.

There are many possible transitions out of the blocktree state (3). Every miner is continuously competing to mine the next block with block label 9, and longer local blockchains are continuously being propagated to miners with shorter local blockchains.

Markov generator

We now formally define the Markov dynamics of our blockchain model. The positive integer b:=max⁡i∈[N]bi∣Bi∣b := \max_{i\in[N]} b_i^{|B_i|} is the largest block label in BB, B⊕ibB \oplus_i b is the state produced by appending the block b∈Nb \in\mathbb{N} to the ithi^{\mathrm{th}} component of BB, and Bi→jB^{i\to j} denotes the state obtained from BB by setting the ithi^{\mathrm{th}} component equal to the jthj^{\mathrm{th}} component.

There are infinitely-many consensus states satisfying (2). In this section, but not the rest of the paper where block heights will be important, we shall combine all of these states into a single consensus state 1N\mathbf{1}_N. This doesn’t affect the dynamics of the Markov chain because all blocks of height less than or equal to the highest labelled block in a consensus blocktree are guaranteed to remain forever.

With initial condition B(0)=1NB(0)=\mathbf{1}_N the blocktree state

B(t):=(B1(t),B2(t),…,BN(t))∈BN,t≥0,B(t) := (B_1(t),B_2(t),\ldots,B_N(t)) \in\mathbb{B}^N,\qquad t\geq0,

evolves as a CTMC with transition rates given by

qB(B→B⊕i(b+1)):=λ,i∈[N](4)q^{B}\left(B \to B\oplus_i(b+1)\right):=\lambda,\qquad i\in[N] \tag*{(4)}
qB(B→Bi→j):=ωN−11∣Bj∣>∣Bi∣,i,j∈[N], i≠j(5)q^{B}\left(B\to B^{i\to j}\right):=\frac{\omega}{N-1}\mathbf{1}_{\lvert B_j\rvert>\lvert B_i\rvert},\qquad i,j\in[N],\ i\ne j \tag*{(5)}

for any B∈BNB\in\mathbb{B}^N. These two transitions model mining and block propagation dynamics respectively.

We implement combining all consensus states into a single state by also requiring that

qB((B,…,B,Bi,B,…,B)→b1N):=ω1∣B∣>∣Bi∣,i∈[N].(6)q^{B}\left((B,\ldots,B,B_i,B,\ldots,B)\to b\mathbf{1}_N\right):=\omega\mathbf{1}_{\lvert B\rvert>\lvert B_i\rvert},\qquad i\in[N]. \tag*{(6)}

This transition occurs when one of the miners not equal to ii communicates their local blockchain to miner ii.

Consensus dynamics

Our first result is that the consensus state is positive recurrent for the blocktree process B(t)B(t).

Proposition 1. The consensus state (2) is positive recurrent for all 2≤N<∞2\leq N<\infty.

Proof. For consensus to occur: (1) a new block must be mined that is higher than any other block, and (2) that block must be propagated to every other miner before any other block is mined at that same height. We will find a lower bound for the probability of this sequence of transitions occurring by considering a more restricted sequence of transitions: (1) a new highest block is mined, and (2) that block is propagated to all other miners before any other blocks are mined or propagated. In this restricted sequence of transitions we are ruling out mining and propagation of blocks other than the one that increased the maximum height of all the local blockchains.

Consider the probability that the next transition is a mining event that generates a new block. In any given state there are NN mining transitions each of rate λ\lambda and 2(N2)2\binom{N}{2} communication events each of rate ω/(N−1)\omega/(N-1) at most half of which can result in a block propagation transition. The probability that the next transition is mining a new ‘highest’ block is

Phighest≥λNλ+Nω2,P_{\mathrm{highest}}\geq\frac{\lambda}{N\lambda+\frac{N\omega}{2}},

because there is at least one miner mining on the local blockchain of maximum height. If nn miners have already received this new highest block then there are N−nN-n miners still yet to receive it. Then the probability that the next transition will be propagation of that block is at least

ωN−1n(N−n)Nλ+Nω2.\frac{\frac{\omega}{N-1}n(N-n)}{N\lambda+\frac{N\omega}{2}}.

Therefore the probability that the next N−1N-1 transitions after mining a new highest block result in propagation of that block to the rest of the network is

Pprop≥∏n=1N−1ωN−1n(N−n)Nλ+Nω2=(ωN−1)N−1(N−1)!2(Nλ+Nω2)N−1.P_{\mathrm{prop}} \ge\prod_{n=1}^{N-1} \frac{\frac{\omega}{N-1}n(N-n)}{N\lambda+\frac{N\omega}{2}} = \frac{\left(\frac{\omega}{N-1}\right)^{N-1}(N-1)!^2}{\left(N\lambda+\frac{N\omega}{2}\right)^{N-1}}.

Regardless of what state the CTMC is in, there is at least a probability of PhighestPpropP_{\mathrm{highest}}P_{\mathrm{prop}} that a new highest block is mined and then propagated to all the other miners before any other blocks are mined. Thus the NN-step transition probability to consensus from any state is

Pcons≥Pcons∗:=λNλ+Nω2(ωN−1)N−1(N−1)!2(Nλ+Nω2)N−1.P_{\mathrm{cons}} \ge P_{\mathrm{cons}}^* := \frac{\lambda}{N\lambda+\frac{N\omega}{2}}\frac{\left(\frac{\omega}{N-1}\right)^{N-1}(N-1)!^2}{\left(N\lambda+\frac{N\omega}{2}\right)^{N-1}}.

This lower bound does not depend on the state of the blockchain (no matter how fragmented the blockchain has become there is still a path to consensus in NN steps with a probability of at least Pcons∗>0P_{\mathrm{cons}}^*>0 of occurring). If we think of the chain embedded at every NN steps, then it either reaches consensus after the next NN steps or it doesn’t. Whether it does or not can be regarded as a Bernoulli trial that has a positive probability PconsP_{\mathrm{cons}} of success. It follows that the expected time until the first success is finite and so the chain reaches consensus with probability 1 in finite expected time. Consensus is thus positive recurrent.

Remark 2. We can also bound the probability of transitioning into the consensus state from above. The probability of mining a new highest block as the next transition could be as high as 1, but the probability of transmitting it successfully to all other miners prior to another block being mined is at most

∏n=1N−1n(N−n)ωN−1Nλ+n(N−n)ωN−1≤∏n=1N−1(N2/4)ωN(N−1)λ+(N2/4)ω=(1+4(N−1)λNω)1−N.\prod_{n=1}^{N-1}\frac{n(N-n)\frac{\omega}{N-1}}{N\lambda+n(N-n)\frac{\omega}{N-1}} \le\prod_{n=1}^{N-1}\frac{(N^2/4)\omega}{N(N-1)\lambda+(N^2/4)\omega} = \left(1+\frac{4(N-1)\lambda}{N\omega}\right)^{1-N}.

Therefore the consensus state can become very rare even for modest values of the ratio λ/ω\lambda/\omega.

Height dynamics and the N→∞N \to\infty limit

In this section and the rest of the paper, our main concern is the evolution of blockchain heights. For this reason, we will no longer collapse all consensus states into a single state via the transition (6). Our Markov model will be defined entirely by the mining process with transition rates (4) and the propagation process with transition rates (5).

Height function

To track the data of local blockchain heights we define the height function obtained through the mapping B↦h(B)B \mapsto h(B) defined by

References

  1. [1]ABLOWITZ, M. and ZEPPETELLA, A. (1978). Multidimensional nonlinear diffusion arising in population genetics. Advances in Mathematics 30 33-76. https://doi.org/10.1016/0001-8708(78)90130-5
  2. [2]ABLOWITZ, M. and ZEPPETELLA, A. (1979). Explicit solutions of Fisher’s equation for a special wave speed. Bulletin of Mathematical Biology 41 835-840. https://doi.org/10.1007/BF02462380
  3. [3]ABRAMOWITZ, M. and STEGUN, I. (1970). Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables.
  4. [4]ADDARIO-BERRY, L. and REED, B. (2009). Minima in branching random walks. The Annals of Probability 37 1044-1079. https://doi.org/10.1214/08-AOP428
  5. [5]AÏDÉKON, E. (2013). Convergence in Law of the Minimum of a Branching Random Walk. The Annals of Probability 41 1362–1426. https://doi.org/10.1214/12-AOP750
  6. [6]BARBOUR, A. D. and LUCZAK, M. J. (2008). Laws of Large Numbers for Epidemic Models with Countably Many Types. The Annals of Applied Probability 18 2208–2238.
  7. [7]Baryshnikov, Y. and Stolyar, A. (2025). A large-scale particle system with independent jumps and distributed synchronization. Advances in Applied Probability 57 677-707. https://doi.org/10.1017/apr.2024.53
  8. [8]Benguria, R., Depassier, M. C. and Loss, M. (2008). Upper and lower bounds for the speed of pulled fronts with a cut-off. European Physical Journal B 61 331–334. https://doi.org/10.1140/epjb/e2008-00069-1
  9. [9]Benguria, R. D. and Depassier, M. C. (2007). On the speed of pulled fronts with a cutoff. Phys. Rev. E 75. https://doi.org/10.1103/PhysRevE.75.051106
  10. [10]Bérard, J. (2008). An example of Brunet–Derrida behavior for a branching-selection particle system on Z. https://doi.org/10.48550/arXiv.0810.5567
  11. [11]Bérard, J. and Baptiste-Gouéré, R. (2010). Brunet-Derrida Behavior of Branching-Selection Particle Systems on the Line. Commun. Math. Phys. 298 323-342. https://doi.org/10.1007/s00220-010-1067-y
  12. [12]Besse, C., Faye, G., Roquejoffre, J. M. and Zhang, M. (2023). The logarithmic Bramson correction for Fisher-KPP equations on the lattice Z. Transactions of the American Mathematical Society 376 8553–8619. https://doi.org/10.1090/tran/9007
  13. [13]Bowden, R., Keeler, H. P., Krzesinski, A. E. and Taylor, P. G. (2020). Block arrivals in the Bitcoin blockchain. Stochastic Models 36 602–637.
  14. [14]Bramson, M. (1978). Maximal displacement of branching brownian motion. Communications on Pure and Applied Mathematics 31 531-581. https://doi.org/10.1002/CPA.3160310502
  15. [15]Bramson, M. (1983). Convergence of solutions of the Kolmogorov equation to travelling waves. Memoirs of the American Mathematical Society 44 0-0. https://doi.org/10.1090/MEMO/0285
  16. [16]Brunet, E. and Derrida, B. (1997). Shift in the velocity of a front due to a cutoff. Phys. Rev. E 56 2597–2604. https://doi.org/10.1103/PhysRevE.56.2597
  17. [17]Brunet, E. and Derrida, B. (1999). Microscopic models of traveling wave equations. Computer Physics Communications 121–122 376–381. https://doi.org/10.1016/S0010-4655(99)00358-6
  18. [18]Brunet, E. and Derrida, B. (2001). Effect of Microscopic Noise on Front Propagation. Journal of Statistical Physics 103 269–282. https://doi.org/10.1023/A:1004875804376
  19. [19]Collet, P. and Eckmann, J. P. (1990). Instabilities and Fronts in Extended Systems. Princeton Series in Physics.
  20. [20]Corless, R. M., Gonnet, G. H., Hare, D. E., Jeffrey, D. J. and Knuth, D. E. (1996). On the Lambert W function. Advances in Computational Mathematics 5 329–359. https://doi.org/10.1007/BF02124750
  21. [21]Dee, G. and Langer, J. S. (1983). Propagating Pattern Selection. Phys. Rev. Lett. 50 383–386. https://doi.org/10.1103/PhysRevLett.50.383
  22. [22]Freddy Dumortier, T. J. K., Nikola Popović (2007). The critical wave speed for the Fisher–Kolmogorov–Petrovskii–Piscounov equation with cut-off. Nonlinearity 20 855–877. https://doi.org/10.1088/0951-7715/20/4/004
  23. [23]Greenberg, A. G., Shenker, S. and Stolyar, A. L. (1996). Asynchronous updates in large parallel systems. SIGMETRICS Performance Eval. Rev. 24 91–103. https://doi.org/10.1145/233013.233028
  24. [24]Göbel, J., Keeler, P., Krzesinski, A. E. and Taylor, P. G. (2016). Bitcoin Blockchain Dynamics: the Selfish-Mine Strategy in the Presence of Propagation Delay. Performance Evaluation 104 23–41.arxiv.org/abs/1505.05343
  25. [25]Hamel, F., Nolen, J., Roquejoffre, J.-M. and Ryzhik, L. (2013). A short proof of the logarithmic Bramson correction in Fisher-KPP equations. Networks & Heterogeneous Media 8 275–289. https://doi.org/10.3934/nhm.2013.8.275
  26. [26]Kurtz, T. (1980). Relationships between stochastic and deterministic population models. Biological Growth and Spread. Lecture Notes in Biomathematics 38 449–467. https://doi.org/10.1007/978-3-642-61850-5_39
  27. [27]MathewsJr, W. N., Esrick, M. A., Teoh, Z. Y. and Freericks, J. K. (2022). A physicist’s guide to the solution of Kummer’s equation and confluent hypergeometric functions. Condensed Matter Physics 25 1-23. https://doi.org/10.5488/CMP.25.33203
  28. [28]Mueller, C., Mytnik, L. and Quastel, J. (2011). Effect of noise on front propagation in reaction-diffusion equations of KPP type. Inventions Mathematicae 184 405–453. https://doi.org/10.1007/s00222-010-0292-5
  29. [29]Rudin, W. (1976). Principles of Mathematical Analysis.
  30. [30]Stolyar, A. L. (2023). Large-scale behavior of a particle system with mean-field interaction: traveling wave solutions. Advances in Applied Probability 55 151–186. https://doi.org/10.1017/apr.2022.24
  31. [31]Stolyar, A. L. (2023). A Particle System with Mean-Field Interaction: Large-Scale Limit of Stationary Distributions. Stochastic Systems 13 343–359. https://doi.org/10.1287/stsy.2023.0108
  32. [32]Van Saarloos, W. (1987). Dynamical Velocity Selection: Marginal Stability. Phys. Rev. Lett. 58 2571–2574. https://doi.org/10.1103/PhysRevLett.58.2571
  33. [33]VAN SAARLOOS, W. (1988). Front propagation into unstable states: Marginal stability as a dynamical mechanism for velocity selection. Phys. Rev. A 37 211–229. https://doi.org/10.1103/PhysRevA.37.211
  34. [34]VAN SAARLOOS, W. (1989). Front propagation into unstable states. II. Linear versus nonlinear marginal stability and rate of convergence. Phys. Rev. A 39 6367–6390. https://doi.org/10.1103/PhysRevA.39.6367

Paper details

vlnc:W_d5xy5ujz
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.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents