scientific article
From MaRDI portal
Publication:2896064
zbMath1242.05256arXiv0812.4905MaRDI QIDQ2896064
Jure Leskovec, Deepayan Chakrabarti, Christos Faloutsos, Zoubin Ghahramani, Jon M. Kleinberg
Publication date: 13 July 2012
Full work available at URL: https://arxiv.org/abs/0812.4905
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
social networksnetwork analysisnetwork modelsgraph generatorsnetwork evolutiongraph miningKronecker graphs
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (74)
Estimation of Laplacian spectra of direct and strong product graphs ⋮ Super connectivity of Kronecker product of complete bipartite graphs and complete graphs ⋮ Community Structures in Information Networks for a Discrete Agent Population ⋮ Исследование статистик графов ближайших соседей ⋮ Symmetric Graph Properties Have Independent Edges ⋮ Symmetric graph properties have independent edges ⋮ What graphs are 2-dot product graphs? ⋮ Forming \(k\) coalitions and facilitating relationships in social networks ⋮ The super edge connectivity of Kronecker product graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fuzzy random walkers with second order bounds: an asymmetric analysis ⋮ Bayesian object matching ⋮ Evolution of the Media Web ⋮ On computing the diameter of real-world undirected graphs ⋮ Motifs, coherent configurations and second order network generation ⋮ The Domination Number of On-line Social Networks and Random Geometric Graphs ⋮ Finite-time \(H_\infty\) synchronization of Markov jump complex dynamical networks with additive time-varying delays: an event-triggered control strategy ⋮ On k-restricted connectivity of direct product of graphs ⋮ Fitting truncated geometric distributions in large scale real world networks ⋮ Design of highly synchronizable and robust networks ⋮ A Heuristic for Direct Product Graph Decomposition ⋮ Finding Cliques in Social Networks: A New Distribution-Free Model ⋮ Unnamed Item ⋮ Robust Factorizations and Colorings of Tensor Graphs ⋮ SELF-ORGANIZED CORONA GRAPHS: A DETERMINISTIC COMPLEX NETWORK MODEL WITH HIERARCHICAL STRUCTURE ⋮ STRUCTURAL PROPERTIES OF CORE–PERIPHERY COMMUNITIES ⋮ Another estimation of Laplacian spectrum of the Kronecker product of graphs ⋮ Cartesian product of synchronization transitions and hysteresis ⋮ On the super connectivity of Kronecker products of graphs ⋮ The devil is in the details: spectrum and eigenvalue distribution of the discrete Preisach memory model ⋮ Autoregressive identification of Kronecker graphical models ⋮ Discussion about properties of first nearest neighbor graphs ⋮ Asymptotic behavior and distributional limits of preferential attachment graphs ⋮ Generating realistic labelled, weighted random graphs ⋮ Corona graphs as a model of small-world networks ⋮ Average distance is submultiplicative and subadditive with respect to the strong product of graphs ⋮ The 3-cycle weighted spectral distribution in evolving community-based networks ⋮ Модель эволюции распределений степеней вершин графов социальных сетей ⋮ 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 ⋮ Unnamed Item ⋮ Probabilistic SimRank computation over uncertain graphs ⋮ Structural properties of the scale-free Barabasi-Albert graph ⋮ Evolutionary Network Analysis ⋮ Unnamed Item ⋮ On the diameter of Kronecker graphs ⋮ Using shortcut edges to maximize the number of triangles in graphs ⋮ Controllability of Kronecker product networks ⋮ On matchings in stochastic Kronecker graphs ⋮ Decompositions of Triangle-Dense Graphs ⋮ Scalable and exact sampling method for probabilistic generative graph models ⋮ Large-scale clique cover of real-world networks ⋮ The spectra of multiplicative attribute graphs ⋮ Modeling acquaintance networks based on balance theory ⋮ Matching preclusion for direct product of regular graphs ⋮ Estimating latent feature-feature interactions in large feature-rich graphs ⋮ Regular synchrony lattices for product coupled cell networks ⋮ KronFit ⋮ A mathematical analysis of the R-MAT random graph generator ⋮ Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities ⋮ The thickness of the Kronecker product of graphs ⋮ A new method for generalizing Burr and related distributions ⋮ On the controllability of Corona product network ⋮ The Kronecker-clique model for higher-order clustering coefficients ⋮ Splines and wavelets on circulant graphs ⋮ Topology discovery of sparse random graphs with few participants ⋮ Nonparametric identification of Kronecker networks ⋮ On zero-error codes produced by greedy algorithms ⋮ Unnamed Item ⋮ What Graphs are 2-Dot Product Graphs? ⋮ Structural and spectral properties of corona graphs
Uses Software
This page was built for publication: