Cargando…
Efficient orbit-aware triad and quad census in directed and undirected graphs
The prevalence of select substructures is an indicator of network effects in applications such as social network analysis and systems biology. Moreover, subgraph statistics are pervasive in stochastic network models, and they need to be assessed repeatedly in MCMC sampling and estimation algorithms....
Autores principales: | Ortmann, Mark, Brandes, Ulrik |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6214268/ https://www.ncbi.nlm.nih.gov/pubmed/30443568 http://dx.doi.org/10.1007/s41109-017-0027-2 |
Ejemplares similares
-
Efficient solution for finding Hamilton cycles in undirected graphs
por: Alhalabi, Wadee, et al.
Publicado: (2016) -
Infinite Ergodic Walks in Finite Connected Undirected Graphs †
por: Volchenkov, Dimitri
Publicado: (2021) -
A simple interpretation of undirected edges in essential graphs is wrong
por: Kummerfeld, Erich
Publicado: (2021) -
Estimating the impact of structural directionality: How reliable are undirected connectomes?
por: Kale, Penelope, et al.
Publicado: (2018) -
On the Solvability of the Discrete s(x,·)-Laplacian Problems on Simple, Connected, Undirected, Weighted, and Finite Graphs
por: Pietrusiak, Filip, et al.
Publicado: (2022)