Publication:2896064
From MaRDI portal
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
social networks; network analysis; network models; graph generators; network evolution; graph mining; Kronecker graphs
05C82: Small world graphs, complex networks (graph-theoretic aspects)
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Unnamed Item, The super edge connectivity of Kronecker product graphs, The 3-cycle weighted spectral distribution in evolving community-based networks, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, The thickness of the Kronecker product of graphs, What Graphs are 2-Dot Product Graphs?, Community Structures in Information Networks for a Discrete Agent Population, Исследование статистик графов ближайших соседей, Unnamed Item, Finding Cliques in Social Networks: A New Distribution-Free Model, Модель эволюции распределений степеней вершин графов социальных сетей, Evolutionary Network Analysis, Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities, Unnamed Item, 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, A Heuristic for Direct Product Graph Decomposition, KronFit, Estimation of Laplacian spectra of direct and strong product graphs, Super connectivity of Kronecker product of complete bipartite graphs and complete graphs, What graphs are 2-dot product graphs?, Bayesian object matching, On computing the diameter of real-world undirected graphs, Fitting truncated geometric distributions in large scale real world networks, On the super connectivity of Kronecker products of graphs, Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection, Probabilistic SimRank computation over uncertain graphs, Design of highly synchronizable and robust networks, On matchings in stochastic Kronecker graphs, The spectra of multiplicative attribute graphs, Modeling acquaintance networks based on balance theory, On the controllability of Corona product network, Symmetric graph properties have independent edges, Forming \(k\) coalitions and facilitating relationships in social networks, Fuzzy random walkers with second order bounds: an asymmetric analysis, Generating realistic labelled, weighted random graphs, Average distance is submultiplicative and subadditive with respect to the strong product of graphs, On the diameter of Kronecker graphs, Using shortcut edges to maximize the number of triangles in graphs, Generating graphs by creating associative and random links between existing nodes, A new method for generalizing Burr and related distributions, The Kronecker-clique model for higher-order clustering coefficients, Nonparametric identification of Kronecker networks, On zero-error codes produced by greedy algorithms, The devil is in the details: spectrum and eigenvalue distribution of the discrete Preisach memory model, Autoregressive identification of Kronecker graphical models, Structural properties of the scale-free Barabasi-Albert graph, Controllability of Kronecker product networks, Scalable and exact sampling method for probabilistic generative graph models, Large-scale clique cover of real-world networks, Matching preclusion for direct product of regular graphs, Splines and wavelets on circulant graphs, Structural and spectral properties of corona graphs, Asymptotic behavior and distributional limits of preferential attachment graphs, Motifs, coherent configurations and second order network generation, Discussion about properties of first nearest neighbor graphs, Decompositions of Triangle-Dense Graphs, Regular synchrony lattices for product coupled cell networks, Topology discovery of sparse random graphs with few participants, Evolution of the Media Web, The Domination Number of On-line Social Networks and Random Geometric Graphs, A mathematical analysis of the R-MAT random graph generator, Corona graphs as a model of small-world networks, Estimating latent feature-feature interactions in large feature-rich graphs, Symmetric Graph Properties Have Independent Edges
Uses Software
