Next Article in Journal
Exergy Analysis for Combustible Third-Grade Fluid Flow through a Medium with Variable Electrical Conductivity and Porous Permeability
Next Article in Special Issue
Event-Triggered Extended Dissipativity Fuzzy Filter Design for Nonlinear Markovian Switching Systems against Deception Attacks
Previous Article in Journal
A Novel Integrated Heuristic Optimizer Using a Water Cycle Algorithm and Gravitational Search Algorithm for Optimization Problems
Previous Article in Special Issue
Large Deviations for Hawkes Processes with Randomized Baseline Intensity
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Asymptotic Relations in Applied Models of Inhomogeneous Poisson Point Flows

by
Gurami Tsitsiashvili
1,* and
Marina Osipova
1,2
1
Institute for Applied Mathematics, Far Eastern Branch of Russian Academy of Sciences, 690041 Vladivostok, Russia
2
Institute for Applied Mathematics, Far Eastern Federal University, 690922 Vladivostok, Russia
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(8), 1881; https://doi.org/10.3390/math11081881
Submission received: 2 February 2023 / Revised: 5 April 2023 / Accepted: 13 April 2023 / Published: 15 April 2023

Abstract

:
A model of a particle flow forming a copy of some image and the distance between the copy and the image are estimated using a special probability metric. The ability of the flow of balls to cover the surface, when grinding the balls, was investigated using formulas of stochastic geometry. Reconstruction of characteristics of an inhomogeneous Poisson flow by inaccurate observations is analysed using the Poisson flow point colouring theorem. The dependence of the Poisson parameter of the distribution of the number of customers in a queuing system with an infinite number of servers and a deterministic service time on the peak load created by an inhomogeneous input Poisson flow is estimated. All these models consist of an inhomogeneous Poisson flow of points and marks glued to each point of the flow and are characterised by their mass, area, volume, observability (or non-observability), and service time. The presence of an asymptotic power–law relationship between model objective functions and parameters of mark crushing is established. These results may be applied in nanotechnology, powder metallurgy, ecology, and consumer services in the implementation of the “Smart City” program. The proposed approach is phenomenological in nature and is justified by the results of real observations and experiments.

1. Introduction

The Poisson flow of points is widely used in queuing theory, in reliability theory, in mathematical biology and ecology, in astronomy, and in many other applied disciplines [1,2,3,4,5]. In this paper, we consider four systems described by inhomogeneous-labelled Poisson flows [6,7], to the points of which special types of stamps are attached (glued). The efficiency indicators of the systems and the parameter, characterising the grinding of grades, and the corresponding increase in the intensity of the flow are introduced. The dependence of the efficiency indicator on this parameter is investigated, and its asymptotic behaviour is analysed when the grinding parameter tends to infinity. The fast convergence of the efficiency indicator to zero is proven, which helps, in particular, to draw important conclusions about the simulated systems.
In the first model, the mark of each Poisson flow point on a flat rectangle or three-dimensional parallelepiped is its mass. In this way, a model of the image formed by a printer/copier or a 3 D printer is obtained. The accuracy of reproduction by the real density of the flow of points of ideal density is investigated when the mass grinding parameter tends to infinity in a specially selected probabilistic metric [8]. This model is closely related to the tasks of nanotechnology.
In the second model, the mark of a Poisson flow point on a rectangle can be a square/circle, the centre of which is glued to this point. The set of stamps forms the so-called Boolean random set [2,9,10,11,12,13]. This applied model can characterise a surface covered with sprayed powder particles. As an indicator of efficiency, the mathematical expectation of the area of the rectangle part that is not covered with stamps is taken. The rate of convergence of this efficiency indicator to zero is investigated when the grinding parameter of powder particles tends to infinity. This model is applicable to the assessment of the quality of coatings created by the powder metallurgy method.
In the third model, the mark of the Poisson flow point on the plane is its colour red or white. Points coloured red are considered as observable flow points, and points coloured white are considered as unobservable [1]. The probability of flow points being coloured red is an unknown parameter that can be interpreted as interfering/hidden [14,15,16,17]. When analysing the flow of observed points, the interfering parameter is eliminated by the transition from the number of flow points in a certain area to the ratio of the number of flow points in a certain area to the number of flow points on the entire plane. Convergence in the probability of the relative frequency of the number of observed points in a certain region is established when the mathematical expectation of the number of observed points on the plane tends to infinity. This model arose when comparing the number of tiger tracks in different years in conditions when some tracks in the snow were invisible [18,19]. As a result, data on the accounting of animal tracks in a given year become industrial statistics and require special methods for their processing.
In the fourth model, the mark of a Poisson flow point on a straight line is a segment of length a, the left end of which is glued to each flow point. In this case, the points that are the right ends of the segments characterise the moments of leaving the queuing system of customers after their service during a deterministic time. This paper considers the case when the intensity of the input Poisson flow of customers into a system with an infinite number of devices has a pronounced maximum. The possibility of smoothing this maximum by reducing the service time is being investigated. This problem arises when analysing consumer service systems and conveyor production systems [20,21,22,23]. The task of smoothing the peak load was also considered in the papers [24,25,26] in relation to PC software testing systems. However, in these papers, the assumption was made about a special relationship between the intensity of the input flow and the intensity of service.
Such a statement of the question is caused by numerous problems for specialists in the subject areas when processing and interpreting the data they receive. These include observations of the long-term operation of copiers, in which the quality of duplicated images drops sharply. Apparently, this is due to the sintering of copier powder particles during prolonged heating. The dependence on the particle size was also observed in experiments to protect ball-bearing rings from collisions with balls by including polymer particles in the ball-bearing oil. It turned out that with a decrease in the size of these particles, the uptime of the ball bearing increases markedly. Another task was the observation of geographers for the detection of animal tracks, depending on meteorological conditions. In particular, the possibility of detecting a trace is significantly affected by the thickness of the snow cover. In addition, if such a trace study is carried out over a large area, then the financial conditions for organising observations also come to the fore. Many data-processing problems arise in the “Smart City” program. Traffic jams significantly affect the quality of public services. Therefore, recently, service centres, for example, sports complexes, are switching from hard copies of user subscriptions to electronic cards. Such maintenance allows users not to associate the time of their arrival for service with its periodic start.
The study of such phenomena creates an impetus for the development of mathematical and statistical methods for the analysis of complex systems. Such problems arise from various practical applications, and the use of mathematical models in solving them turns out to be a rather complicated procedure. Therefore, it is more convenient to build not very accurate, but rather easily calculated simulation models, in which the dependence of performance indicators on model parameters is explicit.
The construction of such models requires the combination of several rather heterogeneous mathematical techniques. Here, it is very convenient to model an inhomogeneous Poisson flow of points with stamps pasted on them, the parameters of which are weight, size, etc., characteristics that are related to the intensity of the flow. The construction of asymptotic relations of the dependence of the efficiency index of such a system on the parameters of the marks requires the use of inequalities commonly used for probabilistic metrics when analysing the convergence rate in the limit theorems of probability theory. Formulas of stochastic geometry can also serve as a convenient tool for constructing such relations, especially in the framework of a Boolean model based on the Poisson flow construction. Another convenient technique for working with point flows of an inhomogeneous Poisson flow is the method of interfering (hidden) parameter. In this case, we can use well-known methods for analysing statistical samples in the presence of an interfering parameter. All these circumstances require, when constructing and studying the systems under consideration, the connection of heterogeneous mathematical elements: the choice of an inhomogeneous Poisson flow of points, the choice of stamps glued to the flow points, the choice of the ratio between the intensity of the flow of points and the characteristic of the brand, the choice of the system efficiency indicator and the choice of a mathematical method for analysing the dependence of the efficiency indicator on the parameter of stamps.
The established effects of the convergence of the system efficiency indicator to zero with the aspiration to infinity of the parameter of grinding marks are new. Methods of the theory of probability metrics [8], methods of the theory of random sets [2], methods of the theory of Poisson flows [1], and integral formulas for the parameter of the Poisson distribution of the number of points of the Poisson flow in a certain segment were used to study them. A characteristic feature of these models is a special choice of the efficiency indicator, the grinding parameter of the stamps glued to the flow points, and the relationship between the efficiency indicator and the grinding parameter. The proposed approach is phenomenological in nature. It is initiated and justified by the results of real observations and experiments.

2. Proximity of the Poisson Flow of Points to the Intensity Function When Grinding the Masses of Points

This mathematical model is based on the notion of a Poisson flow of Π points on r-dimensional Euclidean space E r . The number of points of the Poisson flow in the Lebesgue-measurable subset A E r does not depend on the number of points in any other Lebesgue-measurable subset B E r : A B = and obeys the Poisson distribution with the parameter Λ ( A ) . Next, we will assume that there exists a piecewise continuous function λ ( x ) , x E r such that for any Lebesgue-measurable set A E r , the parameter Λ ( A ) = A λ ( x ) d x . The function λ ( x ) , x E r , is called the intensity of the Poisson flow Π .
Consider Poisson point flow Π on r-dimensional rectangle X with a continuous intensity function λ ( x ) such that
Λ ( X ) = X λ ( x ) d x < .
If X is a Lebesgue-measurable subset in the rectangle X , then a random number of points n ( X ) of the Poisson flow Π in the set X has a Poisson distribution with the parameter
Λ ( X ) = X λ ( x ) d x .
Now let us denote Π m Poisson flow on the rectangle X with the intensity function m λ ( x ) . Let us put n m ( X ) the number of flow points Π m on the set X and define random variables N m ( X ) = n m ( X ) m . Here, the random variable N m ( X ) characterises the total mass of the flow points Π m in the set X , assuming that the mass of each point is 1 / m .
We introduce the distance ρ m between the point flow Π m , in which each point has a mass 1 / m , and the intensity function λ ( x ) . To do this, we denote X as the partition of the rectangle X by a finite number n ( X ) disjoint and Lebesgue-measurable subsets X 1 , , X n ( X ) . Let A be the set of all possible such partitions of X ; then, the distance ρ m is determined by the equality
ρ m = sup X A E i = 1 n ( X ) ( Λ ( X i ) N m ( X i ) ) 2 1 / 2 .
It follows from the properties of the Poisson flow Π m that random variables N m ( X i ) , i = 1 , , n ( X ) are independent. This property is based on the following statements.
In probability, statistics and related fields, a Poisson point process is a type of random mathematical object that consists of points randomly located on a mathematical space with the essential feature that the points occur independently of one another [2]. Consider a collection of disjoint and bounded subregions of the underlying space. By definition, the number of points of a Poisson point process in each bounded subregion will be completely independent of all the others. This property is known under several names such as complete randomness, complete independence [27], or independent scattering [4,6], and it is common to all Poisson point processes. In other words, there is a lack of interaction between different regions and the points in general [28], which motivates the Poisson process, being sometimes called a purely or completely random process [27].
Therefore, the equalities are fulfilled Λ ( X i ) = E N m ( X i ) ,
E i = 1 n ( X ) ( Λ ( X i ) N m ( X i ) ) 2 = i = 1 n ( X ) E ( Λ ( X i ) N m ( X i ) ) 2 =
= i = 1 n ( X ) V a r N m ( X i ) = 1 m 2 i = 1 n ( X ) m Λ ( X i ) = Λ ( X ) m ,
from which, due to Formula (3), we obtain
ρ m = Λ ( X ) m .
Relation (4) shows how, when splitting the mass of points of the Poisson flow Π m into m of identical parts, the distance between the flow Π m and the function λ ( x ) tends to zero at m .
Remark 1.
This ratio can be used to study the quality of work of 2 D and 3 D printers and copiers depending on the mass of individual flow points, which can be interpreted as the mass of flow particles.
Remark 2.
The results obtained in this section have not been previously used in the analysis of copiers and 2D and 3D printers. They have made it possible to analyse the operation of these devices during heating and sintering, as well as during the grinding of powder particles used in these devices.

3. Covering Points of the Poisson Flow on the Plane with Cubes of Variable Size

Suppose there is Poisson point flow Π m with constant intensity m λ ¯ , given on the unit square X , whose one side coincides with the axis of the abscissa. Let a square with a side of length m 1 / 3 , rotated by a random angle φ (between the axis of the abscissa and the diagonal of the glued square) be glued to each point of the flow Π m . The angle φ has a uniform distribution on the segment [ 0 , π ] . Thus, the set of squares glued to X forms a random set obeying the Boolean model [2].
Denote S m as the complement of this random set to the unit square of X . According to Steiner’s theorem [2], for the mathematical expectation α m of the area of a random set S m , the relation is fulfilled
α m = exp ( λ ¯ m 1 / 3 ) 0 , m .
Formally, we can assume that every square glued to a flow point Π m on the plane is the side of a cube parallel to the sputtering plane with a volume 1 / m . Then, the mathematical expectation of the total volume of cubes is β m = λ ¯ . In the case, when this total volume β m = λ ¯ m γ , 0 γ < 1 / 3 , it is not difficult to obtain the ratio
α m = exp ( λ ¯ m 1 / 3 γ ) 0 , m .
The obtained relations show that, when the cubes are crushed while maintaining or decreasing their average total volume, the area of the random set S m decreases to zero.
Remark 3.
Along with shredding cubes, the proposed approach can be applied to coating a flat surface with shredding balls. In this case, instead of squares, circles are considered, which are projections of balls with a diameter of m 1 / 3 on the plane. Then, the relations are fulfilled
α m = exp ( π λ ¯ m 1 / 3 / 4 ) 0 , m , β m = π λ ¯ / 6 .
Remark 4.
Such limiting ratios can be useful in analysing the quality of the coating obtained by powder metallurgy. Another possible application of these results may be to evaluate the coating of the ice surface with notches in order to reduce the possibility of people sliding on it.
Remark 5.
The results of this section are based on the analysis of powder metallurgy processes. They show that the grinding of powder particles makes it possible to increase the protective properties of the particle layer on the metal surface. This one is being investigated analytically. The results are very difficult to repeat using the equations of gas dynamics and the processes of gluing solid particles to a metallic surface. The results of this section are the development of well-known results in the field of stochastic geometry, which continue to develop to date [11].

4. Method of Eliminating the Interfering Parameter in Statistics of Poisson Points Flow

Let the Lebesgue-measurable and disjoint regions be distinguished on the plane G k , k = 1 , , n . Poisson point flow Π with continuous intensity λ ( x ) is given, and the relations are fulfilled
λ ¯ k = G k λ ( x ) d x < , k = 1 , , r , λ ¯ = k = 1 r λ ¯ k .
Denote Λ k = λ ¯ k λ ¯ and consider the flow Π m with the intensity function m λ ( x ) . Let each point of the flow Π m be independent of other points and, from its coordinates with probability p, enter the flow Π ¯ m . Then, the flow Π ¯ m due to the point colouring theorem of the Poisson flow [1] is Poisson with intensity p m λ ( x ) . Therefore, the number n k of flow points Π ¯ m in the subdomain G k has a Poisson distribution with the parameter p m λ ¯ k , and the sum n = k = 1 r n k has a Poisson distribution with the parameter p m λ ¯ .
Theorem 1.
The convergence in probability of the random variable N k = n k n to the parameter Λ k is valid when m .
Proof. 
Due to the properties of the Poisson distribution, the relations are fulfilled
E n k = V a r n k = p m λ ¯ k , k = 1 , , r ; E n = V a r n = p m λ ¯ .
It follows from the equalities (8) that
V a r n k p m λ ¯ k = 1 p m λ ¯ k , V a r n p m λ = 1 p m λ ¯ .
From Chebyshev’s inequality, we obtain that for any ε , 0 < ε < 1 , and for m
P 1 ε n k p m λ ¯ k 1 + ε 1 1 p m λ ¯ k ε 2 1 , k = 1 , , r , P 1 ε n p m λ ¯ 1 + ε 1 1 p m λ ¯ ε 2 1 .
Using Formulas (8) and (9), it is not difficult for any ε , 0 < ε < 1 2 , to obtain the inequality
P 1 2 ε N k Λ k 1 + 4 ε P 1 ε 1 + ε N k Λ k 1 + ε 1 ε 1 1 p m λ ¯ k ε 2 1 p m λ ¯ ε 2 .
From the inequality Λ k 1 , and from Formula (10), we obtain the relation
P 2 ε N k Λ k 4 ε 1 1 p m λ k ε 2 1 p m λ ε 2 1 , m .
This proves the statement of Theorem 1. ☐
Therefore, the relation N k , for m , is a consistent estimate of the parameter Λ k , free of probability p , playing the role of an interfering parameter in this problem.
Remark 6.
Using Inequalities (11), we can assume that p = p ( m ) = m δ , 0 δ < 1 , and establish convergence by probability N k to Λ k at m .
Remark 7.
This problem arises when comparing accounts of the number of animal tracks in the snow when the interfering parameter takes on different values caused by different meteorological and economic characteristics in different years.
Remark 8.
The results obtained in this section show that the analysis of traces of rare animals requires more careful processing of the results obtained. This becomes especially important when traces are investigated over a large area and data collection turns into an industrial statistics procedure.

5. Peak Loads in the Queuing System M | D |

Consider a queuing system with a nonstationary Poisson input flow of intensity λ ( t ) , t 0 , with a deterministic service time a and an infinite number of servers. Let the intensity of Poisson input flow λ ( t ) , 0 t T , be a continuously differentiable function, and at the point t * , 0 < t * < T a has a single extremum maximum.
Denote n ( t ) as the number of customers in the queuing system at time t . It is obvious that the random variable n ( t ) has a Poisson distribution with the parameter
Λ ( t ) = max ( 0 , t a ) t λ ( u ) d u .
Designate λ ( t * ) = λ * , Λ * = sup 0 t T Λ ( t ) .
Let us investigate the dependence of the efficiency indicator Λ * on the parameters λ * , a . First, focus on the analysis of the smoothing of the peak load determined by the intensity of the input stream λ ( t ) , with a decrease in the parameter a . It is obvious that the inequality is true
Λ * a λ * .
Thus, reducing the parameter a leads to a decrease in the value of Λ * .
Let us now proceed to a more detailed study of the dependence Λ * on the parameter a . From Formula (12), it follows that the equalities are fulfilled
Λ ( t ) = 0 t λ ( u ) d u 0 t a , Λ ( t ) = t a t λ ( u ) d u , a t T .
Now calculate the derivative of twice piecewise continuously differentiable function Λ ( t ) for t a :
Λ ˙ ( t ) = λ ( t ) , 0 t < a T , Λ ˙ ( t ) = λ ( t ) λ ( t a ) , a < t T .
Theorem 2.
The function Λ ( t ) has a single extremum-= maximum t * on the segment [ 0 , T ] and a t * t * + a .
Proof. 
It follows from Formula (15) that the inequalities are satisfied
Λ ˙ ( t ) 0 , 0 t < a ; Λ ˙ ( t ) 0 , t * + a t T .
(1) Assume that 0 t * a , λ ( 0 ) λ ( a ) . From (16), we have that the function Λ ( t ) is non-decreasing on [ 0 , a ] and non-increasing on [ t * + a , T ] . Calculate now
sup a < t t * + a Λ ˙ ( t ) = sup a < t t * + a ( λ ( t ) λ ( t a ) ) sup a < t t * + a λ ( t ) inf a < t t * + a λ ( t a ) =
= λ ( a ) inf 0 < t t * λ ( t ) = λ ( a ) λ ( 0 ) 0 .
Consequently, the function Λ ( t ) has single extremum maximum at the point t * = a .
(2) Assume that 0 t * a , λ ( 0 ) λ ( a ) , ; then, from (15) and (16), we have that Λ ˙ ( a + 0 ) = λ ( a ) λ ( 0 ) 0 , Λ ˙ ( t * + a ) 0 . Now calculate
sup a t t * + a Λ ¨ ( t ) = sup a < t t * + a λ ˙ ( t ) inf a < t t * + a λ ˙ ( t ) 0 .
Hence, we obtain the existence of a single root of the function Λ ˙ ( t ) and thus a single extremum maximum t * for the function Λ ( t ) and the inequality a t * t * + a . (3) If a t * , then from Formulas (15) and (16), we have
Λ ˙ ( t ) 0 , 0 t < a ; Λ ˙ ( t ) 0 , a < t t * ; Λ ˙ ( t ) 0 , t * + a t T .
Analogously with (17), we lead to
Λ ˙ ( t * ) 0 , Λ ˙ ( t * + a ) 0 ; sup t * t t * + a Λ ¨ ( t ) 0 .
Consequently, we obtain the existence of a single extremum maximum t * for the function Λ ( t ) and the inequality a t * t * t * + a , and thus Theorem 2 is proved. ☐
Let us now proceed to illustrate the results obtained in a numerical example. Suppose that for some T > a > 0 , the function
λ ( t ) = exp ( ( t b ) 2 / ( 2 c ) ) 2 π c , 0 < t < T a , λ ( t ) = 0 , t 0 or T a t .
Then, for T = 10 , b = 5 , c = 1 , the function Λ ( t ) looks like this.
Figure 1 shows how when the parameter a increases, the maximum Λ * and the point t * increase.
Remark 9.
Such a task arises when modelling sports complexes, cinemas, and production conveyor systems.
Remark 10.
The results obtained in this section arose when comparing the previous one, based on hard copy subscriptions with periodic access of users to the service system, and the new one, using electronic cards and allowing users at any time that was convenient for them. The known methods of calculating queuing systems with variable input flow intensity [29,30] are quite complex, and their application for the M | D | system seems superfluous.

6. Discussion

As possible extensions of the problems considered in this paper, there may be a transition from the Poisson flow model of points to more complex and, perhaps, more adequate models of point flows. The construction of asymptotic relations for the dependence of the flow intensity on the parameter of stamps is not always convenient. It uses very strict requirements for a small (large) parameter characterising the stamp glued to the point (mass, size, probability of detection, time of service of stamps). In the application plan, it may be sufficient to relax these requirements. Such a weakening may lead to a transition from the asymptotic analysis of these dependencies to numerical calculations. There may also be a situation when the presence of a small (large) parameter in the models may not be completely appropriate to the model under consideration. For example, in nanotechnology models, the aspiration to zero of the size or mass of particles contradicts physical conditions. This circumstance requires greater caution when constructing a mathematical model of the analysed system and, as a consequence, greater selectivity when choosing a mathematical research method. The results obtained in this paper are applied to the analysis of new technical systems. These systems periodically arise in various applied fields and become a source of new problems at the junction of mathematical modelling and system analysis.

7. Conclusions

A model of the flow of particles forming a copy of some image was considered, and it is shown how the distance between the image formed by them and the original image decreases when the particles are crushed. The ability of flow particles to close the surface protected by them during their grinding was investigated. A model for restoring the characteristics of an inhomogeneous Poisson flow with inaccurate observation of flow points and with increasing flow intensity was analysed. The dependence of the Poisson parameter of the distribution of the customer number in a queuing system with an infinite number of servers and a deterministic service time on the peak load created by the Poisson input flow was estimated.
The obtained results indicate the presence of power–law upper bounds for various efficiency indicators, depending on the parameter characterising the grinding of stamps glued to the flow points. They were confirmed by observations of the studied systems. The established effects of the convergence of the system efficiency indicator to zero with the aspiration to infinity of the parameter of grinding marks were obtained. These results were established using methods of the theory of probability metrics, methods of the theory of random sets, methods of the theory of Poisson flows and their colouring points, and on integral formulas for the parameter of the Poisson distribution of the point numbers in the Poisson flow on a certain segment. A characteristic feature of these models is a special choice of the efficiency indicator, the grinding parameter of the stamps glued to the flow points, and the relationship between the efficiency indicator and the grinding parameter. The results presented in this paper may be applied in nanotechnology, in powder metallurgy, in ecology, and in consumer services during the implementation of the “Smart City” program. The proposed approach is phenomenological in nature and is justified by the results of real observations and experiments.

Author Contributions

Conceptualisation, methodology, formal analysis, G.T.; manifold numerical, M.O. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding. The research was carried out within the state assignment for IAM FEB RAS (N 075-01290-23-00).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Data supporting the reported results were obtained by M.O.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Kingman, J.F.C. Poisson Processes; Oxford Science Publications: Oxford, UK, 1993. [Google Scholar]
  2. Chiu, S.N.; Stoyan, D.; Kendall, W.S.; Mecke, J. Stochastic Geometry and Its Applications; John Wiley and Sons: New York, NY, USA, 2013. [Google Scholar]
  3. Cox, D.R.; Isham, V. Point Processes; Chapman and Hall: London, UK, 1980. [Google Scholar]
  4. Streit, R.L. Poisson Point Processes: Imaging, Tracking, and Sensing; Metron Inc.: Reston, VA, USA, 2010. [Google Scholar]
  5. Tijms, H.C. A First Course in Stochastic Models; John Wiley and Sons: New York, NY, USA, 2003. [Google Scholar]
  6. Moller, J.; Waagepetersen, R.P. Statistical Inference and Simulation for Spatial Point Processes; Chapman and Hall: London, UK, 2003. [Google Scholar]
  7. Haenggi, M. Stochastic Geometry for Wireless Networks; Cambridge University Press: Cambridge, UK, 2013. [Google Scholar]
  8. Zolotarev, V. Modern Theory of Summation of Random Variables; VSP: Utrecht, The Netherlands, 1997. [Google Scholar]
  9. Stoyan, D. On some qualitative properties of the Boolean model of stochastic geometry. ZAMM-J. Appl. Math. Mech./Zeitschrift für Angewandte Mathematik und Mechanik 1979, 59, 447–454. [Google Scholar] [CrossRef]
  10. Stoyan, D. Stereological formulae for size distribution through marked point processes. Probab. Math. Stat. 1982, 2, 161–166. [Google Scholar]
  11. Brandel1, M.; Brands, D.; Maike, S.; Rheinbach, O.; Schroder, J.; Schwarz, A.; Stoyan, D. Effective hyperelastic material parameters from microstructures constructed using the planar Boolean model. Comput. Mech. 2022, 69, 1295–1321. [Google Scholar] [CrossRef]
  12. Hmamouche, Y. Applications of Stochastic Geometry in the Modelling and Analysis of Wireless Networks. Networking and Internet Architecture [cs.NI]; Ecole Nationale Superieure Mines-Telecom Atlantique: Paris, France, 2020; ffNNT: 2020IMTA0212ff. fftel-03199210. [Google Scholar]
  13. Hmamouche, Y.; Benjillali, M.; Saoudi, S.; Yanikomeroglu, H.; Di Renzo, M. New Trends in Stochastic Geometry for Wireless Networks: A Tutorial and Survey. Proc. IEEE 2021, 109, 1200–1252. [Google Scholar] [CrossRef]
  14. Cox, D.R.; Hinkley, D.V. Theoretical Statistics; Chapman and Hall: London, UK, 1979. [Google Scholar]
  15. Young, G.A.; Smith, R.L. Essentials of Statistical Inference; Cambridge University Press: Cambridge, UK, 2005. [Google Scholar]
  16. Holevo, A.S. Quantum Systems, Channels, Information; De Gruyter: Berlin, Germany, 2013. [Google Scholar]
  17. Holevo, A.S. Quantum noise as noncommutative stationary random process. Int. J. Mod. Phys. 2022, A37, 2243011. [Google Scholar] [CrossRef]
  18. Bocharnikov, V.N.; Krasnopeev, S.M. World Forest monitoring by network of indigenous peoples. In Proceedings of the 18th ESRI Annual User Conference, San Diego, CA, USA, 24–28 July 1998. [Google Scholar]
  19. Murzin, A.A. Construction of the Amur tiger population dynamics model and forecast calculations. Its number for the period from 2015 to 2022. Int. J. Appl. Fundam. Res. 2018, 11, 333–340. (In Russian) [Google Scholar]
  20. Boyle, D.E.; Yates, D.C.; Yeatman, E.M. Urban Sensor Data Streams: London 2013. IEEE Internet Comput. 2013, 17, 12–20. [Google Scholar] [CrossRef]
  21. Greenfield, A. Against the Smart City; Verso: London, UK, 2013. [Google Scholar]
  22. Porshnev, S.V.; Karelin, I.A. Investigation of the features of a non-stationary single-channel queuing system in the context of the number of applications served. Cloud Sci. 2017, 4, 366–374. (In Russian) [Google Scholar]
  23. Vasilyev, S.A.; Tsareva, G.O. Analysis of Queueing Systems with an Infinite Number of Servers and a Small Parameter. RUDN J. MIPh 2018, 26, 167–175. [Google Scholar] [CrossRef] [Green Version]
  24. Pham, H. Software Reliability; Springer: Singapore, 2000. [Google Scholar]
  25. Yamada, S. Software Reliability Modelling, Fundamentals and Applications; Springer: Tokyo, Japan, 2014. [Google Scholar]
  26. Minamino, Y.; Makita, Y.; Inoue, S.; Yamada, S. Efficiency evaluation of software faults correction based on queuing simulation. Mathematics 2022, 10, 1438. [Google Scholar] [CrossRef]
  27. Daley, D.J.; Vere-Jones, D. An Introduction to the Theory of Point Processes: Volume II: General Theory and Structure; Springer: Berlin/Heidelberg, Germany, 2007. [Google Scholar]
  28. Feller, W. An Introduction to Probability Theory and Its Applications, Volume 2; John Wiley and Sons: Hoboken, NJ, USA, 1971. [Google Scholar]
  29. Ivnitsky, V. Theory of Queuing Networks; Fizmatlit: Moscow, Russia, 2004. (In Russian) [Google Scholar]
  30. Katrakhov, V.; Ryzhkov, D. Introduction to the Functional-Analytical Method in the Dynamic Theory of Queuing; DVGU Publishing House: Vladivostok, Vladivostok, 2004. (In Russian) [Google Scholar]
Figure 1. Graphs of functions λ ( t ) (dotted line), Λ ( t ) (solid line).
Figure 1. Graphs of functions λ ( t ) (dotted line), Λ ( t ) (solid line).
Mathematics 11 01881 g001
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Tsitsiashvili, G.; Osipova, M. Asymptotic Relations in Applied Models of Inhomogeneous Poisson Point Flows. Mathematics 2023, 11, 1881. https://doi.org/10.3390/math11081881

AMA Style

Tsitsiashvili G, Osipova M. Asymptotic Relations in Applied Models of Inhomogeneous Poisson Point Flows. Mathematics. 2023; 11(8):1881. https://doi.org/10.3390/math11081881

Chicago/Turabian Style

Tsitsiashvili, Gurami, and Marina Osipova. 2023. "Asymptotic Relations in Applied Models of Inhomogeneous Poisson Point Flows" Mathematics 11, no. 8: 1881. https://doi.org/10.3390/math11081881

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop