one of the generalizations of the wiener number to weighted graphs is to assign probabilities to edges, meaning that in nonstatic conditions the edge is present only with some probability. the reliability wiener number is defined as the sum of reliabilities among pairs of vertices, where the reliability of a pair is the reliability of the most reliable path. closed expressions are derived for t...

The hard edge Pearcey process is universal in random matrix theory and many other stochastic models. This paper deals with the gap probability for thinned/unthinned over interval $(0,s)$ by working on relevant Fredholm determinants. We establish an integral representation of via a Hamiltonian related system coupled differential equations. Together some remarkable identities Hamiltonian, we deri...

Random graphs are graphs with a fixed number of vertices, where each edge is present with a fixed probability. We are interested in the probability that a random graph contains a certain pattern, for example a cycle or a clique. A very high edge probability gives rise to perhaps too many edges (which degrades performance for many algorithms), whereas a low edge probability might result in a dis...

One of the generalizations of the Wiener number to weighted graphs is to assign probabilities to edges, meaning that in nonstatic conditions the edge is present only with some probability. The Reliability Wiener number is defined as the sum of reliabilities among pairs of vertices, where the reliability of a pair is the reliability of the most reliable path. Closed expressions are derived for t...

Load balance just reasonably allocate request from users to each edge cloud storage servers. It can avoid overloading or congestion to ensure data transmission efficiency. Referring to idea of ant colony algorithm, the paper brought out Content Delivery Load Balance Algorithm Based on Probability Matching (CDLBA-PM) algorithm. The method calculated access probability of each edge cloud storage ...

We devise a statistical framework for edge detection by performing a statistical analysis of zero crossings of the second derivative of an image. This analysis enables us to estimate at each pixel of an image the probability that an edge passes through the pixel. We present a statistical analysis of the Lindeberg operators that we use to compute image derivatives. We also introduce a confidence...