@article{DBLP:journals/corr/abs-2203-06491,
  author    = {Mayank Kejriwal and
               Ke Shen},
  title     = {Can Scale-free Network Growth with Triad Formation Capture Simplicial
               Complex Distributions in Real Communication Networks?},
  journal   = {CoRR},
  volume    = {abs/2203.06491},
  year      = {2022},
  url       = {https://doi.org/10.48550/arXiv.2203.06491},
  doi       = {10.48550/arXiv.2203.06491},
  eprinttype = {arXiv},
  eprint    = {2203.06491},
  timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2203-06491.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"DPvdGsDHJEYgDu54g","bibbaseid":"kejriwal-shen-canscalefreenetworkgrowthwithtriadformationcapturesimplicialcomplexdistributionsinrealcommunicationnetworks-2022","author_short":["Kejriwal, M.","Shen, K."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Mayank"],"propositions":[],"lastnames":["Kejriwal"],"suffixes":[]},{"firstnames":["Ke"],"propositions":[],"lastnames":["Shen"],"suffixes":[]}],"title":"Can Scale-free Network Growth with Triad Formation Capture Simplicial Complex Distributions in Real Communication Networks?","journal":"CoRR","volume":"abs/2203.06491","year":"2022","url":"https://doi.org/10.48550/arXiv.2203.06491","doi":"10.48550/arXiv.2203.06491","eprinttype":"arXiv","eprint":"2203.06491","timestamp":"Wed, 16 Mar 2022 00:00:00 +0100","biburl":"https://dblp.org/rec/journals/corr/abs-2203-06491.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/corr/abs-2203-06491,\n author = {Mayank Kejriwal and\n Ke Shen},\n title = {Can Scale-free Network Growth with Triad Formation Capture Simplicial\n Complex Distributions in Real Communication Networks?},\n journal = {CoRR},\n volume = {abs/2203.06491},\n year = {2022},\n url = {https://doi.org/10.48550/arXiv.2203.06491},\n doi = {10.48550/arXiv.2203.06491},\n eprinttype = {arXiv},\n eprint = {2203.06491},\n timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/corr/abs-2203-06491.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Kejriwal, M.","Shen, K."],"key":"DBLP:journals/corr/abs-2203-06491","id":"DBLP:journals/corr/abs-2203-06491","bibbaseid":"kejriwal-shen-canscalefreenetworkgrowthwithtriadformationcapturesimplicialcomplexdistributionsinrealcommunicationnetworks-2022","role":"author","urls":{"Paper":"https://doi.org/10.48550/arXiv.2203.06491"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"usc-isi-i2.github.io/kejriwal/doc/complete.bib","dataSources":["d7ppAiY7pz6RZLwpY","SjrwGAA7ah7PjkNNm","E7HtrXAfg4zKQPPmh"],"keywords":[],"search_terms":["scale","free","network","growth","triad","formation","capture","simplicial","complex","distributions","real","communication","networks","kejriwal","shen"],"title":"Can Scale-free Network Growth with Triad Formation Capture Simplicial Complex Distributions in Real Communication Networks?","year":2022}