Amanote Research

Amanote Research

    RegisterSign In

Community Detection on Euclidean Random Graphs

doi 10.1137/1.9781611975031.142
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2018

Authors
Abishek SankararamanFrançois Baccelli
Publisher

Society for Industrial and Applied Mathematics


Related search

Parallel Community Detection on Massive Graphs

2016English

Large-Scale Community Detection on Speaker Content Graphs

2013English

Short Random Walks on Graphs

SIAM Journal on Discrete Mathematics
Mathematics
1996English

Sandwiching Random Regular Graphs Between Binomial Random Graphs

2020English

Euclidean Distances, Soft and Spectral Clustering on Weighted Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Representation of Euclidean Random Field

Nagoya Mathematical Journal
Mathematics
1987English

Short Random Walks on Graphs

1993English

Chasing a Fast Robber on Planar Graphs and Random Graphs

Journal of Graph Theory
GeometryTopology
2014English

On the Bounded-Hop MST Problem on Random Euclidean Instances

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy