Svante Janson

Yaakov Malinovsky

CoRR, June, 2025

Periodic minimum in the count of binomial coefficients not divisible by a prime.

[BibT_eX]

[DOI]

Hsien-Kuei Hwang

Tsung-Hsi Tsai

Math. Comput., 2025

Approximation of subgraph counts in the uniform attachment model.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2025

2024

The number of descendants in a random directed acyclic graph.

[BibT_eX]

[DOI]

Random Struct. Algorithms, May, 2024

Identities and periodic oscillations of divide-and-conquer recurrences splitting at half.

[BibT_eX]

[DOI]

Hsien-Kuei Hwang

Tsung-Hsi Tsai

Adv. Appl. Math., April, 2024

Central limit theorem for components in meandric systems through high moments.

[BibT_eX]

[DOI]

Paul Thévenin

Comb. Probab. Comput., 2024

On Semi-Restricted Rock, Paper, Scissors.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

Fringe Trees for Random Trees with Given Vertex Degrees.

[BibT_eX]

[DOI]

Gabriel Berzunza Ojeda

Cecilia Holmgren

Proceedings of the 35th International Conference on Probabilistic, 2024

Bit-Array-Based Alternatives to HyperLogLog.

[BibT_eX]

[DOI]

Jérémie O. Lumbroso

Robert Sedgewick

Proceedings of the 35th International Conference on Probabilistic, 2024

Depth-First Search Performance in Random Digraphs.

[BibT_eX]

[DOI]

Philippe Jacquet

Proceedings of the 35th International Conference on Probabilistic, 2024

2023

Fluctuations of subgraph counts in graphon based random graphs.

[BibT_eX]

[DOI]

Bhaswar B. Bhattacharya

Anirban Chatterjee

Comb. Probab. Comput., May, 2023

On Knuth's conjecture for back and forward arcs in Depth First Search in a random digraph with geometric outdegree distribution.

[BibT_eX]

[DOI]

CoRR, 2023

Estimating Global Subgraph Counts by Sampling.

[BibT_eX]

[DOI]

Valentas Kurauskas

Electron. J. Comb., 2023

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

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

2022

On convergence for graphexes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

The distance profile of rooted and unrooted simply generated trees.

[BibT_eX]

[DOI]

Gabriel Berzunza Ojeda

Comb. Probab. Comput., 2022

Depth-First Search performance in a random digraph with geometric outdegree distribution.

[BibT_eX]

[DOI]

Philippe Jacquet

CoRR, 2022

Depth-First Search Performance in a Random Digraph with Geometric Degree Distribution.

[BibT_eX]

[DOI]

Philippe Jacquet

Proceedings of the 33rd International Conference on Probabilistic, 2022

2021

Tree limits and limits of random trees.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

2020

Asymptotic normality in random graphs with given vertex degrees.

[BibT_eX]

[DOI]

Random Struct. Algorithms, July, 2020

Random graphs with given vertex degrees and switchings.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

Rate of convergence for traditional Pólya urns.

[BibT_eX]

[DOI]

J. Appl. Probab., 2020

Strong convergence of infinite color balanced urns under uniform ergodicity.

[BibT_eX]

[DOI]

Antar Bandyopadhyay

Debleena Thacker

J. Appl. Probab., 2020

A graphon counter example.

[BibT_eX]

[DOI]

Discret. Math., 2020

Central limit theorems for additive functionals and fringe trees in tries.

[BibT_eX]

[DOI]

CoRR, 2020

Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns.

[BibT_eX]

[DOI]

Algorithmica, 2020

Hidden Words Statistics for Large Patterns.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Probabilistic, 2020

2019

Patterns in random permutations avoiding the pattern 321.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2019

Component structure of the configuration model: Barely supercritical case.

[BibT_eX]

[DOI]

Remco van der Hofstad

Random Struct. Algorithms, 2019

Competition in growth and urns.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2019

Competing first passage percolation on random graphs with finite variance degrees.

[BibT_eX]

[DOI]

Daniel Ahlberg

Maria Deijfen

Random Struct. Algorithms, 2019

A modified bootstrap percolation on a random graph coupled with a lattice.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Random Recursive Trees and Preferential Attachment Trees are Random Split Trees.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2019

Preferential attachment without vertex growth: emergence of the giant component.

[BibT_eX]

[DOI]

Lutz Warnke

CoRR, 2019

Successive Minimum Spanning Trees.

[BibT_eX]

[DOI]

Gregory B. Sorkin

Proceedings of the Approximation, 2019

2018

Graph properties, graph limits, and entropy.

[BibT_eX]

[DOI]

Hamed Hatami

Balázs Szegedy

J. Graph Theory, 2018

Thresholds quantifying proportionality criteria for election methods.

[BibT_eX]

[DOI]

CoRR, 2018

Preferential Attachment When Stable.

[BibT_eX]

[DOI]

Subhabrata Sen

CoRR, 2018

Non-Fringe Subtrees in Conditioned Galton - Watson Trees.

[BibT_eX]

[DOI]

Xing Shi Cai

Electron. J. Comb., 2018

Patterns in Random Permutations Avoiding Some Other Patterns (Keynote Speakers).

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Probabilistic, 2018

Inversions in Split Trees and Conditional Galton-Watson Trees.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Probabilistic, 2018

2017

Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications.

[BibT_eX]

[DOI]

Hsien-Kuei Hwang

Tsung-Hsi Tsai

ACM Trans. Algorithms, 2017

The Greedy Independent Set in a Random Graph with Given Degrees.

[BibT_eX]

[DOI]

Graham R. Brightwell

Random Struct. Algorithms, 2017

Packing random graphs and hypergraphs.

[BibT_eX]

[DOI]

Alex Scott

Random Struct. Algorithms, 2017

On String Graph Limits and the Structure of a Typical String Graph.

[BibT_eX]

[DOI]

Andrew J. Uzzell

J. Graph Theory, 2017

Patterns in Random Permutations Avoiding the Pattern 132.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2017

Multivariate Normal Limit Laws for the Numbers of Fringe Subtrees in m-ary Search Trees and Preferential Attachment Trees.

[BibT_eX]

[DOI]

Cecilia Holmgren

Matas Sileikis

Electron. J. Comb., 2017

Phragmén's Voting Methods and Justified Representation.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

The lower tail: Poisson approximation revisited.

[BibT_eX]

[DOI]

Lutz Warnke

Random Struct. Algorithms, 2016

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

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

Graph limits and hereditary properties.

[BibT_eX]

[DOI]

Eur. J. Comb., 2016

On the Length of a Random Minimum Spanning Tree.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2016

Phragmén's and Thiele's election methods.

[BibT_eX]

[DOI]

CoRR, 2016

A Unified Approach to Linear Probing Hashing with Buckets.

[BibT_eX]

[DOI]

Alfredo Viola

Algorithmica, 2016

2015

On degenerate sums of m-dependent variables.

[BibT_eX]

[DOI]

J. Appl. Probab., 2015

More on quasi-random graphs, subgraph counts and graph limits.

[BibT_eX]

[DOI]

Vera T. Sós

Eur. J. Comb., 2015

On the tails of the limiting Quicksort distribution.

[BibT_eX]

[DOI]

CoRR, 2015

Maximal Clades in Random Binary Search Trees.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

2014

Law of large numbers for the SIR epidemic on a random graph with given degrees.

[BibT_eX]

[DOI]

Peter Windridge

Random Struct. Algorithms, 2014

The probability that a random multigraph is simple. II.

[BibT_eX]

[DOI]

J. Appl. Probab., 2014

Graphs where every k-subset of vertices is an identifying set.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

Weighted Random Staircase Tableaux.

[BibT_eX]

[DOI]

Pawel Hitczenko

Comb. Probab. Comput., 2014

On the Spread of Random Graphs.

[BibT_eX]

[DOI]

Louigi Addario-Berry

Colin McDiarmid

Comb. Probab. Comput., 2014

On Symmetry of Uniform and Preferential Attachment Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

On the Typical Structure of Graphs in a Monotone Property.

[BibT_eX]

[DOI]

Andrew J. Uzzell

Electron. J. Comb., 2014

Asymptotic bias of some election methods.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2014

Weighted Staircase Tableaux, Asymmetric Exclusion Process, and Eulerian Type Recurrences.

[BibT_eX]

[DOI]

Pawel Hitczenko

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013

Coupon collecting and transversals of hypergraphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2013

VCG Auction Mechanism Cost Expectations and Variances.

[BibT_eX]

[DOI]

Gregory B. Sorkin

CoRR, 2013

2012

Renewal theory in the analysis of tries and strings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Hitting Times for Random Walks with Restarts.

[BibT_eX]

[DOI]

Yuval Peres

SIAM J. Discret. Math., 2012

The Probability of the Alabama Paradox.

[BibT_eX]

[DOI]

Svante Linusson

J. Appl. Probab., 2012

Monotone Graph Limits and Quasimonotone Graphs.

[BibT_eX]

[DOI]

Internet Math., 2012

Susceptibility in Inhomogeneous Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

Generalized Galois Numbers, Inversions, Lattice Paths, Ferrers Diagrams and Limit Theorems.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf.

[BibT_eX]

[DOI]

Mark Daniel Ward

Electron. J. Comb., 2012

Corrigendum to "The Mahonian probability distribution on words is asymptotically normal" [Adv. in Appl. Math. 46 (1-4) (2011) 109-124].

[BibT_eX]

[DOI]

E. Rodney Canfield

Doron Zeilberger

Adv. Appl. Math., 2012

2011

Duality in inhomogeneous random graphs, and the cut metric.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2011

Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees.

[BibT_eX]

[DOI]

Luc Devroye

Random Struct. Algorithms, 2011

Sparse random graphs with clustering.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2011

On covering by translates of a set.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2011

Correlations for paths in random orientations of G(n, p) and G(n, m).

[BibT_eX]

[DOI]

Sven Erick Alm

Svante Linusson

Random Struct. Algorithms, 2011

Generalized Stirling permutations, families of increasing trees and urn models.

[BibT_eX]

[DOI]

Markus Kuba

Alois Panholzer

J. Comb. Theory A, 2011

Quasi-random graphs and graph limits.

[BibT_eX]

[DOI]

Eur. J. Comb., 2011

Poset limits and exchangeable random posets.

[BibT_eX]

[DOI]

Comb., 2011

The Mahonian probability distribution on words is asymptotically normal.

[BibT_eX]

[DOI]

E. Rodney Canfield

Doron Zeilberger

Adv. Appl. Math., 2011

On Vertex, Edge, and Vertex-edge Random Graphs.

[BibT_eX]

[DOI]

Elizabeth Beer

Edward R. Scheinerman

Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

2010

Asymptotic equivalence and contiguity of some random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2010

Random graphs with forbidden vertex degrees.

[BibT_eX]

[DOI]

Geoffrey R. Grimmett

Random Struct. Algorithms, 2010

A divertent generating function that can be summed and analysed analytically.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2010

On the Number of Perfect Matchings in Random Lifts.

[BibT_eX]

[DOI]

Catherine S. Greenhill

Comb. Probab. Comput., 2010

2009

A new approach to the giant component problem.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2009

On the size of identifying codes in binary hypercubes.

[BibT_eX]

[DOI]

Tero Laihonen

J. Comb. Theory A, 2009

The Probability That a Random Multigraph is Simple.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

Line-of-Sight Percolation.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

Random Even Graphs.

[BibT_eX]

[DOI]

Geoffrey R. Grimmett

Electron. J. Comb., 2009

An optimal result for codes identifying sets of words.

[BibT_eX]

[DOI]

Tero Laihonen

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Threshold Graph Limits and Random Threshold Graphs.

[BibT_eX]

[DOI]

Persi Diaconis

Susan P. Holmes

Internet Math., 2008

Convergence of Some Leader Election Algorithms.

[BibT_eX]

[DOI]

Christian Lavault

Guy Louchard

Discret. Math. Theor. Comput. Sci., 2008

Dismantling Sparse Random Graphs.

[BibT_eX]

[DOI]

Andrew Thomason

Comb. Probab. Comput., 2008

Individual Displacements in Hashing with Coalesced Chains.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2008

2007

Rainbow Hamilton cycles in random regular graphs.

[BibT_eX]

[DOI]

Nicholas C. Wormald

Random Struct. Algorithms, 2007

A simple solution to the k-core problem.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2007

Spread-out percolation in Rd.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2007

The phase transition in inhomogeneous random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2007

A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

On a Random Graph Related to Quantum Theory.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

2006

Addendum to "The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph".

[BibT_eX]

[DOI]

Johan Wästlund

Random Struct. Algorithms, 2006

Random cutting and records in deterministic and random trees.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2006

Left and Right Pathlengths in Random Binary Trees.

[BibT_eX]

[DOI]

Algorithmica, 2006

Partial Fillup and Search Time in LC Tries.

[BibT_eX]

[DOI]

Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006

2005

Individual displacements for linear probing hashing with different insertion policies.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2005

Asymptotic degree distribution in random recursive trees.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2005

The phase transition in the uniformly grown random graph has infinite order.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2005

2004

Large deviations for sums of partly dependent random variables.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2004

On Generalized Random Railways.

[BibT_eX]

[DOI]

Hans Garmo

Michal Karonski

Comb. Probab. Comput., 2004

Quicksort with Unreliable Comparisons: A Probabilistic Analysis.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

The Deletion Method For Upper Tail Estimates.

[BibT_eX]

[DOI]

Comb., 2004

The number of bit comparisons used by Quicksort: an average-case analysis.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

On the Average Sequence Complexity.

[BibT_eX]

[DOI]

Stefano Lonardi

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003

The Wiener Index of simply generated random trees.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2003

On smallest triangles.

[BibT_eX]

[DOI]

Geoffrey R. Grimmett

Random Struct. Algorithms, 2003

Cycles And Unicyclic Components In Random Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

2002

Random dyadic tilings of the unit square.

[BibT_eX]

[DOI]

Dana Randall

Random Struct. Algorithms, 2002

The infamous upper tail.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

Quicksort asymptotics.

[BibT_eX]

[DOI]

J. Algorithms, 2002

Permutation Pseudographs And Contiguity.

[BibT_eX]

[DOI]

Catherine S. Greenhill

Jeong Han Kim

Nicholas C. Wormald

Comb. Probab. Comput., 2002

2001

Erratum to Bounding the Unsatisfiability Threshold of Random 3-SAT.

[BibT_eX]

[DOI]

Yannis C. Stamatiou

Malvina Vamvakari

Random Struct. Algorithms, 2001

Asymptotic distribution for the cost of linear probing hashing.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

Approximating the limiting Quicksort distribution.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

2000

Bounding the unsatisfiability threshold of random 3-SAT.

[BibT_eX]

[DOI]

Yannis C. Stamatiou

Malvina Vamvakari

Random Struct. Algorithms, 2000

Growth of components in random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

A characterization of the set of fixed points of the Quicksort transformation

[BibT_eX]

[DOI]

CoRR, 2000

Smoothness and decay properties of the limiting Quicksort density function

[BibT_eX]

[DOI]

CoRR, 2000

Random graphs.

[BibT_eX]

[DOI]

Tomasz Luczak

Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-471-17541-4, 2000

1999

On the variance of the random sphere of influence graph.

[BibT_eX]

[DOI]

Pawel Hitczenko

Joseph E. Yukich

Random Struct. Algorithms, 1999

One, Two And Three Times Log N/N For Paths In A Complete Graph With Random Weights.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1999

1998

New versions of Suen's correlation inequality.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1998

1997

Shellsort with three increments.

[BibT_eX]

[DOI]

Donald E. Knuth

Random Struct. Algorithms, 1997

Analysis of an Asymmetric Leader Election Algorithm.

[BibT_eX]

[DOI]

Electron. J. Comb., 1997

Hook Lengths in a Skew Young Diagram.

[BibT_eX]

[DOI]

Electron. J. Comb., 1997

1996

Random Covering Designs.

[BibT_eX]

[DOI]

Anant P. Godbole

J. Comb. Theory A, 1996

1995

A Graph Fourier Transform and Proportional Graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

Hamilton Cycles in a Random Tournament.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

Perfect Matchings in Random s-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Alan M. Frieze

Random Struct. Algorithms, 1995

Random Regular Graphs: Asymptotic Distributions and Contiguity.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1995

1994

Introduction.

[BibT_eX]

[DOI]

Alan M. Frieze

Tomasz Luczak

Random Struct. Algorithms, 1994

The Numbers of Spanning Trees, Hamilton cycles and Perfect Matchings in a Random Graph.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1994

1993

The Birth of the Giant Component.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1993

Multicyclic Components in a Random Graph Process.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1993

1992

Probabilistic Construction of Proportional Graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1992

Thresholds for classes of intersection graphs.

[BibT_eX]

[DOI]

Jan Kratochvíl

Discret. Math., 1992

1991

Proportional Graphs.

[BibT_eX]

[DOI]

Jan Kratochvíl

Random Struct. Algorithms, 1991

1990

Poisson Approximation for Large Deviations.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1990

A Functional Limit Theorem for Random Graphs with Applications to Subgraph Count Statistics.

[BibT_eX]

[DOI]