IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v162y2021ics0167947321000979.html
   My bibliography  Save this article

A motif building process for simulating random networks

Author

Listed:
  • Polansky, Alan M.
  • Pramanik, Paramahansa

Abstract

A simple stochastic process is described which provides a useful basis for generating some types of random networks. The process is based on an iterative building block technique that uses a motif profile as a conditional probability model. The conditional iterative form of the algorithm insures that the calculations required to simulate an observed random network are relatively simple and does not require complicated models to be fit to an observed network. Bounds on the theoretical cohesiveness of the realized networks are established and empirical studies provide indications on more general properties of the resulting network, suggesting the types of applications where the process would be useful. The algorithm is used to generate networks similar to those observed in several examples.

Suggested Citation

  • Polansky, Alan M. & Pramanik, Paramahansa, 2021. "A motif building process for simulating random networks," Computational Statistics & Data Analysis, Elsevier, vol. 162(C).
    • Handle: RePEc:eee:csdana:v:162:y:2021:i:c:s0167947321000979
    DOI: 10.1016/j.csda.2021.107263
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947321000979
    Download Restriction: Full text for ScienceDirect subscribers only.
    File URL: https://libkey.io/10.1016/j.csda.2021.107263?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Caimo, Alberto & Gollini, Isabella, 2020. "A multilayer exponential random graph modelling approach for weighted networks," Computational Statistics & Data Analysis, Elsevier, vol. 142(C).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Masud Alam, 2021. "Heterogeneous Responses to the U.S. Narrative Tax Changes: Evidence from the U.S. States," Papers 2107.13678, arXiv.org.
    2. Masud Alam, 2021. "Time Varying Risk in U.S. Housing Sector and Real Estate Investment Trusts Equity Return," Papers 2107.10455, arXiv.org.
    3. Paramahansa Pramanik & Alan M. Polansky, 2024. "Optimization of a dynamic profit function using Euclidean path integral," SN Business & Economics, Springer, vol. 4(1), pages 1-20, January.
    4. Lambert Dong, 2024. "Strategic complementarities as stochastic control under sticky price," Papers 2403.19847, arXiv.org.
    5. Paramahansa Pramanik & Alan M. Polansky, 2023. "Scoring a Goal Optimally in a Soccer Game Under Liouville-Like Quantum Gravity Action," SN Operations Research Forum, Springer, vol. 4(3), pages 1-39, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Park, Jaewoo & Jin, Ick Hoon & Schweinberger, Michael, 2022. "Bayesian model selection for high-dimensional Ising models, with applications to educational data," Computational Statistics & Data Analysis, Elsevier, vol. 165(C).
    2. Zhou Nie, 2023. "Using Exponential Random Graph Models for Social Networks to Understand Meta-Communication in Digital Media," Social Sciences, MDPI, vol. 12(4), pages 1-11, April.
    3. Yingjie Lu & Xinwei Wang & Lin Su & Han Zhao, 2023. "Multiplex Social Network Analysis to Understand the Social Engagement of Patients in Online Health Communities," Mathematics, MDPI, vol. 11(21), pages 1-20, October.
    4. Kei, Yik Lun & Chen, Yanzhen & Madrid Padilla, Oscar Hernan, 2023. "A partially separable model for dynamic valued networks," Computational Statistics & Data Analysis, Elsevier, vol. 187(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:162:y:2021:i:c:s0167947321000979. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.