sort by
approximate search
1shortlisttitle datasearch history  
results search [or] ISN:0000000110412621 | 1 hits
Person
ISNI: 
0000 0001 1041 2621
Name: 
Janson, S.
Janson, Svante,
Svante Janson
Svante Janson (svensk matematikar)
Svante Janson (svensk matematiker)
Svante Janson (Swedish mathematician)
Svante Janson (Zweeds wiskundige)
Dates: 
1955-
Creation class: 
article
Computer file
cre
Language material
Manuscript language material
Text
txt
Creation role: 
author
Related names: 
Barbour, A. D. (co-author)
Bollobás, Béla
Fill, James Allen
Holst, Lars
Luczak, Malwina J.
Luczak, Tomasz
Łuczak, Tomasz (co-author)
Matematiska Institutionen Uppsala Affiliation (see also from)
Peetre, Jaak
Riordan, Oliver
Ruciński, Andrzej
Uppsala : Univ
Uppsala Universitet Affiliation (see also from)
Uppsala universitet. Matematiska institutionen
Uppsala University. Departement of mathematics
Vegelius, Jan (1941-1990)
Titles: 
Asymptotic Degree Distribution in Random Recursive Trees
Asymptotic Distribution for the Cost of Linear Probing Hashing
Asymptotic equivalence and contiguity of some random graphs
Computer science. Networking--smoothly does it.
Converse results for existence of moments and uniform integrability for stopped random walks.
Cycles and Unicyclic Components in Random Graphs
Dismantling Sparse Random Graphs
First Eigenvalue of Random Graphs, The
Gaussian Hilbert spaces
Graphs with specified degree distributions, simple epidemics, and local vaccination strategies
Higher moments of Banach space valued random variables
Individual displacements for linear probing hashing with different insertion policies
Individual Displacements in Hashing with Coalesced Chains
integral of the supremum process of Brownian motion, The
interesting class of operators with unusual Schatten-von Neuman behavior, An
Interpolation of subcouples and quotient couples
Large cliques in a power-law random graph
Large deviation inequalities for sums of indicator variables
largest component in a subcritical random graph with a power law degree distribution, The
Left and right pathlengths in random binary trees
Limit theorems for certain branching random walks on compact groups and homogenous spaces
Limit theorems for some sequential occupancy problems.
Limit theorems for triangular urn schemes
limiting behaviour of certain stopped sums and some applications, The
Limiting distribution of the number of "near-matches".
Line-of-sight percolation
Local limit theorems for finite and infinite urn models
Mahonian probability distribution on words is asymptotically normal, The
maximum of Brownian motion with parabolic drift, The
Measures of ecological coexistence
Measures of similarity between distributions.
Membership of Hankel operators on the ball in unitary ideals
Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph, The
Moment convergence in conditional limit theorems
Moments for first-passage and last-exit times, the minimum, and related quantities for random walks with positive drift.
Moments of Gamma type and the Brownian supremum process area
Monotonicity, asymptotic normality and vertex degrees in random graphs
Multicyclic components in a random graph process.
new approach to the giant component problem, A
New versions of Suen's correlation inequality.
Notes on Wolff's note on interpolation spaces
number of bit comparisons used by Quicksort:an average-case analysis, The
numbers of spanning trees, Hamilton cycles and perfect matchings in a random graph., The
Om moment conditions for normed sums of independent variables and Martingale differences
On a random graph related to quantum theory
On BMO and related spaces
On certain quotients of Hardy spaces
On complex hypercontractivity.
On constructions of e-correlation coefficients
On covering by translates of a set
On functions with conditions on the mean oscillation
On functions with derivatetives in H¹.
On generalizations of the G index and the phi coefficient to nominal scales
On generalized random railways
On interpolation of multi-linear operators.
On random 3-sat
On the action of Hankel and Toeplitz operators on some function spaces.
On the asymptotic joint distribution of height and width in random trees
On the length of the longest increasing subsequence in a random permutation.
On the Number of Perfect Matchings in Random Lifts
On the optimal asymptotic eigenvalue behaviour of weakly singular integral operators
On the size of identifying codes in binary hypercubes
On the spread of supercritical random graphs
One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
Orthogonal decompositions and functional limit theorems for random graph statistics. -
Paracommutators - boundedness and Schatten-von Neumann properties
Partial fillup and search time in LC tries
phase transition in inhomogeneous random graphs, The
Phase transitions for modified Erdős-Rényi processes
Plane recursive trees, Stirling permutations and an urn model
Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution, A
Poisson approximation using the Stein-Chen method and coupling: Number of exceedances of Gaussian random variables.
Poisson convergence and Poisson processes with applications to random graphs.
Precise logarithmic asymptotics for the right tails of some limit random variables for random trees
probability that a random multigraph is simple, The
Proportional graphs
Quicksort asymptotics
Quicksort with Unreliable Comparisons: A Probabilistic Analysis
Rainbow Hamilton cycles in random regular graphs
random-cluster model on the complete graph, The
Random coverings and related problems
Random coverings in several dimensions.
Random cutting and records in deterministic and random trees
Random dyadic tilings of the unit square
Random even graphs and the Isling model
Random graphs and probabilistic methods in combinatorics and computer science : proceedings
Random graphs with forbidden vertex degrees
Random records and cutting in complete binary trees
Random self-avoiding walks on one-dimensional lattices
Renewal theory for m-dependent variables
ROBUST RECONSTRUCTION ON TREES IS DETERMINED BY THE SECOND EIGENVALUE
Rounding of continuous random variables and oscillatory asymptotics
second moment method, conditioning and approximation, The
Shellsort with three increments
simple solution to the k-core problem, A
size of random fragmentation trees, The
Smoothness and decay properties of the limiting quicksort density function
Some pairwise independent sequences for which the central limit theorem fails.
Some remarks on the combinatorics of ISn
Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence
Sparse random graphs with clustering
Standard representation of multivariate functions on a general probability space
Superreplication of options on several underlying assets.
Tail estimates for the Brownian excursion area and other Brownian areas
Theory of random graphs
Tightness and weak convergence for jump processes.
Uncorrelated associated variables are independent
Upper Bound for the Velocity of First-Passage Percolation
Volatility time and properties of option prices.
Weak limits for quantum random walks.
Wiener index of simply generated random trees, The
Zeros of sections of the binomial expansion
Contributed to or performed: 
ALGORITHMICA -NEW YORK-
ANNALS OF APPLIED PROBABILITY
ANNALS OF COMBINATORICS
ANNALS OF PROBABILITY
BERNOULLI -LONDON-
CAMBRIDGE TRACTS IN MATHEMATICS
COMBINATORICS PROBABILITY AND COMPUTING
IMA VOLUMES IN MATHEMATICS AND ITS APPLICATIONS
JOURNAL OF APPLIED PROBABILITY
PROBABILITY THEORY AND RELATED FIELDS
RANDOM STRUCTURES AND ALGORITHMS
Notes: 
Härtill 4 uppsatser
Diss. (sammanfattning) Uppsala : Univ
Sources: 
BOWKER
NTA
ZETO