Networks and Heterogeneous Media
December 2019 , Volume 14 , Issue 4
Select all articles
This paper is concerned with a target-detection model using bio-nanomachines in the human body that is actively being discussed in the field of molecular communication networks. Although the model was originally proposed as spatially one-dimensional, here we extend it to two dimensions and analyze it. After the mathematical formulation, we first verify the solvability of the stationary problem, and then the existence of a strong global-in-time solution of the non-stationary problem in Sobolev–Slobodetskiĭ space. We also show the non-negativeness of the non-stationary solution.
Gas flow through pipeline networks can be described using
We study the Vlasov-Poisson-Fokker-Planck (VPFP) system with uncertainty and multiple scales. Here the uncertainty, modeled by multi-dimensional random variables, enters the system through the initial data, while the multiple scales lead the system to its high-field or parabolic regimes. We obtain a sharp decay rate of the solution to the global Maxwellian, which reveals that the VPFP system is decreasingly sensitive to the initial perturbation as the Knudsen number goes to zero. The sharp regularity estimates in terms of the Knudsen number lead to the stability of the generalized Polynomial Chaos stochastic Galerkin (gPC-SG) method. Based on the smoothness of the solution in the random space and the stability of the numerical method, we conclude the gPC-SG method has spectral accuracy uniform in the Knudsen number.
We consider two scalar conservation laws with non-local flux functions, describing traffic flow on roads with rough conditions. In the first model, the velocity of the car depends on an averaged downstream density, while in the second model one considers an averaged downstream velocity. The road condition is piecewise constant with a jump at
We address a spectral problem for the Dirichlet-Laplace operator in a waveguide
We study the Schrödinger-Lohe model. Making use of the principal fundamental matrix
The outcome of elections is strongly dependent on the districting choices, making thus possible (and frequent) the gerrymandering phenomenon, i.e. politicians suitably changing the shape of electoral districts in order to win the forthcoming elections. While so far the problem has been treated using continuous analysis tools, it has been recently pointed out that a more reality-adherent model would use the discrete geometry of graphs or networks. Here we propose a parameter-dependent discrete model for choosing an "optimal" districting plan. We analyze several properties of the model and lay foundations for further analysis on the subject.
We study a Cucker-Smale-type flocking model with distributed time delay where individuals interact with each other through normalized communication weights. Based on a Lyapunov functional approach, we provide sufficient conditions for the velocity alignment behavior. We then show that as the number of individuals
Add your name and e-mail address to receive news of forthcoming issues of this journal:
[Back to Top]