Bipartite Yule Processes in Collections of Journal Papers

نویسنده

  • Steven A. Morris
چکیده

Collections of journal papers, often referred to as ’citation networks’, can be modeled as a collection of coupled bipartite networks which tend to exhibit linear growth and preferential attachment as papers are added to the collection. Assuming primary nodes in the first partition and secondary nodes in the second partition, the basic bipartite Yule process assumes that as each primary node is added to the network, it links to multiple secondary nodes, and with probability, α, each new link may connect to a newly appearing secondary node. The number of links from a new primary node follows some distribution that is a characteristic of the specific network. Links to existing secondary nodes follow a preferential attachment rule. With modifications to adapt to specific networks, bipartite Yule processes simulate networks that can be validated against actual networks using a wide variety of network metrics. The application of bipartite Yule processes to the simulation of paperreference networks and paper-author networks is demonstrated and simulation results are shown to mimic networks from actual collections of papers across several network metrics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending the Clapper-Yule model to rough printing supports.

The Clapper-Yule model is the only classical spectral reflection model for halftone prints that takes explicitly into account both the multiple internal reflections between the print-air interface and the paper substrate and the lateral propagation of light within the paper bulk. However, the Clapper-Yule model assumes a planar interface and does not take into account the roughness of the print...

متن کامل

Connecting Yule Process, Bisection and Binary Search Tree via Martingales

We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.

متن کامل

Zarankiewicz Numbers and Bipartite Ramsey Numbers

The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...

متن کامل

PERCUTANEOUS DRAINAGE OF ABDOMINAL ABSCESSES AND FLUID COLLECTIONS

This report summarizes the results of 64 percutaneous catheter drainage of abdominal abscesses and fluid collections in 56 patients. Aspiration and drainage was guided with computed tomography in 34 patients and with ultrasound in 30 patients. Success rate was 90%. Infected collections were successfully drained in 94% and noninfected collections in 72% . Partial success was achieved in two...

متن کامل

Stochastic properties of generalised Yule models, with biodiversity applications.

The Yule model is a widely used speciation model in evolutionary biology. Despite its simplicity many aspects of the Yule model have not been explored mathematically. In this paper, we formalise two analytic approaches for obtaining probability densities of individual branch lengths of phylogenetic trees generated by the Yule model. These methods are flexible and permit various aspects of the t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008