We investigate the fractional diffusion approximation of a kinetic equation set in a bounded interval with diffusive reflection conditions at the boundary. In an appropriate singular limit corresponding to small Knudsen number and long time asymptotic, we show that the asymptotic density function is the unique solution of a fractional diffusion equation with Neumann boundary condition. This analysis completes a previous work by the same authors in which a limiting fractional diffusion equation was identified on the half-space, but the uniqueness of the solution (which is necessary to prove the convergence of the whole sequence) could not be established.
more »
« less
Collective motion driven by nutrient consumption
A classical problem describing the collective motion of cells, is the movement driven by consumption/depletion of a nutrient. Here we analyze one of the simplest such model written as a coupled Partial Differential Equation/Ordinary Differential Equation system which we scale so as to get a limit describing the usually observed pattern. In this limit the cell density is concentrated as a moving Dirac mass and the nutrient undergoes a discontinuity. We first carry out the analysis without diffusion, getting a complete description of the unique limit. When diffusion is included, we prove several specific a priori estimates and interpret the system as a heterogeneous monostable equation. This allow us to obtain a limiting problem which shows the concentration effect of the limiting dynamics.
more »
« less
- PAR ID:
- 10432779
- Date Published:
- Journal Name:
- Asymptotic Analysis
- Volume:
- 133
- Issue:
- 4
- ISSN:
- 0921-7134
- Page Range / eLocation ID:
- 483 to 497
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract Monod and Logistic growth models have been widely used as basic equations to describe cell growth in bioprocess engineering. In the case of the Monod equation, the specific growth rate is governed by a limiting nutrient, with the mathematical form similar to the Michaelis–Menten equation. In the case of the Logistic equation, the specific growth rate is determined by the carrying capacity of the system, which could be growth‐inhibiting factors (i.e., toxic chemical accumulation) other than the nutrient level. Both equations have been found valuable to guide us build unstructured kinetic models to analyze the fermentation process and understand cell physiology. In this work, we present a hybrid Logistic‐Monod growth model, which accounts for multiple growth‐dependent factors including both the limiting nutrient and the carrying capacity of the system. Coupled with substrate consumption and yield coefficient, we present the analytical solutions for this hybrid Logistic‐Monod model in both batch and continuous stirred tank reactor (CSTR) culture. Under high biomass yield (Yx/s) conditions, the analytical solution for this hybrid model is approaching to the Logistic equation; under low biomass yield condition, the analytical solution for this hybrid model converges to the Monod equation. This hybrid Logistic‐Monod equation represents the cell growth transition from substrate‐limiting condition to growth‐inhibiting condition, which could be adopted to accurately describe the multi‐phases of cell growth and may facilitate kinetic model construction, bioprocess optimization, and scale‐up in industrial biotechnology.more » « less
-
Consider a system of homogeneous interacting diffusive particles labeled by the nodes of a unimodular Galton–Watson tree, where the state of each node evolves infinitesi- mally like a d-dimensional diffusion whose drift coefficient depends on (the histories of) its own state and the states of neighboring nodes, and whose diffusion coefficient depends only on (the history of) its own state. Under suitable regularity assumptions on the coefficients, an autonomous characterization is obtained for the marginal dis- tribution of the dynamics of the neighborhood of a typical node in terms of a certain local equation, which is a new kind of stochastic differential equation that is nonlinear in the sense of McKean. This equation describes a finite-dimensional non-Markovian stochastic process whose infinitesimal evolution at any time depends not only on the structure and current state of the neighborhood, but also on the conditional law of the current state given the past of the states of neighborhing nodes until that time. Such marginal distributions are of interest because they arise as weak limits of both marginal distributions and empirical measures of interacting diffusions on many sequences of sparse random graphs, including the configuration model and Erdös–Rényi graphs whose average degrees converge to a finite non-zero limit. The results obtained complement classical results in the mean-field regime, which characterize the limiting dynamics of homogeneous interacting diffusions on complete graphs, as the num- ber of nodes goes to infinity, in terms of a corresponding nonlinear Markov process. However, in the sparse graph setting, the topology of the graph strongly influences the dynamics, and the analysis requires a completely different approach. The proofs of existence and uniqueness of the local equation rely on delicate new conditional independence and symmetry properties of particle trajectories on unimodular Galton– Watson trees, as well as judicious use of changes of measure.more » « less
-
We investigate the uniform reshuffling model for money exchanges: two agents picked uniformly at random redistribute their dollars between them. This stochastic dynamics is of mean-field type and eventually leads to a exponential distribution of wealth. To better understand this dynamics, we investigate its limit as the number of agents goes to infinity. We prove rigorously the so-called propagation of chaos which links the stochastic dynamics to a (limiting) nonlinear partial differential equation (PDE). This deterministic description, which is well-known in the literature, has a flavor of the classical Boltzmann equation arising from statistical mechanics of dilute gases. We prove its convergence toward its exponential equilibrium distribution in the sense of relative entropy.more » « less
-
null (Ed.)Semi-supervised and unsupervised machine learning methods often rely on graphs to model data, prompting research on how theoretical properties of operators on graphs are leveraged in learning problems. While most of the existing literature focuses on undirected graphs, directed graphs are very important in practice, giving models for physical, biological or transportation networks, among many other applications. In this paper, we propose a new framework for rigorously studying continuum limits of learning algorithms on directed graphs. We use the new framework to study the PageRank algorithm and show how it can be interpreted as a numerical scheme on a directed graph involving a type of normalised graph Laplacian . We show that the corresponding continuum limit problem, which is taken as the number of webpages grows to infinity, is a second-order, possibly degenerate, elliptic equation that contains reaction, diffusion and advection terms. We prove that the numerical scheme is consistent and stable and compute explicit rates of convergence of the discrete solution to the solution of the continuum limit partial differential equation. We give applications to proving stability and asymptotic regularity of the PageRank vector. Finally, we illustrate our results with numerical experiments and explore an application to data depth.more » « less
An official website of the United States government

