Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Formal Treatment of Generalized Preferential Attachment and its Empirical Validation
144
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Generalized preferential attachment is defined as the tendency of a vertex to acquire new links in the future with respect to a particular vertex property. Understanding which properties influence link acquisition tendency (LAT) gives us a predictive power to estimate the future growth of network and insight about the actual dynamics governing the complex networks. In this study, we explore the effect of age and degree on LAT by analyzing data collected from a new complex-network growth dataset. We found that LAT and degree of a vertex are linearly correlated in accordance with previous studies. Interestingly, the relation between LAT and age of a vertex is found to be in conflict with the known models of network growth. We identified three different periods in the networks lifetime where the relation between age and LAT is strongly positive, almost stationary and negative correspondingly.
rate research
Read More
We introduce a model of proportional growth to explain the distribution $P(g)$ of business firm growth rates. The model predicts that $P(g)$ is Laplace in the central part and depicts an asymptotic power-law behavior in the tails with an exponent $zeta=3$. Because of data limitations, previous studies in this field have been focusing exclusively on the Laplace shape of the body of the distribution. We test the model at different levels of aggregation in the economy, from products, to firms, to countries, and we find that the its predictions are in good agreement with empirical evidence on both growth distributions and size-variance relationships.
We consider the degree distributions of preferential attachment random graph models with choice similar to those considered in recent work by Malyshkin and Paquette and Krapivsky and Redner. In these models a new vertex chooses $r$ vertices according to a preferential rule and connects to the vertex in the selection with the $s$th highest degree. For meek choice, where $s>1$, we show that both double exponential decay of the degree distribution and condensation-like behaviour are possible, and provide a criterion to distinguish between them. For greedy choice, where $s=1$, we confirm that the degree distribution asympotically follows a power law with logarithmic correction when $r=2$ and shows condensation-like behaviour when $r>2$.
A message passing algorithm is derived for recovering communities within a graph generated by a variation of the Barab{a}si-Albert preferential attachment model. The estimator is assumed to know the arrival times, or order of attachment, of the vertices. The derivation of the algorithm is based on belief propagation under an independence assumption. Two precursors to the message passing algorithm are analyzed: the first is a degree thresholding (DT) algorithm and the second is an algorithm based on the arrival times of the children (C) of a given vertex, where the children of a given vertex are the vertices that attached to it. Comparison of the performance of the algorithms shows it is beneficial to know the arrival times, not just the number, of the children. The probability of correct classification of a vertex is asymptotically determined by the fraction of vertices arriving before it. Two extensions of Algorithm C are given: the first is based on joint likelihood of the children of a fixed set of vertices; it can sometimes be used to seed the message passing algorithm. The second is the message passing algorithm. Simulation results are given.
Nanoscientists have long conjectured that adjacent nanoparticles aggregate with one another in certain preferential directions during a chemical synthesis of nanoparticles, which is referred to the oriented attachment. For the study of the oriented attachment, the microscopy and nanoscience communities have used dynamic electron microscopy for direct observations of nanoparticle aggregation and have been so far relying on manual and qualitative analysis of the observations. We propose a statistical approach for studying the oriented attachment quantitatively with multiple aggregation examples in imagery observations. We abstract an aggregation by an event of two primary geometric objects merging into a secondary geometric object. We use a point set representation to describe the geometric features of the primary objects and the secondary object, and formulated the alignment of two point sets to one point set to estimate the orientation angles of the primary objects in the secondary object. The estimated angles are used as data to estimate the probability distribution of the orientation angles and test important hypotheses statistically. The proposed approach was applied for our motivating example, which demonstrated that nanoparticles of certain geometries have indeed preferential orientations in their aggregates.
We consider an evolving preferential attachment random graph model where at discrete times a new node is attached to an old node, selected with probability proportional to a superlinear function of its degree. For such schemes, it is known that the graph evolution condenses, that is a.s. in the limit graph there will be a single random node with infinite degree, while all others have finite degree. In this note, we establish a.s. law of large numbers type limits and fluctuation results, as $nuparrowinfty$, for the counts of the number of nodes with degree $kgeq 1$ at time $ngeq 1$. These limits rigorously verify and extend a physical picture of Krapivisky, Redner and Leyvraz (2000) on how the condensation arises with respect to the degree distribution.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
