13 citations · 22 across the 6 of their papers we have counts for
7 papers
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…
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…
Short-term prediction of Electricity Outages Caused by Convective Storms
Roope Tervo, Joonas Karjalainen, Alexander Jung
Prediction of power outages caused by convective storms which are highly localised in space and time is of crucial importance to power grid operators. We propose a new machine lear…
Predicting Electricity Outages Caused by Convective Storms
Roope Tervo, Joonas Karjalainen, Alexander Jung
We consider the problem of predicting power outages in an electrical power grid due to hazards produced by convective storms. These storms produce extreme weather phenomena such as…
Parameter estimators of random intersection graphs with thinned communities
Joona Karjalainen, Johan S. H. van Leeuwaarden, Lasse Leskelä
This paper studies a statistical network model generated by a large number of randomly sized overlapping communities, where any pair of nodes sharing a community is linked with pro…
Moment-based parameter estimation in binomial random intersection graph models
Joona Karjalainen, Lasse Leskelä
Binomial random intersection graphs can be used as parsimonious statistical models of large and sparse networks, with one parameter for the average degree and another for transitiv…