UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Simply generated trees, conditioned Galton–Watson trees, random allocations and condensation

Probability surveys, 2012-01, Vol.9 (none), p.103

Janson, Svante

2012

Volltextzugriff (PDF)

Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns

Algorithmica, 2020-03, Vol.82 (3), p.616-641

Janson, Svante

2020

Volltextzugriff (PDF)

Phragmén’s voting methods and justified representation

Mathematical programming, 2024-01, Vol.203 (1-2), p.47-76

2024

Volltextzugriff (PDF)

The phase transition in inhomogeneous random graphs

Random structures & algorithms, 2007-08, Vol.31 (1), p.3-122

2007

Volltextzugriff (PDF)

Tail bounds for sums of geometric and exponential variables

Statistics & probability letters, 2018-04, Vol.135, p.1-6

Janson, Svante

2018

Volltextzugriff (PDF)

A piecewise contractive dynamical system and Phragmèn's election method

Bulletin de la Société mathématique de France, 2019, Vol.147 (3), p.395-441

2019

Volltextzugriff (PDF)

Large deviations for sums of partly dependent random variables

Random structures & algorithms, 2004-05, Vol.24 (3), p.234-248

Janson, Svante

2004

Volltextzugriff (PDF)

Gaussian Hilbert Spaces

Janson, Svante

2009

Volltextzugriff (PDF)

Can smooth graphons in several dimensions be represented by smooth graphons on [0,1]?

Examples and counterexamples, 2021-11, Vol.1, p.100011, Article 100011

2021

Volltextzugriff (PDF)

Limit theorems for triangular urn schemes

Probability theory and related fields, 2006-03, Vol.134 (3), p.417-452

JANSON, Svante

2006

Volltextzugriff (PDF)

The number of descendants in a random directed acyclic graph

Random structures & algorithms, 2024-05, Vol.64 (3), p.768-803

Janson, Svante

2024

Volltextzugriff (PDF)

Asymptotic normality for M -dependent and constrained U -statistics, with applications to pattern matching in random strings and permutations

Advances in applied probability, 2023-09, Vol.55 (3), p.841

Janson, Svante

2023

Volltextzugriff (PDF)

On a central limit theorem in renewal theory

Statistics & probability letters, 2024-01, Vol.204, p.109948, Article 109948

Janson, Svante

2024

Volltextzugriff (PDF)

Asymptotic normality for -dependent and constrained -statistics, with applications to pattern matching in random strings and permutations

Advances in applied probability, 2023-09, Vol.55 (3), p.841-894

Janson, Svante

2023

Volltextzugriff (PDF)

On Semi-Restricted Rock, Paper, Scissors

The Electronic journal of combinatorics, 2024-05, Vol.31 (2)

Janson, Svante

2024

Volltextzugriff (PDF)

On the probability that a binomial variable is at most its expectation

Statistics & probability letters, 2021-04, Vol.171, p.109020, Article 109020

Janson, Svante

2021

Volltextzugriff (PDF)

Asymptotic normality for $\boldsymbol{m}$ -dependent and constrained $\boldsymbol{U}$ -statistics, with applications to pattern matching in random strings and permutations

Advances in applied probability, 2023-09, Vol.55 (3), p.841-894

Janson, Svante

2023

Volltextzugriff (PDF)

Tree limits and limits of random trees

Combinatorics, probability & computing, 2021-11, Vol.30 (6), p.849-893

Janson, Svante

2021

Volltextzugriff (PDF)

Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees

Random structures & algorithms, 2016-01, Vol.48 (1), p.57-101

Janson, Svante

2016

Volltextzugriff (PDF)

On Edge Exchangeable Random Graphs

Journal of statistical physics, 2018, Vol.173 (3-4), p.448-484

Janson, Svante

2018

Volltextzugriff (PDF)

A new approach to the giant component problem

Random structures & algorithms, 2009-03, Vol.34 (2), p.197-216

2009

Volltextzugriff (PDF)

The Number of Occurrences of Patterns in a Random Tree or Forest Permutation

The Electronic journal of combinatorics, 2023-05, Vol.30 (2)

Janson, Svante

2023

Volltextzugriff (PDF)

Patterns in random permutations avoiding the pattern 321

Random structures & algorithms, 2019-09, Vol.55 (2), p.249-270

Janson, Svante

2019

Volltextzugriff (PDF)

On the Length of a Random Minimum Spanning Tree

Combinatorics, probability & computing, 2016-01, Vol.25 (1), p.89-107

2016

Volltextzugriff (PDF)

Random graphs with given vertex degrees and switchings

Random structures & algorithms, 2020-08, Vol.57 (1), p.3-31

Janson, Svante

2020

Volltextzugriff (PDF)

1 – 25 von 465

Menü

Weitere Dienste

Einstellungen

Simply generated trees, conditioned Galton–Watson trees, random allocations and condensation

Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns

Phragmén’s voting methods and justified representation

The phase transition in inhomogeneous random graphs

Tail bounds for sums of geometric and exponential variables

A piecewise contractive dynamical system and Phragmèn's election method

Large deviations for sums of partly dependent random variables

Gaussian Hilbert Spaces

Can smooth graphons in several dimensions be represented by smooth graphons on [0,1]?

Limit theorems for triangular urn schemes

The number of descendants in a random directed acyclic graph

Asymptotic normality for M -dependent and constrained U -statistics, with applications to pattern matching in random strings and permutations

On a central limit theorem in renewal theory

Asymptotic normality for -dependent and constrained -statistics, with applications to pattern matching in random strings and permutations

On Semi-Restricted Rock, Paper, Scissors

On the probability that a binomial variable is at most its expectation

Asymptotic normality for $\boldsymbol{m}$ -dependent and constrained $\boldsymbol{U}$ -statistics, with applications to pattern matching in random strings and permutations

Tree limits and limits of random trees

Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees

On Edge Exchangeable Random Graphs

A new approach to the giant component problem

The Number of Occurrences of Patterns in a Random Tree or Forest Permutation

Patterns in random permutations avoiding the pattern 321

On the Length of a Random Minimum Spanning Tree

Random graphs with given vertex degrees and switchings

Suchergebnisse filtern