Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Local-access generators for basic random graph models
Amartya Shankha Biswas
,
Ronitt Rubinfeld
,
Anak Yodpinyanee
Type:
Dissertation
Publication Date:
2017-11-29
Citations:
1
Share
Similar Works
Action
Title
Year
Authors
+
Local Access to Huge Random Objects through Partial Sampling
2017
Amartya Shankha Biswas
Ronitt Rubinfeld
Anak Yodpinyanee
+
Local Access to Huge Random Objects through Partial Sampling.
2017
Amartya Shankha Biswas
Ronitt Rubinfeld
Anak Yodpinyanee
+
PDF
Chat
Average-Case Local Computation Algorithms
2024
Amartya Shankha Biswas
Ruidi Cao
Edward Pyne
Ronitt Rubinfeld
+
Local Access to Random Walks
2021
Amartya Shankha Biswas
Edward Pyne
Ronitt Rubinfeld
+
Local Access to Random Walks.
2021
Amartya Shankha Biswas
Edward Pyne
Ronitt Rubinfeld
+
Sublinear Random Access Generators for Preferential Attachment Graphs
2016
Guy Even
Reut Levi
Moti Medina
Adi Rosén
+
Sublinear Random Access Generators for Preferential Attachment Graphs
2016
Guy Even
Reut Levi
Moti Medina
Adi Rosén
+
PDF
Chat
Sublinear Random Access Generators for Preferential Attachment Graphs
2021
Guy Even
Reut Levi
Moti Medina
Adi Rosén
+
Distributed Random Walks
2013
Atish Das Sarma
Danupon Nanongkai
Gopal Pandurangan
Prasad Tetali
+
Distributed Random Walks
2013
Atish Das Sarma
Danupon Nanongkai
Gopal Pandurangan
Prasad Tetali
+
A note on quickly sampling a sparse matrix with low rank expectation
2017
Karl Rohe
Jun Tao
Xintian Han
Norbert Binkiewicz
+
Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size
2021
Edward Pyne
Salil Vadhan
+
PDF
Chat
Generating Random Networks Without Short Cycles
2018
Mohsen Bayati
Andrea Montanari
Amin Saberi
+
On the Use of Randomness in Local Distributed Graph Algorithms
2019
Mohsen Ghaffari
Fabian Kühn
+
PDF
Chat
Generating Random Networks Without Short Cycles
2016
Mohsen Bayati
Andrea Montanari
Amin Saberi
+
Generating simple directed random graphs with a given degree sequence with a fast algorithm.
2021
Femke van Ieperen
Ivan Kryven
+
Generating Random Networks Without Short Cycles
2008
Mohsen Bayati
Andrea Montanari
Amin Saberi
+
Generating Random Networks Without Short Cycles
2008
Mohsen Bayati
Andrea Montanari
Amin Saberi
+
Fast sequential algorithm for generating directed random graphs with a given degree sequence
2021
Femke van Ieperen
Ivan Kryven
+
PDF
Chat
Distributed Random Walks
2013
Atish Das Sarma
Danupon Nanongkai
Gopal Pandurangan
Prasad Tetali
Works That Cite This (1)
Action
Title
Year
Authors
+
Local Access to Sparse Connected Subgraphs Via Edge Sampling.
2020
Rogers Epstein
Works Cited by This (13)
Action
Title
Year
Authors
+
On the uniform generation of random graphs with prescribed degree sequences
2003
Ron Milo
Nadav Kashtan
Shalev Itzkovitz
M. E. J. Newman
Uri Alon
+
None
2000
M. E. J. Newman
+
PDF
Chat
Reconstruction and estimation in the planted partition model
2014
Elchanan Mossel
Joseph Neeman
Allan Sly
+
Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery
2015
Emmanuel Abbé
Colin Sandon
+
Distributed Symmetry Breaking in Sampling (Optimal Distributed Randomly Coloring with Fewer Colors)
2018
Weiming Feng
Thomas P. Hayes
Yitong Yin
+
PDF
Chat
Exact Recovery in the Stochastic Block Model
2015
Emmanuel Abbé
Afonso S. Bandeira
Georgina Hall
+
PDF
Chat
Community detection in graphs
2009
Santo Fortunato
+
PDF
Chat
Parallel Algorithms for Generating Random Networks with Given Degree Sequences
2015
Maksudul Alam
Maleq Khan
+
Sublinear Random Access Generators for Preferential Attachment Graphs
2016
Guy Even
Reut Levi
Moti Medina
Adi Rosén
+
PDF
Chat
Community Detection and Stochastic Block Models
2018
Emmanuel Abbé