Journal: Combinatorics, Probability & Computing

Volume 23, Issue 6

889 -- 913Tatjana Bakshajeva, Eugenijus Manstavicius. On Statistics of Permutations Chosen From the Ewens Distribution
914 -- 972J. Bouttier, E. Guitter. On Irreducible Maps and Slices
973 -- 1009Francis Comets, François Delarue, René Schott. Information Transmission under Random Emission Constraints
1010 -- 1027Iulia Dahmer, Götz Kersting, Anton Wakolbinger. The Total External Branch Length of Beta-Coalescents
1028 -- 1056Martin Fürer, Shiva Prasad Kasiviswanathan. Approximately Counting Embeddings into Random Graphs
1057 -- 1086Peter J. Grabner, Arnold Knopfmacher, Stephan G. Wagner. A General Asymptotic Scheme for the Analysis of Partition Statistics
1087 -- 1113Clemens Heuberger, Sara Kropf. Analysis of the Binary Asymmetric Joint Sparse Form
1114 -- 1147Pawel Hitczenko, Svante Janson. Weighted Random Staircase Tableaux
1148 -- 1186Margarete Knape, Ralph Neininger. Pólya Urns Via the Contraction Method

Volume 23, Issue 5

631 -- 634Robert Sedgewick. In Memory of Philippe Flajolet
635 -- 669Louigi Addario-Berry, Laura Eslava. Hitting Time Theorems for Random Matrices
670 -- 685Margaret Archibald, Arnold Knopfmacher. The Largest Missing Value in a Sample of Geometric Random Variables
686 -- 716Edward A. Bender, Zhicheng Gao. Part Sizes of Smooth Supercritical Compositional Structures
717 -- 724Miklós Bóna. A New Upper Bound for 1324-Avoiding Permutations
725 -- 748Mireille Bousquet-Mélou. On the Importance Sampling of Self-Avoiding Walks
749 -- 795Mireille Bousquet-Mélou, Kerstin Weller. Asymptotic Properties of Some Minor-Closed Classes of Graphs
796 -- 804Luc Devroye, Nicolas Fraiman. The Random Connection Model on the Torus
805 -- 828James Allen Fill, Jason Matterer. QuickSelect Tree Process Convergence, With an Application to Distributional Convergence for the Number of Symbol Comparisons Used by Worst-Case Find
829 -- 841Philippe Jacquet, Charles Knessl, Wojciech Szpankowski. A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence
842 -- 860Cedric Loi, Paul-Henry Cournède, Jean Françon. A Symbolic Method to Analyse Patterns in Plant Structure
861 -- 888Stephen Melczer, Marni Mishna. Singularity Analysis Via the Iterated Kernel Method

Volume 23, Issue 4

477 -- 504Louigi Addario-Berry, Svante Janson, Colin McDiarmid. On the Spread of Random Graphs
505 -- 538Shankar Bhamidi, Amarjit Budhiraja, Xuan Wang. Bounded-Size Rules: The Barely Subcritical Regime
539 -- 550Jeff Cooper, Kunal Dutta, Dhruv Mubayi. Counting Independent Sets in Hypergraphs
551 -- 570Louis Esperet, Gwenaël Joret. Colouring Planar Graphs With Three Colours and No Large Monochromatic Components
571 -- 584Agelos Georgakopoulos, Peter Winkler. New Bounds for Edge-Cover by Random Walk
585 -- 606Ravi Montenegro. Intersection Conductance and Canonical Alternating Paths: Methods for General Finite Markov Chains
607 -- 630Jozef Skokan, Maya Jakobine Stein. Cycles Are Strongly Ramsey-Unsaturated

Volume 23, Issue 3

317 -- 330Daniel Ahlberg. Partially Observed Boolean Sequences and Noise Sensitivity
331 -- 366Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang. Local Limit Theorems for the Giant Component of Random Hypergraphs
367 -- 385Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang. d-Uniform Hypergraphs
386 -- 411Steffen Dereich, Marcel Ortgiese. Robust Analysis of Preferential Attachment Models with Fitness
412 -- 433Pu Gao. k-Regular Subgraph is Large
434 -- 448Roman Glebov, Tibor Szabó, Gábor Tardos. Conflict-Free Colouring of Graphs
449 -- 459Peter Hegarty, Dmitry Zhelezov. On the Diameters of Commuting Graphs Arising from Random Skew-Symmetric Matrices
460 -- 476Perla Sousi, Peter Winkler. Mixing Times and Moving Targets

Volume 23, Issue 2

161 -- 200Mahshid Atapour, Neal Madras. Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations
201 -- 222Olivier Bernardi, Rosena R. X. Du, Alejandro H. Morales, Richard P. Stanley. Separation Probabilities for Products of Permutations
223 -- 247Eden Chlamtac, Ishay Haviv. Linear Index Coding via Semidefinite Programming
248 -- 268Daniele Mundici. Invariant Measure Under the Affine Group Over
269 -- 289Tal Orenshtein, Igor Shinkar. Greedy Random Walk
290 -- 315David Sivakoff. d-Dimensional Hamming Torus

Volume 23, Issue 1

1 -- 7Eric Blais, Amit Weinstein, Yuichi Yoshida. Semi-Strong Colouring of Intersecting Hypergraphs
8 -- 28David Conlon, Jacob Fox, Benny Sudakov. Short Proofs of Some Extremal Results
29 -- 49Yael Dekel, Ori Gurel-Gurevich, Yuval Peres. Finding Hidden Cliques in Linear Time with High Probability
50 -- 65Michael Drmota, Anna S. Lladó. m
66 -- 74Jacob Fox, János Pach. Applications of a New Separator Theorem for String Graphs
75 -- 89Rani Hod, Alon Naor. Component Games on Regular Graphs
90 -- 101Tomás Kaiser, Ross J. Kang. t Chromatic Index of Graphs
102 -- 115Teeradej Kittipassorn, Bhargav P. Narayanan. m-Coloured Complete Subgraphs
116 -- 134Yuri Lima, Carlos Gustavo Moreira. A Marstrand Theorem for Subsets of Integers
135 -- 139Jirí Matousek. Near-Optimal Separators in String Graphs
140 -- 160Robin Pemantle, Yuval Peres. Concentration of Lipschitz Functionals of Determinantal and Other Strong Rayleigh Measures