Cited in
(62)- Fitting truncated geometric distributions in large scale real world networks
- The Kronecker-clique model for higher-order clustering coefficients
- Estimation of Laplacian spectra of direct and strong product graphs
- Structural and spectral properties of corona graphs
- The super edge connectivity of Kronecker product graphs
- Bayesian model selection with graph structured sparsity
- Generating realistic labelled, weighted random graphs
- Average distance is submultiplicative and subadditive with respect to the strong product of graphs
- Finding cliques in social networks: a new distribution-free model
- Super connectivity of Kronecker product of complete bipartite graphs and complete graphs
- On the super connectivity of Kronecker products of graphs
- Corona graphs as a model of small-world networks
- Large-scale clique cover of real-world networks
- Scalable and exact sampling method for probabilistic generative graph models
- On zero-error codes produced by greedy algorithms
- On matchings in stochastic Kronecker graphs
- On the diameter of Kronecker graphs
- Symmetric graph properties have independent edges
- Steering social activity: a stochastic optimal control point of view
- Properties of stochastic Kronecker graphs
- Coin-flipping, Ball-dropping, and Grass-hopping for generating random graphs from matrices of edge probabilities
- Forming \(k\) coalitions and facilitating relationships in social networks
- Splines and wavelets on circulant graphs
- Symmetric graph properties have independent edges
- Matching preclusion for direct product of regular graphs
- SNAP
- ANF
- Graphs
- MetExplore
- UbiCrawler
- HysterSoft
- cliques
- TKPSVD
- NetworKit
- OddBall
- What graphs are 2-dot product graphs?
- Finding cliques in social networks: a new distribution-free model
- Using shortcut edges to maximize the number of triangles in graphs
- Fuzzy random walkers with second order bounds: an asymmetric analysis
- Estimating latent feature-feature interactions in large feature-rich graphs
- Estimation of a low-rank topic-based model for information cascades
- \textsc{NeVAE}: a deep generative model for molecular graphs
- Design of highly synchronizable and robust networks
- What Graphs are 2-Dot Product Graphs?
- Model for the evolution of the degree distributions of the vertices of social network graphs
- Asymptotic behavior and distributional limits of preferential attachment graphs
- kron
- Community structures in information networks for a discrete agent population
- scientific article; zbMATH DE number 7626710 (Why is no real title available?)
- Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection
- Generating graphs by creating associative and random links between existing nodes
- Исследование статистик графов ближайших соседей
- Scalable interpretable multi-response regression via SEED
- A new method for generalizing Burr and related distributions
- Bayesian object matching
- Autoregressive identification of Kronecker graphical models
- Discussion about properties of first nearest neighbor graphs
- The thickness of the Kronecker product of graphs
- On computing the diameter of real-world undirected graphs
- The devil is in the details: spectrum and eigenvalue distribution of the discrete Preisach memory model
- Nonparametric identification of Kronecker networks
- Probabilistic SimRank computation over uncertain graphs
This page was built for software: KronFit
