2021
DOI: 10.1016/j.csda.2021.107263
|View full text |Cite
|
Sign up to set email alerts
|

A motif building process for simulating random networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
9
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
6
2

Relationship

3
5

Authors

Journals

citations
Cited by 11 publications
(10 citation statements)
references
References 36 publications
0
9
0
Order By: Relevance
“…Here edges are selected randomly for updating assuming that time has some passage between each update. Firstly, the updating function starts with a list of objects that would be used to store an updated network (Luke, 2015;Polansky and Pramanik, 2021). Then inside a loop a random node is selected, and the update function is called when an existing edge is removed, and a new edge is added.…”
Section: Spread Of the Pandemicmentioning
confidence: 99%
“…Here edges are selected randomly for updating assuming that time has some passage between each update. Firstly, the updating function starts with a list of objects that would be used to store an updated network (Luke, 2015;Polansky and Pramanik, 2021). Then inside a loop a random node is selected, and the update function is called when an existing edge is removed, and a new edge is added.…”
Section: Spread Of the Pandemicmentioning
confidence: 99%
“…This surface is continuous but not differentiable. Furthermore, at 8/3 this behaves like a Brownian surface Sheffield, 2015, 2016;Hua, Polansky and Pramanik, 2019;Polansky, 2019, 2020b;Polansky and Pramanik, 2021;Pramanik and Polansky, 2021;Pramanik, 2021d). Furthermore, this approach can be used to obtain a solution for stability of an economy after pandemic crisis (Ahamed, 2021a), determine an optimal bank profitability (Islam, Alam and Chowdhury;Alam, Sultan and Afrin;Mohammad and Mohammad, 2010;Alam, Khondker and Molla, 2013;Hossain and Ahamed, 2015;Pramanik, 2016;ALAM and HOSSAIN, 2018;Ahamed, 2021b;Alam, 2021a,b).…”
Section: Introductionmentioning
confidence: 99%
“…Based on the grouping, I classify the social network directed graph and determine the adjacency matrix without existence of a loop. Furthermore, an undirected network graph leads to a symmetric adjacency matrix (Pramanik 2016;Hua et al 2019;Polansky and Pramanik 2021). The diagonal terms of this matrix are zero, and the off-diagonal terms have different values based on their weight in relation to the other persons in a community.…”
Section: Introductionmentioning
confidence: 99%
“…The statistical analysis of network formation goes dates back to the seminal work by Erdös and Rényi (1959) where a random graph is based on independent links with a fixed probability (Sheng 2020). Beyond Erdös-Rényi model, many methods have been designed to simulate graphs with characteristics like degree distributions, small world, and Markov type properties (Polansky and Pramanik 2021;Pramanik 2021c).…”
Section: Introductionmentioning
confidence: 99%