Abstract
Abstract An unknown network is modelled by a directed or undirected graph having vertices of different kinds. Partial information is available concerning the vertex labels and the edge occurrences within a simple random sample of vertices. Using this information we find unbiased estimators and variance estimators of such graph parameters which can be given as dyad or triad counts. In particular, we give approximate formulae pertaining to large networks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
