94,874 research outputs found
Degree Ranking Using Local Information
Most real world dynamic networks are evolved very fast with time. It is not
feasible to collect the entire network at any given time to study its
characteristics. This creates the need to propose local algorithms to study
various properties of the network. In the present work, we estimate degree rank
of a node without having the entire network. The proposed methods are based on
the power law degree distribution characteristic or sampling techniques. The
proposed methods are simulated on synthetic networks, as well as on real world
social networks. The efficiency of the proposed methods is evaluated using
absolute and weighted error functions. Results show that the degree rank of a
node can be estimated with high accuracy using only samples of the
network size. The accuracy of the estimation decreases from high ranked to low
ranked nodes. We further extend the proposed methods for random networks and
validate their efficiency on synthetic random networks, that are generated
using Erd\H{o}s-R\'{e}nyi model. Results show that the proposed methods can be
efficiently used for random networks as well
On sampling nodes in a network
Random walk is an important tool in many graph mining applications including estimating graph parameters, sampling portions of the graph, and extracting dense communities. In this paper we consider the problem of sampling nodes from a large graph according to a prescribed distribution by using random walk as the basic primitive. Our goal is to obtain algorithms that make a small number of queries to the graph but output a node that is sampled according to the prescribed distribution. Focusing on the uniform distribution case, we study the query complexity of three algorithms and show a near-tight bound expressed in terms of the parameters of the graph such as average degree and the mixing time. Both theoretically and empirically, we show that some algorithms are preferable in practice than the others. We also extend our study to the problem of sampling nodes according to some polynomial function of their degrees; this has implications for designing efficient algorithms for applications such as triangle counting
Efficient method for estimating the number of communities in a network
While there exist a wide range of effective methods for community detection
in networks, most of them require one to know in advance how many communities
one is looking for. Here we present a method for estimating the number of
communities in a network using a combination of Bayesian inference with a novel
prior and an efficient Monte Carlo sampling scheme. We test the method
extensively on both real and computer-generated networks, showing that it
performs accurately and consistently, even in cases where groups are widely
varying in size or structure.Comment: 13 pages, 4 figure
Monitoring wild animal communities with arrays of motion sensitive camera traps
Studying animal movement and distribution is of critical importance to
addressing environmental challenges including invasive species, infectious
diseases, climate and land-use change. Motion sensitive camera traps offer a
visual sensor to record the presence of a broad range of species providing
location -specific information on movement and behavior. Modern digital camera
traps that record video present new analytical opportunities, but also new data
management challenges. This paper describes our experience with a terrestrial
animal monitoring system at Barro Colorado Island, Panama. Our camera network
captured the spatio-temporal dynamics of terrestrial bird and mammal activity
at the site - data relevant to immediate science questions, and long-term
conservation issues. We believe that the experience gained and lessons learned
during our year long deployment and testing of the camera traps as well as the
developed solutions are applicable to broader sensor network applications and
are valuable for the advancement of the sensor network research. We suggest
that the continued development of these hardware, software, and analytical
tools, in concert, offer an exciting sensor-network solution to monitoring of
animal populations which could realistically scale over larger areas and time
spans
- …