We consider a [Formula: see text] system of hyperbolic balance laws that is the converted form under inverse Hopf–Cole transformation of a Keller–Segel type chemotaxis model. We study Cauchy problem when Cauchy data connect two different end-states as [Formula: see text]. The background wave is a diffusive contact wave of the reduced system. We establish global existence of solution and study the time asymptotic behavior. In the special case where the cellular population initially approaches its stable equilibrium value as [Formula: see text], we obtain nonlinear stability of the diffusive contact wave under smallness assumption. In the general case where the population initially does not approach to its stable equilibrium value at least at one of the far fields, we use a correction function in the time asymptotic ansatz, and show that the population approaches logistically to its stable equilibrium value. Our result shows two significant differences when comparing to Euler equations with damping. The first one is the existence of a secondary wave in the time asymptotic ansatz. This implies that our solutions converge to the diffusive contact wave slower than those of Euler equations with damping. The second one is that the correction function logistically grows rather than exponentially decays.
more »
« less
Lp time asymptotic decay for general hyperbolic–parabolic balance laws with applications
We study the time asymptotic decay of solutions for a general system of hyperbolic–parabolic balance laws in one space dimension. The system has a physical viscosity matrix and a lower-order term for relaxation, damping or chemical reaction. The viscosity matrix and the Jacobian matrix of the lower-order term are rank deficient. For Cauchy problem around a constant equilibrium state, existence of solution global in time has been established recently under a set of reasonable assumptions. In this paper, we obtain optimal [Formula: see text] decay rates for [Formula: see text]. Our result is general and applies to models such as Keller–Segel equations with logarithmic chemotactic sensitivity and logistic growth, and gas flows with translational and vibrational non-equilibrium. Our result also recovers or improves the existing results in literature on the special cases of hyperbolic–parabolic conservation laws and hyperbolic balance laws, respectively.
more »
« less
- Award ID(s):
- 1908195
- PAR ID:
- 10155910
- Date Published:
- Journal Name:
- Journal of Hyperbolic Differential Equations
- Volume:
- 16
- Issue:
- 04
- ISSN:
- 0219-8916
- Page Range / eLocation ID:
- 663 to 700
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
In this paper, we study the [Formula: see text]-contraction property of small extremal shocks for 1-d systems of hyperbolic conservation laws endowed with a single convex entropy, when subjected to large perturbations. We show that the weight coefficient [Formula: see text] can be chosen with amplitude proportional to the size of the shock. The main result of this paper is a key building block in the companion paper [G. Chen, S. G. Krupa and A. F. Vasseur, Uniqueness and weak-BV stability for [Formula: see text] conservation laws, Arch. Ration. Mech. Anal. 246(1) (2022) 299–332] in which uniqueness and BV-weak stability results for [Formula: see text] systems of hyperbolic conservation laws are proved.more » « less
-
I summarize recent progress on obtaining rigorous upper bounds on superconducting transition temperature [Formula: see text] in two dimensions independent of pairing mechanism or interaction strength. These results are derived by finding a general upper bound for the superfluid stiffness for a multi-band system with arbitrary interactions, with the only assumption that the external vector potential couples to the kinetic energy and not to the interactions. This bound is then combined with the universal relation between the superfluid stiffness and the Berezinskii–Kosterlitz–Thouless [Formula: see text] in 2D. For parabolic dispersion, one obtains the simple result that [Formula: see text], which has been tested in recent experiments. More generally, the bounds are expressed in terms of the optical spectral weight and lead to stringent constraints for the [Formula: see text] of low-density, strongly correlated superconductors. Results for [Formula: see text] bounds for models of flat-band superconductors, where the kinetic energy vanishes and the vector potential must couple to interactions, are briefly summarized. Upper bounds on [Formula: see text] in 3D remains an open problem, and I describe how questions of universality underlie the challenges in 3D.more » « less
-
[Formula: see text]A hyperbolic code is an evaluation code that improves a Reed–Muller code because the dimension increases while the minimum distance is not penalized. We give necessary and sufficient conditions, based on the basic parameters of the Reed–Muller code, to determine whether a Reed–Muller code coincides with a hyperbolic code. Given a hyperbolic code [Formula: see text], we find the largest Reed–Muller code contained in [Formula: see text] and the smallest Reed–Muller code containing [Formula: see text]. We then prove that similar to Reed–Muller and affine Cartesian codes, the [Formula: see text]th generalized Hamming weight and the [Formula: see text]th footprint of the hyperbolic code coincide. Unlike for Reed–Muller and affine Cartesian codes, determining the [Formula: see text]th footprint of a hyperbolic code is still an open problem. We give upper and lower bounds for the [Formula: see text]th footprint of a hyperbolic code that, sometimes, are sharp.more » « less
-
Consider a queuing system with K parallel queues in which the server for each queue processes jobs at rate n and the total arrival rate to the system is [Formula: see text], where [Formula: see text] and n is large. Interarrival and service times are taken to be independent and exponentially distributed. It is well known that the join-the-shortest-queue (JSQ) policy has many desirable load-balancing properties. In particular, in comparison with uniformly at random routing, the time asymptotic total queue-length of a JSQ system, in the heavy traffic limit, is reduced by a factor of K. However, this decrease in total queue-length comes at the price of a high communication cost of order [Formula: see text] because at each arrival instant, the state of the full K-dimensional system needs to be queried. In view of this, it is of interest to study alternative routing policies that have lower communication costs and yet have similar load-balancing properties as JSQ. In this work, we study a family of such rank-based routing policies, which we will call Marginal Size Bias Load-Balancing policies, in which [Formula: see text] of the incoming jobs are routed to servers with probabilities depending on their ranked queue length and the remaining jobs are routed uniformly at random. A particular case of such routing schemes, referred to as the marginal JSQ (MJSQ) policy, is one in which all the [Formula: see text] jobs are routed using the JSQ policy. Our first result provides a heavy traffic approximation theorem for such queuing systems in terms of reflected diffusions in the positive orthant [Formula: see text]. It turns out that, unlike the JSQ system, where, due to a state space collapse, the heavy traffic limit is characterized by a one-dimensional reflected Brownian motion, in the setting of MJSQ (and for the more general rank-based routing schemes), there is no state space collapse, and one obtains a novel diffusion limit which is the constrained analogue of the well-studied Atlas model (and other rank-based diffusions) that arise from certain problems in mathematical finance. Next, we prove an interchange of limits ([Formula: see text] and [Formula: see text]) result which shows that, under conditions, the steady state of the queuing system is well approximated by that of the limiting diffusion. It turns out that the latter steady state can be given explicitly in terms of product laws of Exponential random variables. Using these explicit formulae, and the interchange of limits result, we compute the time asymptotic total queue-length in the heavy traffic limit for the MJSQ system. We find the striking result that, although in going from JSQ to MJSQ, the communication cost is reduced by a factor of [Formula: see text], the steady-state heavy traffic total queue-length increases by at most a constant factor (independent of n, K) which can be made arbitrarily close to one by increasing a MJSQ parameter. We also study the case where the system is overloaded—namely, [Formula: see text]. For this case, we show that although the K-dimensional MJSQ system is unstable, unlike the setting of random routing, the system has certain desirable and quantifiable load-balancing properties. In particular, by establishing a suitable interchange of limits result, we show that the steady-state difference between the maximum and the minimum queue lengths stays bounded in probability (in the heavy traffic parameter n). Funding: Financial support from the National Science Foundation [RTG Award DMS-2134107] is gratefully acknowledged. S. Banerjee received financial support from the National Science Foundation [NSF-CAREER Award DMS-2141621]. A. Budhiraja received financial support from the National Science Foundation [Grant DMS-2152577].more » « less
An official website of the United States government

