( en | de | ru )

 

Disambiguation of "Nanumyan, Vahan"

Author of the publication

copydeleteadd this publication to your clipboard
From Relational Data to Graphs: Inferring Significant Links Using Generalized Hypergeometric Ensembles.

, , , and . SocInfo (2), volume 10540 of Lecture Notes in Computer Science, page 111-120. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Vahan Hadjetian

Vahan Balassanian

 

Other publications of authors with the same name

Generalised hypergeometric ensembles of random graphs: the configuration model as an urn problem., and . CoRR, (2018)From Relational Data to Graphs: Inferring Significant Links Using Generalized Hypergeometric Ensembles., , , and . SocInfo (2), volume 10540 of Lecture Notes in Computer Science, page 111-120. Springer, (2017)Structure and Dynamics of Collaborative Knowledge Networks.. ETH Zurich, Zürich, Switzerland, (2018)base-search.net (ftethz:oai:www.research-collection.ethz.ch:20.500.11850/282134).Generalized hypergeometric ensembles: Statistical hypothesis testing in complex networks, , , and . arXiv preprint arXiv:1607.02441, (2016)Detecting Path Anomalies in Time Series Data on Networks., , , , , and . CoRR, (2019)Citations driven by social connections? A multi-layer representation of coauthorship networks, , and . Quantitative Science Studies, 1 (4): 1493--1509 (2020)HYPA: Efficient Detection of Path Anomalies in Time Series Data on Networks., , , , , and . SDM, page 460-468. SIAM, (2020)The conference was canceled because of the coronavirus pandemic, the reviewed papers are published in this volume..How do OSS projects change in number and size? A large-scale analysis to test a model of project growth, , , and . (2015)cite arxiv:1506.06924Comment: 22 pages, 10 figures.Quantifying triadic closure in multi-edge social networks., , , and . ASONAM, page 307-310. ACM, (2019)