A motif building process for simulating random networks
From MaRDI portal
Publication:2242037
DOI10.1016/j.csda.2021.107263OpenAlexW3157613477MaRDI QIDQ2242037
Paramahansa Pramanik, Alan M. Polansky
Publication date: 9 November 2021
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2021.107263
Related Items (2)
Scoring a goal optimally in a soccer game under Liouville-like quantum gravity action ⋮ Optimal lock-down intensity: a stochastic pandemic control approach of path integral
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Consistency under sampling of exponential random graph models
- The method of moments and degree distributions for network models
- Subsampling bootstrap of count features of networks
- Modeling social networks from sampled data
- Bayesian anomaly detection methods for social networks
- Strategies for online inference of model-based clustering in large and growing networks
- Statistical analysis of network data. Methods and models
- Bootstrap methods: another look at the jackknife
- Exponential random graph models for networks resilient to targeted attacks
- A multilayer exponential random graph modelling approach for weighted networks
- The random subgraph model for the analysis of an ecclesiastical network in Merovingian Gaul
- Reconstructing evolving signalling networks by hidden Markov nested effects models
- A nonparametric view of network models and Newman–Girvan and other modularities
- Emergence of Scaling in Random Networks
- An Efficient Sampling Algorithm for Network Motif Detection
- Statistical Analysis of Network Data with R
- A likelihood approach to analysis of network data
- Using the bootstrap for statistical inference on random graphs
- Random Graphs
This page was built for publication: A motif building process for simulating random networks
