Publikationer inom sannolikhetsteori och kombinatorik
Nedan visas våra senaste 50 forskningspublikationer. För en komplett och filtrerbar lista se universitetets publikationsdatabas DiVA.
Channel capacity and performance analysis of a buffered cellular network
2024
Artikel i tidskrift
The root cluster after percolation on preferential attachment trees
Ingår i Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB' 2023, s. 343-348, 2023
Konferensbidrag
Detecting Slag Formations with Deep Convolutional Neural Networks
Ingår i Pattern Recognition, s. 559-573, 2021
Konferensbidrag
The Parameterised Complexity of Computing the Maximum Modularity of a Graph
Ingår i 13th International Symposium on Parameterized and Exact Computation (IPEC 2018), 2019
Konferensbidrag
- DOI för The Parameterised Complexity of Computing the Maximum Modularity of a Graph
- Ladda ner fulltext (pdf) av The Parameterised Complexity of Computing the Maximum Modularity of a Graph
The Parameterised Complexity of Computing the Maximum Modularity of a Graph
Ingår i Algorithmica, s. 2174-2199, 2019
Artikel i tidskrift
Manuskript (preprint)
Logical limit laws for Mallows random permutations
Manuskript (preprint)
Modularity and partially observed graphs
Manuskript (preprint)
Modularity of nearly complete graphs and bipartite graphs
Manuskript (preprint)
The hitting time of clique factors
Ingår i Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB 2023, s. 552-560, 2023
Konferensbidrag
- DOI för The hitting time of clique factors
- Ladda ner fulltext (pdf) av The hitting time of clique factors
The Generalized Alice HH Vs Bob HT Problem
Ingår i Journal of theoretical probability, 2025
Artikel i tidskrift
Moments of Balanced Pólya Urns
Ingår i Journal of theoretical probability, 2025
Artikel i tidskrift
Fringe Trees for Random Trees With Given Vertex Degrees
Ingår i Random structures & algorithms (Print), 2025
Artikel i tidskrift
- DOI för Fringe Trees for Random Trees With Given Vertex Degrees
- Ladda ner fulltext (pdf) av Fringe Trees for Random Trees With Given Vertex Degrees
Depth-First Search Performance in a Random Digraph with Geometric Outdegree Distribution
Ingår i MATEMATICA, s. 262-292, 2024
Artikel i tidskrift
- DOI för Depth-First Search Performance in a Random Digraph with Geometric Outdegree Distribution
- Ladda ner fulltext (pdf) av Depth-First Search Performance in a Random Digraph with Geometric Outdegree Distribution
The number of dominating sets in d-ary trees
Ingår i Afrika Matematika, 2025
Artikel i tidskrift
- DOI för The number of dominating sets in d-ary trees
- Ladda ner fulltext (pdf) av The number of dominating sets in d-ary trees
Ingår i Physica D, 2025
Artikel i tidskrift
- DOI för Influence of extreme events modeled by Lévy flight on Atlantic meridional overturning circulation stability
- Ladda ner fulltext (pdf) av Influence of extreme events modeled by Lévy flight on Atlantic meridional overturning circulation stability
The critical beta-splitting random tree IV: Mellin analysis of leaf height
Ingår i Electronic Journal of Probability, 2025
Artikel i tidskrift
- DOI för The critical beta-splitting random tree IV: Mellin analysis of leaf height
- Ladda ner fulltext (pdf) av The critical beta-splitting random tree IV: Mellin analysis of leaf height
Bit-array-based alternatives to HyperLogLog
Ingår i Theoretical Computer Science, 2025
Artikel i tidskrift
- DOI för Bit-array-based alternatives to HyperLogLog
- Ladda ner fulltext (pdf) av Bit-array-based alternatives to HyperLogLog
Approximating temporal modularity on graphs of small underlying treewidth
2025
Konferensbidrag
Interpolating with generalized Assouad dimensions
Ingår i Journal of Geometric Analysis, 2025
Artikel i tidskrift
- DOI för Interpolating with generalized Assouad dimensions
- Ladda ner fulltext (pdf) av Interpolating with generalized Assouad dimensions
Consistent random vertex-orderings of graphs
Ingår i Journal of the European Mathematical Society (Print), s. 2623-2652, 2025
Artikel i tidskrift
- DOI för Consistent random vertex-orderings of graphs
- Ladda ner fulltext (pdf) av Consistent random vertex-orderings of graphs
On the accurate computation of expected modularity in probabilistic networks
Ingår i Scientific Reports, 2025
Artikel i tidskrift
- DOI för On the accurate computation of expected modularity in probabilistic networks
- Ladda ner fulltext (pdf) av On the accurate computation of expected modularity in probabilistic networks
Stability Analysis and Simulation of a Cellular Network with Retransmissions Policy
Ingår i Computer Performance Engineering and Stochastic Modelling, s. 369-382, 2023
Konferensbidrag
Trees maximizing the number of almost-perfect matchings
Ingår i Applicable Analysis and Discrete Mathematics, s. 104-129, 2025
Artikel i tidskrift
Investment decisions with incomplete information
2025
Licentiatavhandling, sammanläggning
Hiring and firing: a signaling game
Ingår i Journal of Applied Probability, s. 697-711, 2025
Artikel i tidskrift
An irreversible investment problem with a learning-by-doing-feature
Manuskript (preprint)
Learning from the past in an irreversible investment problem
Manuskript (preprint)
Central limit theorem for components in meandric systems through high moments
Ingår i Combinatorics, probability & computing, s. 597-610, 2024
Artikel i tidskrift
- DOI för Central limit theorem for components in meandric systems through high moments
- Ladda ner fulltext (pdf) av Central limit theorem for components in meandric systems through high moments
MINKOWSKI WEAK EMBEDDING THEOREM
Ingår i Houston Journal of Mathematics, s. 259-273, 2024
Artikel i tidskrift
The Ekström-Persson conjecture regarding random covering sets
Ingår i Journal of the London Mathematical Society, 2025
Artikel i tidskrift
- DOI för The Ekström-Persson conjecture regarding random covering sets
- Ladda ner fulltext (pdf) av The Ekström-Persson conjecture regarding random covering sets
Ingår i SciPost Physics, 2025
Artikel i tidskrift
Probabilistic models of codon sequence evolution during speciation
Manuskript (preprint)
Manuskript (preprint)
On Lamperti transformation and AR(1) type characterisations of discrete random fields
Ingår i Theory of Probability and Mathematical Statistics, s. 181-197, 2024
Artikel i tidskrift
On a Question of Erdős and Gimbel on the Cochromatic Number
Ingår i The Electronic Journal of Combinatorics, 2024
Artikel i tidskrift
- DOI för On a Question of Erdős and Gimbel on the Cochromatic Number
- Ladda ner fulltext (pdf) av On a Question of Erdős and Gimbel on the Cochromatic Number
Split Trees - A Unifying Model for Many Important Random Trees of Logarithmic Height: A Brief Survey
Ingår i Discrete Geometry and Mathematical Morphology, 0302-9743, s. 20-57, 2021
Konferensbidrag
The distribution of the maximum protection number in simply generated trees
Ingår i Combinatorics, probability & computing, s. 518-553, 2024
Artikel i tidskrift
- DOI för The distribution of the maximum protection number in simply generated trees
- Ladda ner fulltext (pdf) av The distribution of the maximum protection number in simply generated trees
On the Number of Distinct Fringe Subtrees in Binary Search Trees
Ingår i 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024), 2024
Konferensbidrag
- DOI för On the Number of Distinct Fringe Subtrees in Binary Search Trees
- Ladda ner fulltext (pdf) av On the Number of Distinct Fringe Subtrees in Binary Search Trees
Statistics of Parking Functions and Labeled Forests
Ingår i 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024), 2024
Konferensbidrag
- DOI för Statistics of Parking Functions and Labeled Forests
- Ladda ner fulltext (pdf) av Statistics of Parking Functions and Labeled Forests
Binomial Sums and Mellin Asymptotics with Explicit Error Bounds: A Case Study
Ingår i 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024), 2024
Konferensbidrag
- DOI för Binomial Sums and Mellin Asymptotics with Explicit Error Bounds: A Case Study
- Ladda ner fulltext (pdf) av Binomial Sums and Mellin Asymptotics with Explicit Error Bounds: A Case Study
A Bijection for the Evolution of B-Trees
Ingår i 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis ofAlgorithms (AofA 2024), 2024
Konferensbidrag
- DOI för A Bijection for the Evolution of B-Trees
- Ladda ner fulltext (pdf) av A Bijection for the Evolution of B-Trees
Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models
Ingår i 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024), 2024
Konferensbidrag
- DOI för Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models
- Ladda ner fulltext (pdf) av Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models
Ingår i La Matematica, s. 435-508, 2024
Artikel i tidskrift
- DOI för Conditioned Galton–Watson Trees: The Shape Functional, and More on the Sum of Powers of Subtree Sizes and Its Mean
- Ladda ner fulltext (pdf) av Conditioned Galton–Watson Trees: The Shape Functional, and More on the Sum of Powers of Subtree Sizes and Its Mean
The Uncover Process for Random Labeled Trees
Ingår i La Matematica, s. 861-892, 2023
Artikel i tidskrift
- DOI för The Uncover Process for Random Labeled Trees
- Ladda ner fulltext (pdf) av The Uncover Process for Random Labeled Trees
The minimum number of maximal independent sets in twin-free graphs
Ingår i The Electronic Journal of Combinatorics, 2024
Artikel i tidskrift
- DOI för The minimum number of maximal independent sets in twin-free graphs
- Ladda ner fulltext (pdf) av The minimum number of maximal independent sets in twin-free graphs
From flip processes to dynamical systems on graphons
Ingår i Annales de l'I.H.P. Probabilites et statistiques, s. 2878-2922, 2024
Artikel i tidskrift
Ingår i Electronic Communications in Probability, 2024
Artikel i tidskrift
Ingår i DATA MANAGEMENT TECHNOLOGIES AND APPLICATIONS, DATA 2023, s. 95-126, 2024
Konferensbidrag
Can smooth graphons in several dimensions be represented by smooth graphons on [0, 1]?
Ingår i EXAMPLES AND COUNTEREXAMPLES, 2021
Artikel i tidskrift
- Fler publikationer