Boris Pittel

From MaRDI portal
Person:1296593


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The likely maximum size of twin subtrees in a large random tree
 
2023-12-02Paper
Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves
Random Structures & Algorithms
2023-10-12Paper
On Bollobás‐Riordan random pairing model of preferential attachment graph
Random Structures & Algorithms
2023-10-12Paper
Counting subtrees of the branching process tree by the number of leaves
 
2023-05-05Paper
Expected Number of Induced Subtrees Shared by Two Independent Copies of a Random Tree
SIAM Journal on Discrete Mathematics
2023-03-30Paper
The Critical Beta-splitting Random Tree: Heights and Related Results
 
2023-02-10Paper
Perfect partitions of a random set of integers
 
2022-10-02Paper
Giant descendant trees, matchings, and independent sets in age-biased attachment graphs
Journal of Applied Probability
2022-07-08Paper
On a random search tree: asymptotic enumeration of vertices by distance from leaves – CORRIGENDUM
Advances in Applied Probability
2022-06-28Paper
Expected number of induced subtrees shared by two independent copies of a random tree
 
2021-02-11Paper
One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences
Discrete Applied Mathematics
2021-02-01Paper
On random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferences
Advances in Applied Mathematics
2020-09-01Paper
On connectivity, conductance and bootstrap percolation for a random \(K\)-out, age-biased graph
Random Structures & Algorithms
2020-06-19Paper
One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences
 
2020-05-13Paper
Corrigendum to: ``Existence of a perfect matching in a random \((1+e^{-1})\)-out bipartite graph
Journal of Combinatorial Theory. Series B
2020-04-22Paper
On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women
Mathematics of Operations Research
2020-03-12Paper
On the cycle structure of the product of random maximal cycles
2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
2019-09-17Paper
On a random search tree: asymptotic enumeration of vertices by distance from leaves
Advances in Applied Probability
2019-09-16Paper
On random stable partitions
International Journal of Game Theory
2019-07-11Paper
On a perfect matching in a random bipartite digraph with average out-degree below two
 
2019-03-13Paper
On random quadratic forms: supports of potential local maxima
Journal of Applied Probability
2019-01-17Paper
Counting strongly connected \((k_1,k_2)\)-directed cores
Random Structures & Algorithms
2018-09-28Paper
Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions
Advances in Mathematics
2018-06-22Paper
On random exchange-stable matchings
Mathematical Social Sciences
2018-06-20Paper
The satisfiability threshold for \(k\)-XORSAT
Combinatorics, Probability and Computing
2017-10-10Paper
Formation of a giant component in the intersection graph of a random chord diagram
Journal of Combinatorial Theory. Series B
2017-05-26Paper
Birth of a giant \((k_{1},k_{2})\)-core in the random digraph
Advances in Applied Mathematics
2017-03-16Paper
Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs
Random Structures & Algorithms
2016-09-07Paper
Central limit theorems, Lee-Yang zeros, and graph-counting polynomials
Journal of Combinatorial Theory. Series A
2016-04-20Paper
Another proof of the Harer-Zagier formula
The Electronic Journal of Combinatorics
2016-02-11Paper
Inside the critical window for cohomology of random \(k\)-complexes
Random Structures & Algorithms
2016-02-03Paper
On a surface formed by randomly gluing together polygonal discs
Advances in Applied Mathematics
2015-12-23Paper
Distance between two random \(k\)-out digraphs, with and without preferential attachment
Advances in Applied Probability
2015-11-06Paper
Sharp threshold and scaling window for the integer partitioning problem
Proceedings of the thirty-third annual ACM symposium on Theory of computing
2015-02-27Paper
On the connected components of a random permutation graph with a given number of edges
Journal of Combinatorial Theory. Series A
2014-01-06Paper
On a sparse random graph with minimum degree three: likely Pósa sets are large
Journal of Combinatorics
2013-11-05Paper
Counting strongly-connected, moderately sparse directed graphs
Random Structures & Algorithms
2013-08-27Paper
The Satisfiability Threshold for $k$-XORSAT, using an alternative proof
 
2012-12-16Paper
The genus of a random chord diagram is asymptotically normal
Journal of Combinatorial Theory. Series A
2012-11-09Paper
Tight Markov chains and random compositions
The Annals of Probability
2012-08-17Paper
How frequently is a system of 2-linear Boolean equations solvable?
The Electronic Journal of Combinatorics
2010-08-12Paper
On the likely number of solutions for the stable marriage problem
Combinatorics, Probability and Computing
2010-04-23Paper
On a random graph evolving by degrees
Advances in Mathematics
2010-01-05Paper
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science
2009-05-07Paper
Expected coalescence time for a nonuniform allocation process
Advances in Applied Probability
2009-02-16Paper
On the Number of Fixed Pairs in a Random Instance of the Stable Marriage Problem
SIAM Journal on Discrete Mathematics
2008-12-05Paper
Edge percolation on a random regular graph of low degree
The Annals of Probability
2008-09-04Paper
How often are two permutations comparable?
Transactions of the American Mathematical Society
2008-09-01Paper
On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase
The Annals of Applied Probability
2008-08-20Paper
Corrigendum to ``Counting connected graphs inside-out [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)]
Journal of Combinatorial Theory. Series B
2008-07-24Paper
Limit shape of a random integer partition with a bounded max-to-min ratio of parts sizes
Journal of Combinatorial Theory. Series A
2007-10-10Paper
Limit shapes for random square Young tableaux
Advances in Applied Mathematics
2007-08-27Paper
Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position
Random Structures & Algorithms
2007-02-07Paper
Bootstrap percolation on the random regular graph
Random Structures & Algorithms
2007-02-07Paper
Near-perfect non-crossing harmonic matchings in randomly labeled points on a circle
 
2006-08-29Paper
On the Likelihood of Comparability in Bruhat Order
 
2006-05-17Paper
On Dimensions of a Random Solid Diagram
Combinatorics, Probability and Computing
2005-11-14Paper
Counting connected graphs inside-out
Journal of Combinatorial Theory. Series B
2005-03-08Paper
scientific article; zbMATH DE number 2127722 (Why is no real title available?)
 
2005-01-14Paper
Phase diagram for the constrained integer partitioning problem
Random Structures & Algorithms
2004-08-06Paper
scientific article; zbMATH DE number 2079334 (Why is no real title available?)
 
2004-07-28Paper
scientific article; zbMATH DE number 1984558 (Why is no real title available?)
 
2003-09-22Paper
Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph
Journal of Combinatorial Theory. Series B
2003-08-25Paper
A phase transition phenomenon in a random directed acyclic graph
Random Structures & Algorithms
2003-07-27Paper
Phase transition and finite-size scaling for the integer partitioning problem
Random Structures & Algorithms
2003-07-05Paper
Size of the largest cluster under zero-range invariant measures
The Annals of Probability
2003-05-06Paper
Asymptotic enumeration of sparse graphs with a minimum degree constraint
Journal of Combinatorial Theory. Series A
2003-04-28Paper
On the distribution of the number of Young tableaux for a uniformly random diagram
Advances in Applied Mathematics
2003-03-26Paper
Analysis of Rabin's irreducibility test for polynomials over finite fields
Random Structures & Algorithms
2003-02-25Paper
On the largest component of the random graph at a nearcritical stage
Journal of Combinatorial Theory. Series B
2002-12-10Paper
On tail distribution of interpost distance
Journal of Combinatorial Theory. Series B
2002-12-10Paper
scientific article; zbMATH DE number 1139976 (Why is no real title available?)
 
2002-11-11Paper
Confirming the Kleitman-Winston conjecture on the largest coefficient in a \(q\)-Catalan number
Journal of Combinatorial Theory. Series A
2001-02-22Paper
On a random graph with immigrating vertices: Emergence of the giant component
 
2001-02-06Paper
Normal convergence problem? Two moments and a recurrence may be the clues
The Annals of Applied Probability
2000-09-04Paper
The random bipartite nearest neighbor graphs
 
2000-05-09Paper
Where the typical set partitions meet and join
The Electronic Journal of Combinatorics
2000-03-01Paper
Tree and forest weights and their application to nonuniform random graphs
The Annals of Applied Probability
2000-02-09Paper
Confirming two conjectures about the integer partitions
Journal of Combinatorial Theory. Series A
1999-12-20Paper
On the multiplicity of parts in a random partition
 
1999-08-19Paper
On the random Young diagrams and their cores
Journal of Combinatorial Theory. Series A
1999-07-20Paper
The asymptotic number of set partitions with unequal block sizes
The Electronic Journal of Combinatorics
1999-02-02Paper
On a likely shape of the random Ferrers diagram
Advances in Applied Mathematics
1998-09-08Paper
Random set partitions: Asymptotics of subset counts
Journal of Combinatorial Theory. Series A
1998-09-08Paper
On-Line Coloring of Sparse Random Graphs and Random Trees
Journal of Algorithms
1997-04-27Paper
A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree
 
1997-01-27Paper
Sudden emergence of a giant \(k\)-core in a random graph
Journal of Combinatorial Theory. Series B
1996-10-14Paper
Probabilistic analysis of an algorithm in the theory of markets in indivisible goods
The Annals of Applied Probability
1996-03-12Paper
scientific article; zbMATH DE number 742942 (Why is no real title available?)
 
1995-04-11Paper
The Structure of a Random Graph at the Point of the Phase Transition
Transactions of the American Mathematical Society
1995-03-02Paper
An upper bound for the solvability probability of a random stable roommates instance
Random Structures & Algorithms
1995-01-29Paper
scientific article; zbMATH DE number 432786 (Why is no real title available?)
 
1994-09-19Paper
Components of Random Forests
Combinatorics, Probability and Computing
1994-08-10Paper
Note on the heights of random recursive trees and random m‐ary search trees
Random Structures & Algorithms
1994-06-22Paper
On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm
Combinatorics, Probability and Computing
1994-05-24Paper
The ``stable roommates problem with random preferences
The Annals of Probability
1994-01-05Paper
The average performance of the greedy matching algorithm
The Annals of Applied Probability
1993-10-28Paper
The birth of the giant component
Random Structures & Algorithms
1993-08-22Paper
On likely solutions of a stable marriage problem
The Annals of Applied Probability
1993-01-16Paper
Correction to: Random tree-type partitions as a model for acyclic polymerization: Holtsmark (3/2-stable) distribution of the supercritical gel
The Annals of Probability
1993-01-16Paper
scientific article; zbMATH DE number 15307 (Why is no real title available?)
 
1992-06-25Paper
Corrigendum
Discrete Applied Mathematics
1992-06-25Paper
On tree census and the giant component in sparse random graphs
Random Structures & Algorithms
1992-06-25Paper
Random tree-type partitions as a model for acyclic polymerization: Holtsmark (3/2-stable) distribution of the supercritical gel
The Annals of Probability
1992-06-25Paper
A Graph-Valued Markov Process as Rings-Allowed Polymerization Model: Subcritical Behavior
SIAM Journal on Applied Mathematics
1992-06-25Paper
How many random questions are necessary to identify \(n\) distinct objects?
Journal of Combinatorial Theory. Series A
1992-06-25Paper
Stable husbands
Random Structures & Algorithms
1990-01-01Paper
On a Daley-Kendall model of random rumours
Journal of Applied Probability
1990-01-01Paper
scientific article; zbMATH DE number 4209276 (Why is no real title available?)
 
1990-01-01Paper
The first cycles in an evolving graph
Discrete Mathematics
1989-01-01Paper
A Recurrence Related to Trees
 
1989-01-01Paper
The Average Number of Stable Matchings
SIAM Journal on Discrete Mathematics
1989-01-01Paper
Analysis of the space of search trees under the random insertion algorithm
Journal of Algorithms
1989-01-01Paper
On Search Times for Early-Insertion Coalesced Hashing
SIAM Journal on Computing
1988-01-01Paper
A Random Graph With a Subcritical Number of Edges
 
1988-01-01Paper
On the joint distribution of the insertion path length and the number of comparisons in search trees
Discrete Applied Mathematics
1988-01-01Paper
scientific article; zbMATH DE number 4081623 (Why is no real title available?)
 
1987-01-01Paper
On Spreading a Rumor
SIAM Journal on Applied Mathematics
1987-01-01Paper
On probabilistic analysis of a coalesced hashing algorithm
The Annals of Probability
1987-01-01Paper
Linear probing: The probable largest search time grows logarithmically with the number of records
Journal of Algorithms
1987-01-01Paper
An urn model for cannibal behavior
Journal of Applied Probability
1987-01-01Paper
Paths in a random digital tree: limiting distributions
Advances in Applied Probability
1986-01-01Paper
On growing a random Young tableau
Journal of Combinatorial Theory. Series A
1986-01-01Paper
Random permutations and Brownian motion
Pacific Journal of Mathematics
1985-01-01Paper
Asymptotical growth of a class of random trees
The Annals of Probability
1985-01-01Paper
scientific article; zbMATH DE number 3923753 (Why is no real title available?)
 
1984-01-01Paper
On growing random binary trees
Journal of Mathematical Analysis and Applications
1984-01-01Paper
scientific article; zbMATH DE number 3965074 (Why is no real title available?)
 
1984-01-01Paper
On the Most Probable Shape of a Search Tree Grown from a Random Permutation
SIAM Journal on Algebraic Discrete Methods
1984-01-01Paper
On distributions related to transitive closures of random finite mappings
The Annals of Probability
1983-01-01Paper
The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms
SIAM Journal on Computing
1983-01-01Paper
Counting subsets of the random partition and the 'Brownian bridge' process
Stochastic Processes and their Applications
1983-01-01Paper
On the probable behaviour of some algorithms for finding the stability number of a graph
Mathematical Proceedings of the Cambridge Philosophical Society
1982-01-01Paper
Limiting behavior of a process of runs
The Annals of Probability
1981-01-01Paper
The number of increasing subsequences of the random permutation
Journal of Combinatorial Theory. Series A
1981-01-01Paper
A process of runs and its convergence to the Brownian motion
Stochastic Processes and their Applications
1980-01-01Paper
Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis
Mathematics of Operations Research
1979-01-01Paper
On a Game Random Walk on a Straight Line
Theory of Probability & Its Applications
1974-01-01Paper
Semi-Markov Decisions in a Problem of Optimizing a Checking Procedure of an Unreliable Queuing System
Theory of Probability & Its Applications
1972-01-01Paper
scientific article; zbMATH DE number 3506011 (Why is no real title available?)
 
1972-01-01Paper
scientific article; zbMATH DE number 3426620 (Why is no real title available?)
 
1972-01-01Paper
scientific article; zbMATH DE number 3420472 (Why is no real title available?)
 
1972-01-01Paper
A Minimax Analogue of the Weak Law of Large Numbers
Theory of Probability & Its Applications
1971-01-01Paper
A Linear Programming Problem Connected with Optimal Stationary Control in a Dynamic Decision Problem
Theory of Probability & Its Applications
1971-01-01Paper
scientific article; zbMATH DE number 3309726 (Why is no real title available?)
 
1969-01-01Paper
scientific article; zbMATH DE number 3289017 (Why is no real title available?)
 
1969-01-01Paper
scientific article; zbMATH DE number 3281643 (Why is no real title available?)
 
1969-01-01Paper
scientific article; zbMATH DE number 3324286 (Why is no real title available?)
 
1967-01-01Paper
scientific article; zbMATH DE number 3330391 (Why is no real title available?)
 
1967-01-01Paper
scientific article; zbMATH DE number 3375985 (Why is no real title available?)
 
1967-01-01Paper
scientific article; zbMATH DE number 3276740 (Why is no real title available?)
 
1965-01-01Paper
scientific article; zbMATH DE number 3207559 (Why is no real title available?)
 
1964-01-01Paper
scientific article; zbMATH DE number 3210784 (Why is no real title available?)
 
1963-01-01Paper
Some problems of optimum control. I
Automation and Remote Control
1963-01-01Paper
scientific article; zbMATH DE number 3324285 (Why is no real title available?)
 
1963-01-01Paper
scientific article; zbMATH DE number 3213076 (Why is no real title available?)
 
1962-01-01Paper


Research outcomes over time


This page was built for person: Boris Pittel