English
Related papers

Related papers: Practical Characterization of Large Networks Using…

200 papers

Exploring statistics of locally connected subgraph patterns (also known as network motifs) has helped researchers better understand the structure and function of biological and online social networks (OSNs). Nowadays the massive size of…

Social and Information Networks · Computer Science 2014-03-28 Pinghui Wang , John C. S. Lui , Bruno Ribeiro , Don Towsley , Junzhou Zhao , Xiaohong Guan

Data concerning the users and usage of Online Social Networks (OSNs) has become available externally, from public resources (e.g., user profiles), participation in OSNs (e.g., establishing relationships and recording transactions such as…

Data Structures and Algorithms · Computer Science 2016-12-15 Nick Duffield , Balachander Krishnamurthy

Online social network services provide a platform for human social interactions. Nowadays, many kinds of online interactions generate large-scale social network data. Network analysis helps to mine knowledge and pattern from the…

Social and Information Networks · Computer Science 2021-02-19 Andry Alamsyah , Yahya Peranginangin , Intan Muchtadi-Alamsyah , Budi Rahardjo , Kuspriyanto

Most sampling techniques for online social networks (OSNs) are based on a particular sampling method on a single graph, which is referred to as a statistics. However, various realizing methods on different graphs could possibly be used in…

Social and Information Networks · Computer Science 2015-12-21 Xin Wang , Richard T. B. Ma , Yinlong Xu , Zhipeng Li

Graph sampling allows mining a small representative subgraph from a big graph. Sampling algorithms deploy different strategies to replicate the properties of a given graph in the sampled graph. In this study, we provide a comprehensive…

Social and Information Networks · Computer Science 2021-02-17 Muhammad Irfan Yousuf , Izza Anwer , Raheel Anwar

Large data applications rely on storing data in massive, sparse graphs with millions to trillions of nodes. Graph-based methods, such as node prediction, aim for computational efficiency regardless of graph size. Techniques like localized…

Data Structures and Algorithms · Computer Science 2025-07-08 Yushen Huang , Ertai Luo , Reza Babenezhad , Yifan Sun

Using random walks for sampling has proven advantageous in assessing the characteristics of large and unknown social networks. Several algorithms based on random walks have been introduced in recent years. In the practical application of…

Social and Information Networks · Computer Science 2024-09-18 Tsuyoshi Hasegawa , Shiori Hironaka , Kazuyuki Shudo

Sensor placement for the purpose of detecting/tracking news outbreak and preventing rumor spreading is a challenging problem in a large scale online social network (OSN). This problem is a kind of subset selection problem: choosing a small…

Social and Information Networks · Computer Science 2013-12-09 Junzhou Zhao , John C. S. Lui , Don Towsley , Xiaohong Guan , Pinghui Wang

State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation (typically friendship). While powerful, these methods rely on the social graph being fully…

Networking and Internet Architecture · Computer Science 2011-06-20 Minas Gjoka , Carter T. Butts , Maciej Kurant , Athina Markopoulou

Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this area has primarily focused on obtaining a representative…

Social and Information Networks · Computer Science 2011-05-30 Maciej Kurant , Minas Gjoka , Yan Wang , Zack W. Almquist , Carter T. Butts , Athina Markopoulou

Sampling from large networks represents a fundamental challenge for social network research. In this paper, we explore the sensitivity of different sampling techniques (node sampling, edge sampling, random walk sampling, and snowball…

Social and Information Networks · Computer Science 2017-02-20 Claudia Wagner , Philipp Singer , Fariba Karimi , Jürgen Pfeffer , Markus Strohmaier

A powerful framework for studying graphs is to consider them as geometric graphs: nodes are randomly sampled from an underlying metric space, and any pair of nodes is connected if their distance is less than a specified neighborhood radius.…

Machine Learning · Computer Science 2022-11-28 Raffaele Paolino , Aleksandar Bojchevski , Stephan Günnemann , Gitta Kutyniok , Ron Levie

Any network studied in the literature is inevitably just a sampled representative of its real-world analogue. Additionally, network sampling is lately often applied to large networks to allow for their faster and more efficient analysis.…

Social and Information Networks · Computer Science 2015-04-14 Neli Blagus , Lovro Šubelj , Gregor Weiss , Marko Bajec

Network datasets appear across a wide range of scientific fields, including biology, physics, and the social sciences. To enable data-driven discoveries from these networks, statistical inference techniques like estimation and hypothesis…

Methodology · Statistics 2026-02-19 Arpan Kumar , Minh Tang , Srijan Sengupta

Network sampling is integral to the analysis of social, information, and biological networks. Since many real-world networks are massive in size, continuously evolving, and/or distributed in nature, the network structure is often sampled in…

Social and Information Networks · Computer Science 2012-11-16 Nesreen K. Ahmed , Jennifer Neville , Ramana Kompella

The amount of large-scale real data around us increase in size very quickly and so does the necessity to reduce its size by obtaining a representative sample. Such sample allows us to use a great variety of analytical methods, whose direct…

Social and Information Networks · Computer Science 2014-02-10 Milos Kudelka , Sarka Zehnalova , Jan Platos

Traditional graph-based semi-supervised learning (SSL) approaches, even though widely applied, are not suited for massive data and large label scenarios since they scale linearly with the number of edges $|E|$ and distinct labels $m$. To…

Machine Learning · Computer Science 2016-05-17 Sujith Ravi , Qiming Diao

Network sampling is a crucial technique for analyzing large or partially observable networks. However, the effectiveness of different sampling methods can vary significantly depending on the context. In this study, we empirically compare…

Social and Information Networks · Computer Science 2025-05-05 Quoc Chuong Nguyen

Online Social Network (OSN) is one of the most hottest services in the past years. It preserves the life of users and provides great potential for journalists, sociologists and business analysts. Crawling data from social network is a basic…

Social and Information Networks · Computer Science 2013-12-10 Rui Guo , Hongzhi Wang , Mengwen Chen , Jianzhong Li , Hong Gao

Network (or graph) sparsification compresses a graph by removing inessential edges. By reducing the data volume, it accelerates or even facilitates many downstream analyses. Still, the accuracy of many sparsification methods, with…

Social and Information Networks · Computer Science 2023-09-28 Zhen Su , Jürgen Kurths , Henning Meyerhenke
‹ Prev 1 2 3 10 Next ›