نتایج جستجو برای: random distribution
تعداد نتایج: 857131 فیلتر نتایج به سال:
Abstract. Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i. e. labellings of the nodes by distinct integers of the set {1, . . . , n} in such a way that each sequence of labels along any branch starting at the root is increasing. Three such tree families are of particular intere...
In this paper, we apply the theory predicting neighbor distribution of arbitrary random graphs to analyze the network coverage of the peers in unstructured peer-to-peer(p2p) networks that use TTLbased flooding mechanism for search and query. However, we find that for many cases, the theory cannot be directly applied to obtain correct estimate of network coverage due to the presence of certain t...
For a general random intersection graph we show an approximation of the vertex degree distribution by a Poisson mixture. key words: intersection graph, random graph, degree distribution
The stochastic Kronecker Graph model can generate large random graph that closely resembles many real world networks. For example, the output graph has a heavy-tailed degree distribution, has a (low) diameter that effectively remains constant over time and obeys the so-called densification power law [1]. Aside from this list of very important graph properties, one may ask for some additional in...
We propose a new random graph model—Edge Popularity—for the web graph and other complex networks, where edges are deleted over time and an edge is chosen to be deleted with probability inversely proportional to the in-degree of the destination. We show that with probability tending to one as time tends to infinity, the model generates graphs whose degree distribution follows a power law. Depend...
We consider a SIR epidemic model propagating on a random network generated by configuration model, where the degree distribution of the vertices is given and where the edges are randomly matched. The evolution of the epidemics is summed up into three measurevalued equations that describe the degrees of the susceptible individuals and the number of edges from an infectious or removed individual ...
Random geometric graphs consist of randomly distributed nodes (points), with pairs of nodes within a given mutual distance linked. In the usual model the distribution of nodes is uniform on a square, and in the limit of infinitely many nodes and shrinking linking range, the number of isolated nodes is Poisson distributed, and the probability of no isolated nodes is equal to the probability the ...
Let F be a probability distribution with support on the non-negative integers. A model is proposed for generating stationary simple graphs on Z with degree distribution F and it is shown for this model that the expected total length of all edges at a given vertex is finite if F has finite second moment. It is not hard to see that any stationary model for generating simple graphs on Z will give ...
We study global distribution of zeros for a wide range of ensembles of random polynomials. Two main directions are related to almost sure limits of the zero counting measures, and to quantitative results on the expected number of zeros in various sets. In the simplest case of Kac polynomials, given by the linear combinations of monomials with i.i.d. random coefficients, it is well known that th...
A recursive method is derived to calculate all eigenvalue correlation functions of a random hermitian matrix in the large size limit, and after smoothing of the short scale oscillations. The property that the two-point function is universal, is recovered and the three and four-point functions are given explicitly. One observes that higher order correlation functions are linear combinations of u...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید