Graphlets are induced subgraph patterns and have been frequently applied to characterize the local topology structures of graphs across various domains, e.g., online social networks (OSNs) biological networks. Discovering computing graphlet statistics highly challenging. First, massive size real-world makes exact computation graphlets extremely expensive. Secondly, graph may not be readily available so one has resort web crawling using application programming interfaces (APIs). In this work,...

Counting subgraphs is a fundamental analysis task for online social networks (OSNs). Given the sheer size and restricted access of OSN, efficient computation subgraph counts highly challenging. Although number algorithms have been proposed to estimate relative in OSNs with access, there are only few works which try solve more general problem, i.e., counting frequencies. In this article, we propose an random walk-based framework counts. Our generates samples by leveraging consecutive steps...

Ethereum is one of the most popular blockchain systems that support more than half a million transactions every day and foster miscellaneous decentralized applications with its Turing-complete smart contract machine. Whereas it remains mysterious what transaction pattern how evolves over time. In this article, we study evolutionary behavior from temporal graph point view. We first develop data analytic platform to collect external associated users as well internal initiated by contracts....

Abstract Background Rice is commonly known as a staple crop consumed worldwide, though with several rice proteins being reported for allergic properties in clinical studies. Thus, there growing need the development of an animal model to better understand allergenicity and immunological pathophysiological mechanisms underlying food allergy. Methods Groups BALB/c mice were sensitized daily freshly homogenized flour (30 mg or 80 mg) without adjuvant by intragastric gavage. In addition,...

Counting subgraphs is a fundamental analysis task for online social networks (OSNs). Given the sheer size and restricted access of network data, efficient computation subgraph counts highly challenging. Although number algorithms have been proposed to estimate relative in OSNs with access, there are only few works which try solve more general problem, i.e., counting frequencies. In this paper, we propose an random walk-based framework counts. Our generates samples by leveraging consecutive...

Graphlets are induced subgraph patterns and have been frequently applied to characterize the local topology structures of graphs across various domains, e.g., online social networks (OSNs) biological networks. Discovering computing graphlet statistics highly challenging. First, massive size real-world makes exact computation graphlets extremely expensive. Secondly, graph may not be readily available so one has resort web crawling using application programming interfaces (APIs). In this work,...

Counting small connected subgraph patterns called graphlets is emerging as a powerful tool for exploring topological structure of networks and analysis roles individual nodes. Graphlets have numerous applications ranging from biology to network science. Computing graphlet counts "dynamic graphs" highly challenging due the streaming nature input, sheer size graphs, superlinear time complexity problem. Few practical results are known under massive graphs setting. In this work, we propose...

Point-to-point shortest distance queries are fundamental to large graph analytics. Motivated by the need for low-latency in large-scale "dynamic" graphs, we consider problem of answering exact on disk-resident scale-free dynamic graphs. Our query processing uses canonical labeling method, which is a special 2-hop fast queries. In this paper, propose two I/O efficient algorithms update labeling. To best our knowledge, proposed methods first practical disk-based "incrementally update" We also...

Graphlets are induced subgraph patterns that crucial to the understanding of structure and function a large network. A lot effort has been devoted calculating graphlet statistics where random walk-based approaches commonly used access restricted graphs through available application programming interfaces (APIs). However, most them merely consider individual networks while overlooking strong coupling between different networks. In this article, we estimate concentration in multiplex with...