KronFit

swMATH20428MaRDI QIDQ32246FDOQ32246

Author name not available (Why is that?)

Official website: https://arxiv.org/pdf/0812.4905.pdf

Described by source

• Kronecker graphs: an approach to modeling networks

Cited In (61)

• kron
• Coin-flipping, Ball-dropping, and Grass-hopping for generating random graphs from matrices of edge probabilities
• What Graphs are 2-Dot Product Graphs?
• Title not available (Why is that?)
• The Kronecker-clique model for higher-order clustering coefficients
• Structural and spectral properties of corona graphs
• Fitting truncated geometric distributions in large scale real world networks
• Estimation of Laplacian spectra of direct and strong product 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
• Corona graphs as a model of small-world networks
• On the super connectivity of Kronecker products of graphs
• 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
• Steering social activity: a stochastic optimal control point of view
• On matchings in stochastic Kronecker graphs
• On the diameter of Kronecker graphs
• Symmetric graph properties have independent edges
• Properties of stochastic Kronecker graphs
• 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
• Finding cliques in social networks: a new distribution-free model
• What graphs are 2-dot product graphs?
• Using shortcut edges to maximize the number of triangles in graphs
• Estimating latent feature-feature interactions in large feature-rich graphs
• Fuzzy random walkers with second order bounds: an asymmetric analysis
• Estimation of a low-rank topic-based model for information cascades
• \textsc{NeVAE}: a deep generative model for molecular graphs
• ANF
• Graphs
• MetExplore
• Design of highly synchronizable and robust networks
• UbiCrawler
• HysterSoft
• cliques
• TKPSVD
• Model for the evolution of the degree distributions of the vertices of social network graphs
• Asymptotic behavior and distributional limits of preferential attachment graphs
• NetworKit
• OddBall
• Community structures in information networks for a discrete agent population
• Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection
• Исследование статистик графов ближайших соседей
• Scalable interpretable multi-response regression via SEED
• Generating graphs by creating associative and random links between existing nodes
• A new method for generalizing Burr and related distributions
• Bayesian object matching
• Autoregressive identification of Kronecker graphical models
• The thickness of the Kronecker product of graphs
• Discussion about properties of first nearest neighbor graphs
• The devil is in the details: spectrum and eigenvalue distribution of the discrete Preisach memory model
• On computing the diameter of real-world undirected graphs
• Nonparametric identification of Kronecker networks
• Probabilistic SimRank computation over uncertain graphs

This page was built for software: KronFit