An in-depth analysis of stochastic Kronecker graphs
نویسندگان
چکیده
منابع مشابه
A An In-Depth Analysis of Stochastic Kronecker Graphs
Graph analysis is playing an increasingly important role in science and industry. Due to numerous limitations in sharing real-world graphs, models for generating massive graphs are critical for developing better algorithms. In this paper, we analyze the stochastic Kronecker graph model (SKG), which is the foundation of the Graph500 supercomputer benchmark due to its favorable properties and eas...
متن کاملStochastic Kronecker Graphs
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This model simultaneously captures several well-known properties of real-world networks; in particular, it gives rise to a heavy-tailed degree distribution, has a low diameter, and obeys the densification power law. Most p...
متن کاملOn Matchings in Stochastic Kronecker Graphs
The stochastic Kronecker graph is a random structure whose vertex set is a hypercube and the probability of an edge depends on the structure of its ends. We prove that when a.a.s. the stochastic Kronecker graph becomes connected it a.a.s. contains a perfect matching. Let n ∈ N, N = 2, and let 0 6 α, β, γ 6 1, where γ 6 α be some constants. Denote by P a symmetric matrix P = ( 1 0 1 α β 0 β γ ) ...
متن کاملHuman Activities as Stochastic Kronecker Graphs
A human activity can be viewed as a space-time repetition of activity primitives. Both instances of the primitives, and their repetition are stochastic. They can be modeled by a generative model-graph, where nodes correspond to the primitives, and the graph’s adjacency matrix encodes their affinities for probabilistic grouping into observable video features. When a video of the activity is repr...
متن کاملVertex Censored Stochastic Kronecker Product Graphs
Stochastic Kronecker Product Graphs are an interesting and useful class of Generative Network Models. They can be fitted using a fast Maximum Likelihood Estimator and reproduce many important statistical properties commonly found in large real-world networks. However, they suffer from an unfortunate drawback: the need to pad the Stochastic Kronecker Product Graph with isolated vertices. To addr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2013
ISSN: 0004-5411,1557-735X
DOI: 10.1145/2450142.2450149