scholarly journals A Note on Migration Perturbation and Convergence Rates to a Steady State

2020 ◽  
Vol 11 (4) ◽  
pp. 17-30
Author(s):  
Lawrence Edward Blume ◽  
Aleksandra Andreevna Lukina

Using tools developed in the Markov chains literature, we study convergence times in the Leslie population model in the short and middle run. Assuming that the population is in a steady-state and reproduces itself period after period, we address the following question: how long will it take to get back to the steady-state if the population distribution vector was affected by some shock as, for instance, the “brain drain”? We provide lower and upper bounds for the time required to reach a given distance from the steady-state.

Entropy ◽  
2021 ◽  
Vol 23 (9) ◽  
pp. 1105
Author(s):  
Thomas Parr ◽  
Lancelot Da Costa ◽  
Conor Heins ◽  
Maxwell James D. Ramstead ◽  
Karl J. Friston

In theoretical biology, we are often interested in random dynamical systems—like the brain—that appear to model their environments. This can be formalized by appealing to the existence of a (possibly non-equilibrium) steady state, whose density preserves a conditional independence between a biological entity and its surroundings. From this perspective, the conditioning set, or Markov blanket, induces a form of vicarious synchrony between creature and world—as if one were modelling the other. However, this results in an apparent paradox. If all conditional dependencies between a system and its surroundings depend upon the blanket, how do we account for the mnemonic capacity of living systems? It might appear that any shared dependence upon past blanket states violates the independence condition, as the variables on either side of the blanket now share information not available from the current blanket state. This paper aims to resolve this paradox, and to demonstrate that conditional independence does not preclude memory. Our argument rests upon drawing a distinction between the dependencies implied by a steady state density, and the density dynamics of the system conditioned upon its configuration at a previous time. The interesting question then becomes: What determines the length of time required for a stochastic system to ‘forget’ its initial conditions? We explore this question for an example system, whose steady state density possesses a Markov blanket, through simple numerical analyses. We conclude with a discussion of the relevance for memory in cognitive systems like us.


2021 ◽  
Vol 11 (5) ◽  
pp. 104-122
Author(s):  
István Ecsedi ◽  
Ákos József Lengyel ◽  
Attila Baksa ◽  
Dávid Gönczi

A mathematical model is developed for the steady-state electric current flow through in a homogeneous isotropic conductor whose shape is a body of rotation. The body of rotation considered is bounded by the coordinate surfaces of an orthogonal curvilinear coordinate system. The equations of the Maxwell’s theory of electric current flow in a homogeneous solid conductor body are used to formulate the corresponding electric boundary value problem. The studied steady-state conduction problem is axisymmetric. The determination of the steady motion of charges is based on the concept of the electrical conductance of the conductors the inverse of which is the electrical resistance. The exact (strict) value of the electrical resistance is known only for bodies with very simple shapes, therefore, the principles and the methods that can be used for creating lower and upper bounds to the numerical value of electrical resistance (electrical conductance) are important. The derivation of the upper and lower bound formulae for the electrical conductance of axisymmetric ring-like conductor is based on the two types of Cauchy–Schwarz inequality. The condition of equality of the derived lower and upper bounds is examined. Several examples illustrate the applications of the derived upper and lower bound formulae.


2003 ◽  
Vol 42 (05) ◽  
pp. 215-219
Author(s):  
G. Platsch ◽  
A. Schwarz ◽  
K. Schmiedehausen ◽  
B. Tomandl ◽  
W. Huk ◽  
...  

Summary: Aim: Although the fusion of images from different modalities may improve diagnostic accuracy, it is rarely used in clinical routine work due to logistic problems. Therefore we evaluated performance and time needed for fusing MRI and SPECT images using a semiautomated dedicated software. Patients, material and Method: In 32 patients regional cerebral blood flow was measured using 99mTc ethylcystein dimer (ECD) and the three-headed SPECT camera MultiSPECT 3. MRI scans of the brain were performed using either a 0,2 T Open or a 1,5 T Sonata. Twelve of the MRI data sets were acquired using a 3D-T1w MPRAGE sequence, 20 with a 2D acquisition technique and different echo sequences. Image fusion was performed on a Syngo workstation using an entropy minimizing algorithm by an experienced user of the software. The fusion results were classified. We measured the time needed for the automated fusion procedure and in case of need that for manual realignment after automated, but insufficient fusion. Results: The mean time of the automated fusion procedure was 123 s. It was for the 2D significantly shorter than for the 3D MRI datasets. For four of the 2D data sets and two of the 3D data sets an optimal fit was reached using the automated approach. The remaining 26 data sets required manual correction. The sum of the time required for automated fusion and that needed for manual correction averaged 320 s (50-886 s). Conclusion: The fusion of 3D MRI data sets lasted significantly longer than that of the 2D MRI data. The automated fusion tool delivered in 20% an optimal fit, in 80% manual correction was necessary. Nevertheless, each of the 32 SPECT data sets could be merged in less than 15 min with the corresponding MRI data, which seems acceptable for clinical routine use.


1997 ◽  
Vol 84 (1) ◽  
pp. 176-178
Author(s):  
Frank O'Brien

The author's population density index ( PDI) model is extended to three-dimensional distributions. A derived formula is presented that allows for the calculation of the lower and upper bounds of density in three-dimensional space for any finite lattice.


Author(s):  
S. Yahya Mohamed ◽  
A. Mohamed Ali

In this paper, the notion of energy extended to spherical fuzzy graph. The adjacency matrix of a spherical fuzzy graph is defined and we compute the energy of a spherical fuzzy graph as the sum of absolute values of eigenvalues of the adjacency matrix of the spherical fuzzy graph. Also, the lower and upper bounds for the energy of spherical fuzzy graphs are obtained.


Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 940
Author(s):  
Zijing Wang ◽  
Mihai-Alin Badiu ◽  
Justin P. Coon

The age of information (AoI) has been widely used to quantify the information freshness in real-time status update systems. As the AoI is independent of the inherent property of the source data and the context, we introduce a mutual information-based value of information (VoI) framework for hidden Markov models. In this paper, we investigate the VoI and its relationship to the AoI for a noisy Ornstein–Uhlenbeck (OU) process. We explore the effects of correlation and noise on their relationship, and find logarithmic, exponential and linear dependencies between the two in three different regimes. This gives the formal justification for the selection of non-linear AoI functions previously reported in other works. Moreover, we study the statistical properties of the VoI in the example of a queue model, deriving its distribution functions and moments. The lower and upper bounds of the average VoI are also analysed, which can be used for the design and optimisation of freshness-aware networks. Numerical results are presented and further show that, compared with the traditional linear age and some basic non-linear age functions, the proposed VoI framework is more general and suitable for various contexts.


Sign in / Sign up

Export Citation Format

Share Document