Axonal transport, propelled by motor proteins, plays a crucial role in maintaining the homeostasis of functional and structural components over time. To establish a steady-state distribution of moving particles, what conditions are necessary for axonal transport? This question is pertinent, for instance, to both neurofilaments and mitochondria, which are structural and functional cargoes of axonal transport. In this paper we prove four theorems regarding steady state distributions of moving particles in one dimension on a finite domain. Three of the theorems consider cases where particles approach a uniform distribution at large time. Two consider periodic boundary conditions and one considers reflecting boundary conditions. The other theorem considers reflecting boundary conditions where the velocity is space dependent. If the theoretical results hold in the complex setting of the cell, they would imply that the uniform distribution of neurofilaments observed under healthy conditions appears to require a continuous distribution of neurofilament velocities. Similarly, the spatial distribution of axonal mitochondria may be linked to spatially dependent transport velocities that remain invariant over time.
Fluorescence Recovery After Photobleaching (FRAP) has been extensively used to understand molecular dynamics in cells. This technique when applied to soluble, globular molecules driven by diffusion is easily interpreted and well understood. However, the classical methods of analysis cannot be applied to anisotropic structures subjected to directed transport, such as cytoskeletal filaments or elongated organelles transported along microtubule tracks. A new mathematical approach is needed to analyze FRAP data in this context and determine what information can be obtain from such experiments. To address these questions, we analyze fluorescence intensity profile curves after photobleaching of fluorescently labelled intermediate filaments anterogradely transported along microtubules. We apply the analysis to intermediate filament data to determine information about the filament motion. Our analysis consists of deriving equations for fluorescence intensity profiles and developing a mathematical model for the motion of filaments and simulating the model. Two closed forms for profile curves were derived, one for filaments of constant length and one for filaments with constant velocity, and three types of simulation were carried out. In the first type of simulation, the filaments have random velocities which are constant for the duration of the simulation. In the second type, filaments have random velocities which instantaneously change at random times. In the third type, filaments have random velocities and exhibit pausing between velocity changes. Our analysis shows: the most important distribution governing the shape of the intensity profile curves obtained from filaments is the distribution of the filament velocity. Furthermore, filament length which is constant during the experiment, had little impact on intensity profile curves. Finally, gamma distributions for the filament velocity with pauses give the best fit to asymmetric fluorescence intensity profiles of intermediate filaments observed in FRAP experiments performed in polarized migrating astrocytes. Our analysis also shows that the majority of filaments are stationary. Overall, our data give new insight into the regulation of intermediate filament dynamics during cell migration.
The mean square displacement (MSD) is an important statistical measure on a stochastic process or a trajectory. In this paper we find an approximation to the mean square displacement for a model of cell motion. The model is a discrete-time jump process which approximates a force-based model for cell motion. In cell motion, the mean square displacement not only gives a measure of overall drift, but it is also an indicator of mode of transport. The key to finding the approximation is to find the mean square displacement for a subset of the state space and use it as an approximation for the entire state space. We give some intuition as to why this is an unexpectedly good approximation. A lower bound and upper bound for the mean square displacement are also given. We show that, although the upper bound is far from the computed mean square displacement, in rare cases the large displacements are approached.
We consider a force-based model for cell motion which models cell forces using Hooke's law and a random outreach from the cell center. In previous work this model was simplified to track the centroid by setting the relaxation time to zero, and a formula for the expected velocity of the centroid was derived. Here we extend that formula to allow for chemotaxis of the cell by allowing the outreach distribution to depend on the spatial location of the centroid.
Numerical simulations suggest that average velocity of a biological cell depends largely on attachment dynamics and less on the forces exerted by the cell. We determine the relationship between two models of cell motion, one based on finite spring constants modeling attachment properties (a randomly switched differential equation) and a limiting case (a centroid model-a generalized random walk) where spring constants are infinite. We prove the main result of this paper, the Expected Velocity Relationship theorem. This result shows that the expected value of the difference between cell locations in the differential equation model at the initial time and at some elapsed time is proportional to the elapsed time. We also show that the relationship is time invariant. Numerical results show the model is consistent with experimental data.
This paper considers differential problems with random switching, with specific applications to the motion of cells and centrally coordinated motion. Starting with a differential-equation model of cell motion that was proposed previously, we set the relaxation time to zero and consider the simpler model that results. We prove that this model is well-posed, in the sense that it corresponds to a pure jump-type continuous-time Markov process (without explosion). We then describe the model's long-time behavior, first by specifying an attracting steady-state distribution for a projection of the model, then by examining the expected location of the cell center when the initial data is compatible with that steady-state. Under such conditions, we present a formula for the expected velocity and give a rigorous proof of that formula's validity. We conclude the paper with a comparison between these theoretical results and the results of numerical simulations.
In this paper the motion of a single cell is modeled as a nucleus and multiple integrin based adhesion sites. Numerical simulations and analysis of the model indicate that when the stochastic nature of the adhesion sites is a memoryless and force independent random process, the cell speed is independent of the force these adhesion sites exert on the cell. Furthermore, understanding the dynamics of the attachment and detachment of the adhesion sites is key to predicting cell speed. We introduce a differential equation describing the cell motion and then introduce a conjecture about the expected drift of the cell, the expected average velocity relation conjecture. Using Markov chain theory, we analyze our conjecture in the context of a related (but simpler) model of cell motion, and then numerically compare the results for the simpler model and the full differential equation model. We also heuristically describe the relationship between the simplified and full models as well as provide a discussion of the biological significance of these results.
We extend Sharkovsky's Theorem to several new classes of spaces, which include some well-known examples of non-locally connected continua, such as the topologist's sine curve and the Warsaw circle. In some of these examples the theorem applies directly (with the same ordering), and in other examples the theorem requires an altered partial ordering on the integers. In the latter case, we describe all possible sets of periods for functions on such spaces, which are based on multiples of Sharkovsky's order.
In this paper we clarify the relationship between the Rasch model, additive conjoint measurement, and Luce and Tukey's (1964) axiomatization of additive conjoint measurement. We prove a theorem which links the Rasch model with additive conjoint measurement.
In this paper, neighborhood monotonicity is presented as a natural property for methods of ranking generalized tournaments (directed graphs with weighted edges). An extension of Zermelo’s classical method of ranking tournaments is shown to have this property. An estimate is made of the proportion of ordered pairs that all neighborhood-monotonic rankings of symmetric knockout tournaments have in common. Finally, numerical evidence for the asymptotic behavior of the extended Zermelo ranking of symmetric knockout tournaments is presented.
The mathematical model that Zermelo developed for ranking by paired comparisons and that was later popularized by Bradley and Terry has several attractive theoretical properties, but computation of the associated ratings may involve solution of a system of several high-degree polynomial equations in several variables. This paper describes how to define quantities analogous to electrical resistance and conductance for certain generalized tournaments in such a way that these quantities are well-behaved with respect to certain types of decomposition of tournaments and permit comparison of the ratings of pairs of nodes. Application of this theory is illustrated through consideration of specific examples.
The discrete Allen-Cahn and Cahn-Hilliard equations are (continuous time) lattice differential equations that are analogues of two well-studied parabolic partial differential equations of materials science, and that model the evolution of, respectively, a conserved, or nonconserved, quantity, which has two preferred homogeneous phases and which avoids spatial inhomogenieties. If the interaction length nu is small, equilibrium states are scattered throughout phase space, but as nu increases most of these equilibria disappear. As they do so, the system passes through a transitional stage known as dynamical metastability, during which true equilibrium solutions are difficult to distinguish from solutions that evolve slowly but eventually traverse long distances. This paper contains results on the grain sizes of genuine equilibria that help make this distinction possible. In particular, lower bounds on grain sizes and connections between the grain sizes of adjacent grains and next-nearest neighbors are established.
The discrete Allen-Cahn equation is a spatially discrete analogue of the Allen-Cahn equation, a parabolic partial differential equation proposed as a simple model for phase separation in materials. In some sense, the solutions of the discrete equation display a richer variety of behaviors than do the corresponding solutions of the continuous equation. In particular, the number of stationary solutions of the two equations may not agree, even when the lattice of the discrete equation is extremely fine. We will discuss this phenomenon, as well as its implications in areas such as dynamical metastability.
A nonlinear convection-diffusion equation with boundary conditions that conserve the spatial integral of the solution is considered. Previous results on finite-time blowup of solutions and on decay of solutions to the corresponding Cauchy problem were based on the assumption that the nonlinearity obeyed a power law. In this paper, it is shown that assumptions on the growth rate of the nonlinearity, which take the form of weak superquadraticity and strong superlinearity criteria, are sufficient to imply that a large class of nonnegative solutions blow up in finite time.
In 1929, Zermelo proposed a probabilistic model for ranking by paired comparisons and showed that this model produces a unique ranking of the objects under consideration when the outcome matrix is irreducible. When the matrix is reducible, the model may yield only a partial ordering of the objects. In this paper, we analyse a natural extension of Zermelo's model resulting from a singular perturbation. We show that this extension produces a ranking for arbitrary (nonnegative) outcome matrices and retains several of the desirable properties of the original model. In addition, we discuss computational techniques and provide examples of their use.
This paper addresses the qualitative behavior of a nonlinear convection-diffusion equation on a smooth bounded domain in Rn, in which the strength of the convection grows superlinearly as the density increases. While the initial-boundary value problem is guaranteed to have a local-in-time solution for smooth initial data, it is possible for this solution to be extinguished in finite time. We demonstrate that the way this may occur is through finite-time “blow up,” i.e., the unboundedness of the solution in arbitrarily small neighborhoods of one or more points in the closure of the spatial domain. In special circumstances, such as the presence of radial symmetry, the set of blowup points can be identified; these points may be either on the boundary or on the interior of the domain. Furthermore, criteria can be established that guarantee that blowup occurs. In this paper, such criteria are presented, involving the dimension of the space, the growth rate of the nonlinearity, the strength of the imposed convection field, the diameter of the domain, and the mass of the initial data. Furthermore, the temporal rate of blowup is estimated.
This paper deals with a parabolic partial differential equation that incorporates diffusion and convection terms and that previously has been shown to have solutions that become unbounded at a single point in finite time. The results presented here describe the limiting behavior of the solution in a neighborhood of the blowup point, as well as the asymptotic growth rate as the blowup time is approached. Rigorous estimates are proved, and some supplementary numerical calculations are presented.
It has recently been proposed that spatially discretized versions of the Alien-Cahn and Cahn-Hilliard equations for modelling phase transitions have certain theoretical and phenomenological advantages over their continuous counterparts. This paper deals with one-dimensional discretizations and examines the extent to which dynamical metastability, which manifests itself in the original partial differential equations in the form of solutions with slowly-moving transition layers, is also present for the discrete equations. It is shown that, in fact, there are transition-layer solutions that evolve at a speed bounded by C1 epsilon (1+C2/(n epsilon ))-C3n+C4 for all n>or=n0 and epsilon <or= epsilon 0, where 1/n is the spatial mesh size, epsilon is the interaction length, and n0 and epsilon 0 are constants.
In this paper one-dimensional Cahn–Morral systems, which are the multicomponent analogues of the Cahn–Hilliard model for phase separation and coarsening in binary mixtures, are studied. In particular, there is an examination of solutions that start with initial data close to the preferred phases except at finitely many transition points where the data has sharp transition layers, and it is shown that such solutions may evolve exponentially slowly, i.e., if $\varepsilon $ is the interaction length then there exists a constant C such that in $\exp ({C / \varepsilon })$ units of time the change in such a solution is $o(1)$. This corresponds to extremely slow coarsening of a multicomponent mixture after it has undergone fine-grained decomposition.
The Cahn-Hilliard equation is a fourth-order parabolic partial differential equation that is one of the leading models for the study of phase separation in isothermal, isotropic, binary mixtures, such as molten alloys. When a spatially homogeneous alloy is rapidly quenched in a physical experiment, a fine-grained decomposition into two distinct phases is frequently observed; this phenomenon is known as spinodal decomposition. A simple linear analysis about an unstable homogeneous equilibrium of the one-dimensional Cahn-Hilliard equation gives heuristic evidence that most solutions that start with initial data near such an equilibrium exhibit a behavior corresponding to spinodal decomposition. In this paper we formulate this conjecture in a mathematically precise way, using geometric and measure-theoretic techniques, and prove its validity. We believe that this is the first rigorous treatment of this phenomenon.