Indexing metadata

Assortativity and clustering of sparse random intersection graphs


 
Dublin Core PKP Metadata Items Metadata for this Document
 
1. Title Title of document Assortativity and clustering of sparse random intersection graphs
 
2. Creator Author's name, affiliation, country Mindaugas Bloznelis; Vilnius University
 
2. Creator Author's name, affiliation, country Jerzy Jaworski; Adam Mickiewicz University
 
2. Creator Author's name, affiliation, country Valentas Kurauskas; Vilnius University
 
3. Subject Discipline(s)
 
3. Subject Keyword(s) assortativity; clustering; power law; random graph; random intersection graph
 
3. Subject Subject classification 05C80; 05C82; 91D30
 
4. Description Abstract We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptotic expressions for  the correlation coefficient of degrees of adjacent nodes (called the assortativity coefficient), the expected number of common neighbours of adjacent nodes, and  the expected degree of a neighbour of a node of a given degree k. These expressions are written in terms of the asymptotic degree distribution and, alternatively, in terms of the parameters defining the underlying random graph model.
 
5. Publisher Organizing agency, location
 
6. Contributor Sponsor(s) Research Council of Lithuania; National Science Centre (Poland)
 
7. Date (YYYY-MM-DD) 2013-03-13
 
8. Type Status & genre Peer-reviewed Article
 
8. Type Type
 
9. Format File format PDF
 
10. Identifier Uniform Resource Identifier http://ejp.ejpecp.org/article/view/2277
 
10. Identifier Digital Object Identifier 10.1214/EJP.v18-2277
 
11. Source Journal/conference title; vol., no. (year) Electronic Journal of Probability; Vol 18
 
12. Language English=en en
 
14. Coverage Geo-spatial location, chronological period, research sample (gender, age, etc.)
 
15. Rights Copyright and permissions The Electronic Journal of Probability applies the Creative Commons Attribution License (CCAL) to all articles we publish in this journal. Under the CCAL, authors retain ownership of the copyright for their article, but authors allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles published in EJP, so long as the original authors and source are credited. This broad license was developed to facilitate open access to, and free use of, original works of all types. Applying this standard license to your work will ensure your right to make your work freely and openly available.

Summary of the Creative Commons Attribution License

You are free
  • to copy, distribute, display, and perform the work
  • to make derivative works
  • to make commercial use of the work
under the following condition of Attribution: others must attribute the work if displayed on the web or stored in any electronic archive by making a link back to the website of EJP via its Digital Object Identifier (DOI), or if published in other media by acknowledging prior publication in this Journal with a precise citation including the DOI. For any further reuse or distribution, the same terms apply. Any of these conditions can be waived by permission of the Corresponding Author.