Statistical properties of a generalized threshold network model

From MaRDI portal
Publication:708786

DOI10.1007/S11009-008-9111-5zbMATH Open1210.05157arXiv0707.1744OpenAlexW2084731943WikidataQ62039409 ScholiaQ62039409MaRDI QIDQ708786FDOQ708786

Yusuke Ide, Naoki Masuda, Norio Konno

Publication date: 14 October 2010

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Abstract: The threshold network model is a type of finite random graphs. In this paper, we introduce a generalized threshold network model. A pair of vertices with random weights is connected by an edge when real-valued functions of the pair of weights belong to given Borel sets. We extend several known limit theorems for the number of prescribed subgraphs to show that the strong law of large numbers can be uniform convergence. We also prove two limit theorems for the local and global clustering coefficients.


Full work available at URL: https://arxiv.org/abs/0707.1744




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Statistical properties of a generalized threshold network model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708786)