From social networks such as Facebook, the World Wide Web and the Internet, to the
complex interactions between proteins in the cells of our bodies, we constantly face the …

Stochastic Kronecker graphs supply a parsimonious model for large sparse real-world
graphs. They can specify the distribution of a large random graph using only three or four …

Random graph models are playing an increasingly important role in various fields ranging
from social networks, telecommunication systems, to physiologic and biological networks …

The stochastic Kronecker graph model introduced by Leskovec et al. is a random graph with
vertex set $\mathbb Z_2^ n $, where two vertices $ u $ and $ v $ are connected with …

Stochastic Kronecker graphs are a model for complex networks where each edge is present
independently according the Kronecker (tensor) product of a fixed matrix k-by-k matrix P with …

A multiplicative attribute graph is a random graph in which vertices are represented by
random words of length t in a finite alphabet Γ, and the probability of adjacency is a …

In this paper, we introduce one model named random connection model RG (n, α, β) defined
as follows: the vertex set is Zn 2, and two vertices u, v∈ Zn 2 are adjacent with probability …

We prove that aas as soon as a Kronecker graph becomes connected it has a finite
diameter.

On matchings in stochastic Kronecker graphs Page 1 On matchings in stochastic Kronecker
graphs Justyna Banaszak ∗ Faculty of Mathematics and Computer Science Adam Mickiewicz …

In the thesis we study the asymptotic structure of Kronecker graphs. Kronecker graphs were
introduced in computer science as possible models of small-world networks and have been …