Shankar Bhamidi

Orcid: 0009-0000-3953-936X

According to our database1, Shankar Bhamidi authored at least 25 papers between 2008 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Learning attribute and homophily measures through random walks.
Appl. Netw. Sci., December, 2023

Improved baselines for causal structure learning on interventional data.
Stat. Comput., October, 2023

Consistency of Lloyd's Algorithm Under Perturbations.
CoRR, 2023

2022
Community modulated recursive trees and population dependent branching processes.
Random Struct. Algorithms, 2022

2021
A probabilistic approach to the leader problem in random graphs.
Random Struct. Algorithms, 2021

Sampling Based Estimation of In-Degree Distribution for Directed Complex Networks.
J. Comput. Graph. Stat., 2021

Community detection using low-dimensional network embedding algorithms.
CoRR, 2021

2020
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, 2020

2019
Intertemporal Community Detection in Bikeshare Networks.
CoRR, 2019

Demarcating Geographic Regions using Community Detection in Commuting Networks.
CoRR, 2019

2018
Sampling-based Estimation of In-degree Distribution with Applications to Directed Complex Networks.
CoRR, 2018

2017
Stochastic weighted graphs: Flexible model specification and simulation.
Soc. Networks, 2017

Community Extraction in Multilayer Networks with Heterogeneous Community Structure.
J. Mach. Learn. Res., 2017

Significance-based community detection in weighted networks.
J. Mach. Learn. Res., 2017

Diameter of the Stochastic Mean-Field Model of Distance.
Comb. Probab. Comput., 2017

2016
The Continuous Configuration Model: A Null for Community Detection on Weighted Networks.
CoRR, 2016

2015
Aggregation models with limited choice and the multiplicative coalescent.
Random Struct. Algorithms, 2015

Exceptional rotations of random graphs: a VC theory.
J. Mach. Learn. Res., 2015

2014
The front of the epidemic spread and first passage percolation.
J. Appl. Probab., 2014

Bounded-Size Rules: The Barely Subcritical Regime.
Comb. Probab. Comput., 2014

2013
A Testing Based Extraction Algorithm for Identifying Significant Communities in Networks.
CoRR, 2013

2011
First Passage Percolation on the Erdős-Rényi Random Graph.
Comb. Probab. Comput., 2011

2010
Network delay inference from additive metrics.
Random Struct. Algorithms, 2010

Edge flows in the complete random-lengths network.
Random Struct. Algorithms, 2010

2008
Mixing Time of Exponential Random Graphs.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008


  Loading...