Testing for Characteristics of Attribute Linked Infinite Networks based on Small Samples
Koushiki Sarkar, Diganta Mukherjee

TL;DR
This paper investigates the properties of large attribute-based networks using local sampling methods to estimate global characteristics, providing new statistical tools and simulations for analysis.
Contribution
It introduces modified Lovasz sampling strategies for attribute networks and derives probabilistic distributions for key network parameters.
Findings
Efficient estimation of degree distribution and centrality measures.
Derived limiting distributions for network parameters.
Validated methods through extensive simulations.
Abstract
The objective of this paper is to study the characteristics (geometric and otherwise) of very large attribute based undirected networks. Real-world networks are often very large and fast evolving. Their analysis and understanding present a great challenge. An Attribute based network is a graph in which the edges depend on certain properties of the vertices on which they are incident. In context of a social network, the existence of links between two individuals may depend on certain attributes of the two of them. We use the Lovasz type sampling strategy of observing a certain random process on a graph locally , i.e., in the neighborhood of a node, and deriving information about global properties of the graph. The corresponding adjacency matrix is our primary object of interest. We study the efficiency of recently proposed sampling strategies, modified to our set up, to estimate the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Advanced Graph Neural Networks · Graph Theory and Algorithms
