Linear configuration count Created 2026-09-28 Updated 2026-10-03
The instantaneous kinematic viscosity law is , with no explicit constitutive memory. Expand its transported quantity at the possibly evolving background:
The viscous transport response exponent satisfies . Subtract the background equation and retain only linear terms to obtain
This remains a linear equation with space- and time-dependent background coefficients; neither a steady background nor constant is required for this step. The sign of the response coefficient is the negative-diffusion criterion for viscous disk instability.
For , the response is . A nonaccreting background has , while , so
Consequently . On this steady background, introduce the square-root-radius diffusion transform
Since is constant and , the linear equation becomes
Thus , and the required choice is
For a Fourier mode , . Positive kinematic viscosity makes have the sign of , so gives growing modes whose rate increases with . The formal equation is a backward heat equation and predicts arbitrarily rapid small-scale amplification. Physically the thin disc diffusion closure applies only to wavelengths sufficiently larger than the thickness and stress-relaxation scales; this formal limit identifies the need for a cutoff, rather than a finite fastest wavelength absent from the model. The boundary case has vanishing linear transport response.
Let interchange the two complete graphs, sending to and fixing . This involution preserves the transition matrix of the simple random walk. A mirror coupling under an involution starts at , keeps until the hitting time of , and then makes the two walks move identically. Each coordinate has the correct transition probabilities, and they coalesce precisely at . The coupling inequality for total variation gives
There is a genuine error in the printed expected hitting time bound, as well as an unspecified initial law. For , write and for . From every clique vertex there is a positive chance of reaching within two steps, uniformly over the finite state space for each fixed , so has finite expected value. First-step analysis, using the degree of a vertex at and at the other clique vertices, gives
Solving these linear equations yields
In particular even the attachment vertex exceeds the printed bound by one. The valid uniform replacement is , the hitting time of the bridge vertex between two cliques formula.
We must also handle arbitrary starting states, including , before applying the mirror argument. Identify related vertices and consider the lumped Markov chain on . Its transition matrix has for , , for and , and , with all other entries zero. Here the row for only ranges over .
For and , direct two-step calculation gives
All these entries are at least . Thus for every , where is the uniform distribution on a finite set and . This is a Doeblin condition. At each two-step block couple the two quotient endpoints to the same sample from with probability , using the residual probability distributions otherwise. The first successful block has expected value at most , so the alignment time has . Lift each endpoint coupling of probability distributions to the original walks by their conditional two-step path laws; this preserves every marginal path law. The success test uses fresh block randomness and so permits restarting the walks with their original transition matrix at the aligned endpoints.
At alignment the original walks are equal or related. Use identical transitions in the first case and the mirror coupling under an involution in the second. The resulting coalescing coupling has coalescence time satisfying for every pair of initial states. Therefore Markov inequality and the pairwise mixing diameter imply
For the hint's particular starting states, the quotient one-step laws from two different clique indices have a common component of mass at least : for two ordinary indices it is ; for one attachment index it is . A maximal coupling therefore aligns those indices with probability , as suggested. The two-step argument above additionally covers .
The nonlazy walk is an aperiodic Markov chain for , because the connected graph contains a triangle. For it is a periodic Markov chain on a bipartite graph; each bipartition class has stationary mass , and the walk stays on a single class at each time. Hence and the mixing time is infinite. The asymptotic conclusion is valid for .
Let . Then , and first-step analysis on the closed class gives
Solving these linear equations gives
The function is a harmonic function on the annulus . The Itô formula therefore makes a bounded martingale. The optional sampling theorem for a supermartingale gives
where . Solving this linear equation yields the planar Brownian annulus hitting probability
Seek a similarity solution in the dimensionally completed form
where the fixed scales absorb , and . Its inlet volume flux scales as
so the prescribed source requires
The time derivative, horizontal lubrication theory term, and pressure-dependent Darcy drainage term scale respectively as
Equating the three exponents gives
Solving these linear equations together with the inlet condition yields the similarity exponents of a draining gravity current
Equivalently,
and, up to constant dimensional scales,