Sublinear Algorithms for Parameterized Matching

2006 ◽  
pp. 354-364 ◽  
Author(s):  
Leena Salmela ◽  
Jorma Tarhio
Keyword(s):  
Sublinear Algorithms

scholarly journals Sublinear Algorithms in the External Memory Model

2010 ◽  
pp. 240-243
Author(s):  
Alexandr Andoni ◽  
Piotr Indyk ◽  
Krzysztof Onak ◽  
Ronitt Rubinfeld
Keyword(s):  
External Memory ◽  
Memory Model ◽  
Sublinear Algorithms

scholarly journals Sublinear Random Access Generators for Preferential Attachment Graphs

2021 ◽  
Vol 17 (4) ◽  
pp. 1-26
Author(s):  
Guy Even ◽  
Reut Levi ◽  
Moti Medina ◽  
Adi Rosén
Keyword(s):  
Random Graph ◽  
Preferential Attachment ◽  
Random Access ◽  
Graph Model ◽  
Efficient Estimation ◽  
Sublinear Algorithms ◽  
Tree Model ◽  
Random Graph Model ◽  
Time Space ◽  
Attachment Model

We consider the problem of sampling from a distribution on graphs, specifically when the distribution is defined by an evolving graph model, and consider the time, space, and randomness complexities of such samplers. In the standard approach, the whole graph is chosen randomly according to the randomized evolving process, stored in full, and then queries on the sampled graph are answered by simply accessing the stored graph. This may require prohibitive amounts of time, space, and random bits, especially when only a small number of queries are actually issued. Instead, we propose a setting where one generates parts of the sampled graph on-the-fly, in response to queries, and therefore requires amounts of time, space, and random bits that are a function of the actual number of queries. Yet, the responses to the queries correspond to a graph sampled from the distribution in question. Within this framework, we focus on two random graph models: the Barabási-Albert Preferential Attachment model (BA-graphs) ( Science , 286 (5439):509–512) (for the special case of out-degree 1) and the random recursive tree model ( Theory of Probability and Mathematical Statistics , (51):1–28). We give on-the-fly generation algorithms for both models. With probability 1-1/poly( n ), each and every query is answered in polylog( n ) time, and the increase in space and the number of random bits consumed by any single query are both polylog( n ), where n denotes the number of vertices in the graph. Our work thus proposes a new approach for the access to huge graphs sampled from a given distribution, and our results show that, although the BA random graph model is defined by a sequential process, efficient random access to the graph’s nodes is possible. In addition to the conceptual contribution, efficient on-the-fly generation of random graphs can serve as a tool for the efficient simulation of sublinear algorithms over large BA-graphs, and the efficient estimation of their on such graphs.

Sublinear Algorithms for Extreme-Scale Data Analysis

2014 ◽  
pp. 39-54 ◽  
Author(s):  
C. Seshadhri ◽  
Ali Pinar ◽  
David Thompson ◽  
Janine C. Bennett
Keyword(s):  
Data Analysis ◽  
Sublinear Algorithms ◽  
Extreme Scale ◽  
Scale Data

Sublinear algorithms for outlier detection and generalized closeness testing

2014 ◽  
Author(s):  
Jayadev Acharya ◽  
Ashkan Jafarpour ◽  
Alon Orlitsky ◽  
Ananda Theertha Suresh
Keyword(s):  
Outlier Detection ◽  
Sublinear Algorithms

scholarly journals Sublinear Algorithms for Approximating String Compressibility

Algorithmica ◽  
2012 ◽  
Vol 65 (3) ◽  
pp. 685-709 ◽  
Author(s):  
Sofya Raskhodnikova ◽  
Dana Ron ◽  
Ronitt Rubinfeld ◽  
Adam Smith
Keyword(s):  
Sublinear Algorithms
Sign in / Sign up

Export Citation Format

Share Document