Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Stable husbands: Label: en
On martingale tail sums for the path length in random trees: Label: en
Online Ramsey games for more than two colors: Label: en
Uniform multicommodity flows in the hypercube with random edge‐capacities: Label: en
On the variational problem for upper tails in sparse random graphs: Label: en
Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations: Label: en
Almost‐spanning universality in random graphs: Label: en
Dependence and phase changes in random m‐ary search trees: Label: en
Exploring hypergraphs with martingales: Label: en
The threshold for combs in random graphs: Label: en
Isomorphic edge disjoint subgraphs of hypergraphs: Label: en
Preferential attachment with choice: Label: en
A local central limit theorem for triangles in a random graph: Label: en
A scaling limit for the degree distribution in sublinear preferential attachment schemes: Label: en
Balls into bins via local search: Cover time and maximum load: Label: en
Percolation on random recursive trees: Label: en
Mantel's theorem for random hypergraphs: Label: en
Asymptotic behavior of random heaps: Label: en
Combinatorial criteria for uniqueness of Gibbs measures: Label: en
Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures: Label: en
The random binary growth model: Label: en
The Boolean functions computed by random Boolean formulas or how to grow the right function: Label: en
The C_ℓ‐free process: Label: en
Ancestors and descendants in evolving k‐tree models: Label: en
Coloring random graphs online without creating monochromatic subgraphs: Label: en
Interference percolation: Label: en
Almost universal graphs: Label: en
Average case analysis of the Boyer‐Moore algorithm: Label: en
The probabilistic analysis of a greedy satisfiability algorithm: Label: en
Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs: Label: en
Data structures with dynamical random transitions: Label: en
Robust locally testable codes and products of codes: Label: en
The connectivity threshold for the min‐degree random graph process: Label: en
A randomized on–line algorithm for the k–server problem on a line: Label: en
On ε‐biased generators in NC⁰: Label: en
Asymptotics in Knuth's parking problem for caravans: Label: en
Degree distribution of the greatest common divisor of polynomials over 𝔽_q: Label: en
On random points in the unit disk: Label: en
Regular subgraphs of random graphs: Label: en
Nodes of large degree in random trees and forests: Label: en
Threshold values of random K‐SAT from the cavity method: Label: en
The satisfiability threshold for randomly generated binary constraint satisfaction problems: Label: en
MAX k‐CUT and approximating the chromatic number of random graphs: Label: en
Topological characteristics of random triangulated surfaces: Label: en
The phase transition in the cluster‐scaled model of a random graph: Label: en
A phase transition for avoiding a giant component: Label: en
Applications of the regularity lemma for uniform hypergraphs: Label: en
The counting lemma for regular k‐uniform hypergraphs: Label: en
The square lattice shuffle, correction: Label: en
Singular values of Gaussian matrices and permanent estimators: Label: en