29 citations · 82 across the 23 of their papers we have counts for
12 papers · 1 filter
Spatial Queues with Nearest Neighbour Shifts
B. R. Vinay Kumar, Lasse Leskelä
This work studies queues in a Euclidean space. Consider servers that are distributed uniformly in . Customers arrive at the servers according to independent stationary…
Ross's second conjecture and supermodular stochastic ordering
Lasse Leskelä
This short note discusses open problems and partial solutions related to Sheldon M Ross's second conjecture about the classical single server queue subject to a randomly time-varyi…
Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs
Mindaugas Bloznelis, Joona Karjalainen, Lasse Leskelä
The clustering property of complex networks indicates the abundance of small dense subgraphs in otherwise sparse networks. For a community-affiliation network defined by a superpos…
Assortativity and bidegree distributions on Bernoulli random graph superpositions
Mindaugas Bloznelis, Joona Karjalainen, Lasse Leskelä
A probabilistic generative network model with nodes and overlapping layers is obtained as a superposition of mutually independent Bernoulli random graphs of varying siz…
Clustering and percolation on superpositions of Bernoulli random graphs
Mindaugas Bloznelis, Lasse Leskelä
A simple but powerful network model with nodes and partly overlapping layers is generated as an overlay of independent random graphs with variable sizes and…
Clique and cycle frequencies in a sparse random graph model with overlapping communities
Tommi Gröhn, Joona Karjalainen, Lasse Leskelä
A statistical network model with overlapping communities can be generated as a superposition of mutually independent random graphs of varying size. The model is parameterized by th…