![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Lasse Leskelä
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Elmer Bergman, Lasse Leskelä
:
Connectivity of random hypergraphs with a given hyperedge size distribution. Discret. Appl. Math. 357: 1-13 (2024) - [j13]Mindaugas Bloznelis, Joona Karjalainen, Lasse Leskelä:
Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs. J. Appl. Probab. 61(2): 401-419 (2024) - [j12]Konstantin Avrachenkov
, Maximilien Dreveton
, Lasse Leskelä
:
Recovering Static and Time-Varying Communities Using Persistent Edges. IEEE Trans. Netw. Sci. Eng. 11(2): 2087-2099 (2024) - [i15]B. R. Vinay Kumar, Lasse Leskelä:
Spatial Queues with Nearest Neighbour Shifts. CoRR abs/2402.13192 (2024) - [i14]Lasse Leskelä:
Information divergences and likelihood ratios of Poisson processes and point patterns. CoRR abs/2404.00294 (2024) - 2023
- [j11]Hannu Reittu
, Lasse Leskelä, Tomi Räty:
A network community detection method with integration of data from multiple layers and node attributes. Netw. Sci. 11(3): 374-396 (2023) - [j10]Mindaugas Bloznelis, Lasse Leskelä:
Clustering and percolation on superpositions of Bernoulli random graphs. Random Struct. Algorithms 63(2): 283-342 (2023) - [j9]Tom Britton, Lasse Leskelä
:
Optimal Intervention Strategies for Minimizing Total Incidence During an Epidemic. SIAM J. Appl. Math. 83(2): 354-373 (2023) - [c14]Kalle Alaluusua, Konstantin Avrachenkov, B. R. Vinay Kumar, Lasse Leskelä:
Multilayer Hypergraph Clustering Using the Aggregate Similarity Matrix. WAW 2023: 83-98 - [i13]Kalle Alaluusua, Konstantin Avrachenkov, B. R. Vinay Kumar, Lasse Leskelä:
Multilayer hypergraph clustering using the aggregate similarity matrix. CoRR abs/2301.11657 (2023) - 2022
- [j8]Jeta Molla
, Alejandro Ponce-de-León-Chávez
, Takayuki Hiraoka
, Tapio Ala-Nissila
, Mikko Kivelä
, Lasse Leskelä
:
Adaptive and optimized COVID-19 vaccination strategies across geographical regions and age groups. PLoS Comput. Biol. 18(4) (2022) - [j7]Lasse Leskelä:
Ross's second conjecture and supermodular stochastic ordering. Queueing Syst. Theory Appl. 100(3-4): 213-215 (2022) - [c13]Kalle Alaluusua, Lasse Leskelä:
Consistent Bayesian community recovery in multilayer networks. ISIT 2022: 2726-2731 - 2021
- [c12]Konstantin Avrachenkov
, Maximilien Dreveton
, Lasse Leskelä:
Recovering Communities in Temporal Networks Using Persistent Edges. CSoNet 2021: 243-254 - [i12]Mindaugas Bloznelis, Joona Karjalainen, Lasse Leskelä:
Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs. CoRR abs/2107.02683 (2021) - 2020
- [c11]Mindaugas Bloznelis, Joona Karjalainen, Lasse Leskelä:
Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions. WAW 2020: 68-81 - [i11]Mindaugas Bloznelis, Joona Karjalainen, Lasse Leskelä:
Assortativity and bidegree distributions on Bernoulli random graph superpositions. CoRR abs/2002.11809 (2020) - [i10]Hannu Reittu, Ville Kotovirta, Lasse Leskelä, Hannu Rummukainen, Tomi Räty:
Towards analyzing large graphs with quantum annealing and quantum gate computers. CoRR abs/2006.16702 (2020) - [i9]Konstantin Avrachenkov, Maximilien Dreveton, Lasse Leskelä:
Estimation of Static Community Memberships from Temporal Network Data. CoRR abs/2008.04790 (2020)
2010 – 2019
- 2019
- [j6]Lasse Leskelä, Hoa Ngo:
First passage percolation on sparse random graphs with boundary weights. J. Appl. Probab. 56(2): 458-471 (2019) - [c10]Hannu Reittu, Ville Kotovirta, Lasse Leskelä, Hannu Rummukainen
, Tomi Räty:
Towards analyzing large graphs with quantum annealing. IEEE BigData 2019: 2457-2464 - [i8]Tommi Gröhn, Joona Karjalainen, Lasse Leskelä:
Clique and cycle frequencies in a sparse random graph model with overlapping communities. CoRR abs/1911.12827 (2019) - 2018
- [c9]Hannu Reittu
, Lasse Leskelä, Tomi Räty, Marco Fiorucci
:
Analysis of large sparse graphs using regular decomposition of graph distance matrices. IEEE BigData 2018: 3784-3792 - [c8]Joona Karjalainen, Johan S. H. van Leeuwaarden, Lasse Leskelä:
Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities. WAW 2018: 44-58 - [i7]Joona Karjalainen, Johan S. H. van Leeuwaarden, Lasse Leskelä:
Parameter estimators of random intersection graphs with thinned communities. CoRR abs/1802.01171 (2018) - [i6]Hannu Reittu, Lasse Leskelä, Tomi Räty, Marco Fiorucci:
Analysis of large sparse graphs using regular decomposition of graph distance matrices. CoRR abs/1811.10470 (2018) - 2017
- [c7]Joona Karjalainen, Lasse Leskelä:
Moment-Based Parameter Estimation in Binomial Random Intersection Graph Models. WAW 2017: 1-15 - [i5]Joona Karjalainen, Lasse Leskelä:
Moment-based parameter estimation in binomial random intersection graph models. CoRR abs/1704.04278 (2017) - 2016
- [c6]Mindaugas Bloznelis, Lasse Leskelä:
Diclique Clustering in a Directed Random Graph. WAW 2016: 22-33 - [i4]Mindaugas Bloznelis, Lasse Leskelä:
Diclique clustering in a directed random graph. CoRR abs/1607.02278 (2016) - 2015
- [j5]Alexander Engström, Lasse Leskelä, Harri Varpanen:
Geometric juggling with q-analogues. Discret. Math. 338(7): 1067-1074 (2015) - [j4]Pekka Aalto, Lasse Leskelä:
Information Spreading in a Large Population of Active Transmitters and Passive Receivers. SIAM J. Appl. Math. 75(5): 1965-1982 (2015) - [c5]Lasse Leskelä, Hoa Ngo:
The Impact of Degree Variability on Connectivity Properties of Large Networks. WAW 2015: 66-77 - [i3]Lasse Leskelä, Hoa Ngo:
The impact of degree variability on connectivity properties of large networks. CoRR abs/1508.03379 (2015) - 2014
- [c4]Lasse Leskelä:
Flow coupling and stochastic ordering of throughputs in linear networks. VALUETOOLS 2014 - [i2]Pekka Aalto, Lasse Leskelä:
Information spreading in a large population of active transmitters and passive receivers. CoRR abs/1412.7563 (2014) - 2012
- [j3]Lasse Leskelä, Falk Unger:
Stability of a spatial polling system with greedy myopic service. Ann. Oper. Res. 198(1): 165-183 (2012) - [j2]Lasse Leskelä, Harri Varpanen:
Juggler's Exclusion Process. J. Appl. Probab. 49(1): 266-279 (2012)
2000 – 2009
- 2009
- [c3]Lasse Leskelä:
Computational methods for stochastic relations and Markovian couplings. VALUETOOLS 2009: 19 - [c2]Lasse Leskelä, Philippe Robert, Florian Simatos:
Stability properties of linear file-sharing networks: invited presentation, extended abstract. VALUETOOLS 2009: 53 - [i1]Lasse Leskelä, Philippe Robert, Florian Simatos:
Stability Properties of Linear File-Sharing Networks. CoRR abs/0907.0375 (2009) - 2008
- [j1]Sem C. Borst, Matthieu Jonckheere
, Lasse Leskelä:
Stability of Parallel Queueing Systems with Coupled Service Rates. Discret. Event Dyn. Syst. 18(4): 447-472 (2008) - 2007
- [c1]Lasse Leskelä, Jacques Resing:
A Tandem Queueing Network with Feedback Admission Control. NET-COOP 2007: 129-137
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint