default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShankar Bhamidi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j19]Hui Shen, Shankar Bhamidi
, Yufeng Liu:
Statistical Significance of Clustering with Multidimensional Scaling. J. Comput. Graph. Stat. 33(1): 219-230 (2024)- [j18]Nelson Antunes, Sayan Banerjee, Shankar Bhamidi, Vladas Pipiras:
Representation, ranking and bias of minorities in sampling attributed networks. Soc. Netw. Anal. Min. 14(1): 158 (2024) - 2023
- [j17]Nelson Antunes, Sayan Banerjee, Shankar Bhamidi, Vladas Pipiras:
Learning attribute and homophily measures through random walks. Appl. Netw. Sci. 8(1): 39 (2023) - [j16]Robin Richter, Shankar Bhamidi, Sach Mukherjee:
Improved baselines for causal structure learning on interventional data. Stat. Comput. 33(5): 93 (2023) - 2022
- [j15]Shankar Bhamidi, Ruituo Fan, Nicolas Fraiman, Andrew B. Nobel:
Community modulated recursive trees and population dependent branching processes. Random Struct. Algorithms 60(2): 201-232 (2022) - 2021
- [j14]Nelson Antunes, Shankar Bhamidi, Tianjian Guo, Vladas Pipiras, Bang Wang:
Sampling Based Estimation of In-Degree Distribution for Directed Complex Networks. J. Comput. Graph. Stat. 30(4): 863-876 (2021) - [j13]Louigi Addario-Berry, Shankar Bhamidi, Sanchayan Sen:
A probabilistic approach to the leader problem in random graphs. Random Struct. Algorithms 58(1): 34-67 (2021) - 2020
- [j12]Shankar Bhamidi, Sanchayan Sen:
Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees. Random Struct. Algorithms 56(3): 676-721 (2020) - 2017
- [j11]Shankar Bhamidi, Remco van der Hofstad:
Diameter of the Stochastic Mean-Field Model of Distance. Comb. Probab. Comput. 26(6): 797-825 (2017) - [j10]James D. Wilson, John Palowitch, Shankar Bhamidi, Andrew B. Nobel:
Community Extraction in Multilayer Networks with Heterogeneous Community Structure. J. Mach. Learn. Res. 18: 149:1-149:49 (2017) - [j9]John Palowitch, Shankar Bhamidi, Andrew B. Nobel:
Significance-based community detection in weighted networks. J. Mach. Learn. Res. 18: 188:1-188:48 (2017) - [j8]James D. Wilson, Matthew J. Denny, Shankar Bhamidi, Skyler J. Cranmer, Bruce A. Desmarais:
Stochastic weighted graphs: Flexible model specification and simulation. Soc. Networks 49: 37-47 (2017) - 2015
- [j7]Louigi Addario-Berry, Shankar Bhamidi, Sébastien Bubeck, Luc Devroye, Gábor Lugosi, Roberto Imbuzeiro Oliveira:
Exceptional rotations of random graphs: a VC theory. J. Mach. Learn. Res. 16: 1893-1922 (2015) - [j6]Shankar Bhamidi, Amarjit Budhiraja, Xuan Wang:
Aggregation models with limited choice and the multiplicative coalescent. Random Struct. Algorithms 46(1): 55-116 (2015) - 2014
- [j5]Shankar Bhamidi, Amarjit Budhiraja, Xuan Wang:
Bounded-Size Rules: The Barely Subcritical Regime. Comb. Probab. Comput. 23(4): 505-538 (2014) - [j4]Shankar Bhamidi, Remco van der Hofstad, Júlia Komjáthy:
The front of the epidemic spread and first passage percolation. J. Appl. Probab. 51(A): 101-121 (2014) - 2011
- [j3]Shankar Bhamidi, Remco van der Hofstad, Gerard Hooghiemstra:
First Passage Percolation on the Erdős-Rényi Random Graph. Comb. Probab. Comput. 20(5): 683-707 (2011) - 2010
- [j2]Shankar Bhamidi, Ram Rajagopal, Sébastien Roch:
Network delay inference from additive metrics. Random Struct. Algorithms 37(2): 176-203 (2010) - [j1]David J. Aldous, Shankar Bhamidi:
Edge flows in the complete random-lengths network. Random Struct. Algorithms 37(3): 271-311 (2010)
Conference and Workshop Papers
- 2023
- [c3]Nelson Antunes, Sayan Banerjee, Shankar Bhamidi, Vladas Pipiras:
Minority Representation and Relative Ranking in Sampling Attributed Networks. COMPLEX NETWORKS (1) 2023: 137-149 - 2022
- [c2]Nelson Antunes, Shankar Bhamidi, Vladas Pipiras:
Learning Attribute Distributions Through Random Walks. COMPLEX NETWORKS (2) 2022: 17-29 - 2008
- [c1]Shankar Bhamidi, Guy Bresler, Allan Sly:
Mixing Time of Exponential Random Graphs. FOCS 2008: 803-812
Informal and Other Publications
- 2023
- [i9]Dhruv Patel, Hui Shen, Shankar Bhamidi, Yufeng Liu, Vladas Pipiras:
Consistency of Lloyd's Algorithm Under Perturbations. CoRR abs/2309.00578 (2023) - 2021
- [i8]Aman Barot, Shankar Bhamidi, Souvik Dhara:
Community detection using low-dimensional network embedding algorithms. CoRR abs/2111.05267 (2021) - 2019
- [i7]Mark He, Joseph Glasser, Nathaniel Pritchard, Shankar Bhamidi, Nikhil Kaza:
Demarcating Geographic Regions using Community Detection in Commuting Networks. CoRR abs/1903.06029 (2019) - [i6]Mark He, Joseph Glasser, Shankar Bhamidi, Nikhil Kaza:
Intertemporal Community Detection in Bikeshare Networks. CoRR abs/1906.04582 (2019) - 2018
- [i5]Nelson Antunes, Shankar Bhamidi, Tianjian Guo, Vladas Pipiras, Bang Wang:
Sampling-based Estimation of In-degree Distribution with Applications to Directed Complex Networks. CoRR abs/1810.01300 (2018) - 2016
- [i4]John Palowitch, Shankar Bhamidi, Andrew B. Nobel:
The Continuous Configuration Model: A Null for Community Detection on Weighted Networks. CoRR abs/1601.05630 (2016) - [i3]James D. Wilson, John Palowitch, Shankar Bhamidi, Andrew B. Nobel:
Community Extraction in Multilayer Networks with Heterogeneous Community Structure. CoRR abs/1610.06511 (2016) - 2013
- [i2]James D. Wilson, Simi Wang, Peter J. Mucha, Shankar Bhamidi, Andrew B. Nobel:
A Testing Based Extraction Algorithm for Identifying Significant Communities in Networks. CoRR abs/1308.0777 (2013) - 2006
- [i1]Shankar Bhamidi, Ram Rajagopal, Sébastien Roch:
Network Delay Inference from Additive Metrics. CoRR abs/math/0604367 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
