For , , , the friction memory kernel and its Laplace transform are
Using the generalized fluctuation-dissipation relation with equilibrium velocity variance , the velocity autocorrelation function has Laplace transform
All three poles are negative, so the stationary relaxation is stable. A partial fraction decomposition gives
Taking the inverse Laplace transform gives
The negative middle coefficient is compatible with an autocorrelation function; individual terms in a partial fraction decomposition need not themselves be separate physical modes with positive weights. Several useful checks follow directly:
The Volterra integral equation for predicts exactly and . Its integral is also , agreeing with the Green-Kubo formula for diffusion.
We use the equilibrium generalized Langevin equation and its generalized fluctuation-dissipation relation, with the factor in the noise autocorrelation fixing the equilibrium velocity variance. Let be the velocity relaxation function and let a tilde denote a one-sided Laplace transform:
The equilibrium velocity autocorrelation function is , so
For completeness, this relation follows without assuming independence of the noise and velocity in a stationary infinite history. The two-sided noise power spectral density is . The stable linear equation has velocity transfer function , so
This is precisely the power spectral density of the even extension of . Stable relaxation removes initial transients with a finite second moment, giving the long-time autocorrelation function defined in the question. All the parameter choices used below have stable relaxation.
Integrating the velocity autocorrelation function twice gives the mean squared displacement from a fixed initial position:
A decaying initial transient does not change its asymptotic slope. Therefore the Green-Kubo formula for diffusion gives
For the given friction memory kernel, direct integration yields
At , the integrated friction is , hence
The relaxation denominator here is . Its roots have negative real parts by the cubic Routh-Hurwitz criterion, since all coefficients are positive and . This justifies the decay and integrability used above. The diffusion coefficient depends on the area under the friction memory kernel, not just its value at zero.
For a radial function in three dimensions, the Laplacian is , while the imposed radial drift contributes . Thus the radial generator of an SDE diffusion is
The hitting probability for the inner sphere is harmonic for this diffusion generator in the shell, with value one on the inner sphere and zero on the outer sphere. At , the boundary value problem is therefore
Integrating gives . The two boundary conditions determine
Both arguments of the logarithms are dimensionless. The result decreases from one to zero across the shell and lies strictly between zero and one for .
For a direct probability interpretation, stop at the first contact with either sphere. The stopped process is a bounded martingale by Itô's formula. The shell has positive inner radius, so its drift is bounded and its diffusion is nondegenerate; exit occurs almost surely. Optional stopping and dominated convergence therefore give
The logarithm appears because the inward drift cancels one of the two geometric terms in the three-dimensional radial Laplacian, leaving the same radial diffusion generator as a planar Brownian motion with diffusion coefficient one.
At the transverse coordinates are independent Brownian motions with diffusion coefficient . The cylinder is infinitely long, so the axial coordinate cannot affect its first contact time. By rotational invariance of Brownian motion, the mean first-passage time depends only on the transverse radius .
The Kolmogorov backward equation for a mean first-passage time is . Here , so the radial boundary value problem is
The absorbing boundary condition for a diffusion is imposed on the circular cross-section. At , the solution must extend smoothly over the axis. Multiplying by and integrating gives
Smoothness at the axis excludes the logarithm term, and fixes . Consequently
This also verifies the finiteness assumption behind the Kolmogorov backward equation. Let be the first contact time and apply the stopped Itô formula to the bounded nonnegative function just obtained. Its bounded derivatives on the disk make the stopped stochastic integral a martingale, giving
By monotone convergence, has finite expected value; continuity and dominated convergence then make the final term vanish as . Hence . In particular, the mean first-passage time is on the axis and tends to zero at the adsorbing wall.
The native PDF repeats in its list of independent noise terms, whereas its third stochastic differential equation uses . We use the intended three independent coordinate Brownian motions .
Put , and . Before the origin is reached, Itô's formula gives
The is the sum of three quadratic variation terms, each . The drift contribution is because the numerator is . The radial stochastic integral can be written using a scalar Brownian motion :
Thus is a squared Bessel process of dimension until it reaches zero. If this equation is taken globally with the usual nonnegative squared Bessel process continuation, taking expected values gives
The stochastic integral has zero expected value: stopping first at large levels bounds the integrands, yields a finite first moment for , and then makes finite, so the unrestricted integral is a square-integrable martingale.
Boundary qualification. The punctured domain in the question does not itself specify that continuation. The boundary classification of a Bessel process says that the origin is inaccessible from when , equivalently . In this parameter range the original stochastic differential equation is global in the stated domain and the boxed result holds as written.
For , we have : the origin is reached in finite time with probability one. One can also see accessibility directly from the radial generator of an SDE diffusion
For , the harmonic function is the probability of reaching zero before . Finite-time access follows by using the nonnegative function
in the stopped Itô formula; it bounds the expected value of the time to reach zero or . Letting gives almost sure finite hitting of zero. The coefficients of the original vector stochastic differential equation are undefined there, so its stated punctured-domain version has no prescribed long-time evolution in this range.
The natural continuing radial squared Bessel process gives , but stopping and holding the particle at the origin would give a different answer. Indeed, with the first hit of zero, Itô's formula for the stopped process gives
Since almost surely, dominated convergence applied to gives
Therefore is the usual continued-radial answer; for a boundary convention is necessary. It is not a uniquely defined limit for the punctured-domain model alone.
A product-Poisson stationary distribution is suggested by balancing the three reaction fluxes around the directed cycle of reaction complexes. If their mean counts are , this complex balance condition is
which gives and . This suggests the joint probability mass function
It is normalized because it is the product of two Poisson distributions. We verify it directly in the chemical master equation, rather than assuming a product-Poisson stationary distribution theorem. The three incoming terms satisfy
With negative-index values set to zero, these identities also hold on the axes. Their sum equals , precisely the outgoing probability flux. The stationary average total exit rate is , so these stationary balance equations do define an invariant distribution of a continuous-time Markov chain for the nonexplosive model verified below. This is complex balance; it does not assert pairwise detailed balance for the irreversible chemical reactions.
To identify this invariant distribution with the limiting probability distribution in the question, first check that the model is a nonexplosive continuous-time Markov chain. On any finite time interval, is bounded by its initial count plus the finite number of arrivals in a rate- Poisson process. Conditional on that bound, the rate of producing is bounded, so only finitely many such productions occur. The number of joint removals cannot exceed the available molecules. Thus only finitely many chemical reactions occur in finite time.
The continuous-time Markov chain is also an irreducible Markov chain. From a Markov chain state with both counts positive, repeated joint removals reduce both. On the axis, producing one and then removing a pair reduces by one. On the axis, adding one and then removing a pair reduces by one. Each prescribed finite sequence has positive probability, so every Markov chain state reaches . Conversely, arrivals followed by productions reach any with ; to reach , reach and remove one pair. The continuous-time Markov chain is therefore positive recurrent, and the continuous-time Markov chain convergence theorem gives from the empty initial condition.
The two Poisson factors happen to have cancelling numerical coefficients at :
Conditioning on the observed time. The native PDF defines as the first production time and then conditions on that production occurring at . If the intended information is its numerical value , the answer depends on . We first compute this conditional probability using a conditional probability density; conditioning on an exact value of a continuous random variable means a density ratio, since .
Before , no molecules of the second chemical species are present, so the joint-removal chemical reaction cannot occur. Molecules of the first chemical species arrive as a rate- Poisson process, and each independently starts a clock with a rate- exponential distribution for producing the first molecule of the second chemical species. Define the unnormalized probability mass function
The chemical master equation before the first production, with production treated as killing, is
Multiplying by and summing gives a partial differential equation for the probability generating function:
Its solution, verifiable by direct differentiation, is
Thus , the survival function is , and the conditional distribution of given survival to is a Poisson distribution of mean .
Production in from Markov chain state has joint probability . Therefore the probability density function of is
The first production leaves unchanged. Taking the density ratio gives a size-biased distribution of the surviving count:
In particular, under this reading the requested conditional probability is
The shift by one matters: an observation made exactly when production occurs preferentially selects larger counts, since their production reaction propensity function is larger.
Without observing the numerical time. If the conditioning merely repeats the definition of , the requested probability is instead the unconditional count at that stopping time. Before production, increases by one at rate , while production occurs at rate in Markov chain state . The competing exponential clocks imply
The first factor requires a second arrival before production from count one; the second requires production before a third arrival. The first arrival itself is certain. Production eventually occurs with probability one, as is also clear from . As a consistency check, averaging the time-conditioned answer against gives
These are two distinct, explicitly specified interpretations of the printed conditioning.
At the empty Markov chain state, only the constant-rate production chemical reaction is possible. Thus the first-passage time has an exponential distribution of rate :
Its expected value can be obtained by integrating this survival function, and its second moment by integrating times the survival function:
Consequently the requested expected value and variance are
Write and . The three stoichiometric vectors are , and . The law of mass action gives the respective reaction propensity functions
In particular, producing the second chemical species does not consume the first chemical species. Since the two reactants in the third chemical reaction are different chemical species, the number of possible pairs is .
For each Markov chain state, the chemical master equation adds incoming probability flux and subtracts outgoing probability flux:
Here if either index is negative, and the initial condition is . These conventions also give the correct chemical master equation on the coordinate axes: for example, the third chemical reaction has zero outgoing reaction propensity function when either chemical species is absent.
Let and let be a Lipschitz constant for . Since
both coefficients and are bounded and globally Lipschitz. The global existence theorem for stochastic differential equations with Lipschitz coefficients gives a unique global strong solution of a stochastic differential equation.
The same Itô formula cancellation as before gives
For , the stopped exponential is bounded between and . Continuity and strict positivity of give
The Itô isometry therefore yields
The monotone convergence theorem proves . The bounded optional stopping argument is now identical to part (b)(iii), and gives
Passing from level hitting to strict exceedances as in part (b)(iv),
No global positive lower bound on was needed: compact-interval positivity suffices for each exit argument. The law is independent of the particular because the scale function is always : its infinitesimal generator satisfies
This is the exponential scale function for a drift tied to diffusivity. Changing changes how quickly the path is traversed, but leaves these boundary probabilities and the maximum law unchanged.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact