Zobrazeno 1 - 10 of 28 pro vyhledávání: '"Kadavankandy, Arun"'
1
Dissertation/ Thesis
L'analyse spectrale des graphes aléatoires et son application au groupement et l'échantillonnage
Autor: Kadavankandy, Arun
Dans cette thèse, nous étudions les graphes aléatoires en utilisant des outils de la théorie des matrices aléatoires et l’analyse probabilistique afin de résoudre des problèmes clefs dans le domaine des réseaux complexes et Big Data. Le pre
Externí odkaz: http://www.theses.fr/2017AZUR4059/document
Zobrazit plný text záznamu
2
Report
Mean Field Analysis of Personalized PageRank with Implications for Local Graph Clustering
Autor: Avrachenkov, Konstantin, Kadavankandy, Arun, Litvak, Nelly
We analyse a mean-field model of Personalized PageRank on the Erdos-Renyi random graph containing a denser planted Erdos-Renyi subgraph. We investigate the regimes where the values of Personalized PageRank concentrate around the mean-field value. We
Externí odkaz: http://arxiv.org/abs/1806.07640
Zobrazit plný text záznamu
3
Report
PageRank in Undirected Random Graphs
Autor: Avrachenkov, Konstantin, Kadavankandy, Arun, Prokhorenkova, Liudmila Ostroumova, Raigorodskii, Andrei
PageRank has numerous applications in information retrieval, reputation systems, machine learning, and graph partitioning. In this paper, we study PageRank in undirected random graphs with an expansion property. The Chung-Lu random graph is an exampl
Externí odkaz: http://arxiv.org/abs/1703.08057
Zobrazit plný text záznamu
4
Report
The Power of Side-information in Subgraph Detection
Autor: Kadavankandy, Arun, Avrachenkov, Konstantin, Cottatellucci, Laura, Sundaresan, Rajesh
In this work, we tackle the problem of hidden community detection. We consider Belief Propagation (BP) applied to the problem of detecting a hidden Erd\H{o}s-R\'enyi (ER) graph embedded in a larger and sparser ER graph, in the presence of side-inform
Externí odkaz: http://arxiv.org/abs/1611.04847
Zobrazit plný text záznamu
5
Report
PageRank in undirected random graphs
Autor: Avrachenkov, Konstantin, Kadavankandy, Arun, Ostroumova, Liudmila, Raigorodskii, Andrei
PageRank has numerous applications in information retrieval, reputation systems, machine learning, and graph partitioning.In this paper, we study PageRank in undirected random graphs with expansion property. The Chung-Lu random graph representsan exa
Externí odkaz: http://arxiv.org/abs/1511.04925
Zobrazit plný text záznamu
10
Le Pouvoir d'Information Supplementaire en Detection des Sousgraphes
Autor: Kadavankandy, Arun, Avrachenkov, Konstantin, Cottatellucci, Laura, Sundaresan, Rajesh
Publikováno v: [Research Report] RR-8974, Inria Sophia Antipolis. 2017, pp.37
In this work, we tackle the problem of hidden community detection. We consider Belief Propagation (BP) applied to the problem of detecting a hidden Erd\H{o}s-R\'enyi (ER) graph embedded in a larger and sparser ER graph, in the presence of side-inform
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0993b31350cd00f2ba7f66266d1aa159
https://hal.inria.fr/hal-01394889v4/document
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje