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 #101 to #150.

Polynomial time perfect sampling algorithm for two-rowed contingency tables: Label: en
The degree sequences and spectra of scale-free random graphs: Label: en
Minors in lifts of graphs: Label: en
Levels of a scale-free tree: Label: en
On smoothed analysis in dense graphs and formulas: Label: en
Random cutting and records in deterministic and random trees: Label: en
Concentration inequalities for functions of independent variables: Label: en
Matrix rounding with respect to small submatrices: Label: en
Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method: Label: en
Finding blocks and other patterns in a random coloring of ℤ: Label: en
On the random 2-stage minimum spanning tree: Label: en
On random ±1 matrices: Singularity and determinant: Label: en
Small cliques in random graphs: Label: en
Phase transition for Parking blocks, Brownian excursion and coalescence: Label: en
Asymptotic analysis of (3, 2, 1)-shell sort: Label: en
On the expected value of the minimum assignment: Label: en
Property testers for dense constraint satisfaction programs on finite domains: Label: en
The diameter of a long-range percolation graph: Label: en
Corrigendum: The complexity of counting graph homomorphisms: Label: en
Random walks on the torus with several generators: Label: en
The shape of large Galton-Watson trees with possibly infinite variance: Label: en
Simply generated trees, B-series and Wigner processes: Label: en
Random covering of an interval and a variation of Kingman's coalescent: Label: en
On the number of full levels in tries: Label: en
The transitive closure of a random digraph: Label: en
Randomized broadcast in networks: Label: en
Asymptotic analysis of a random walk on a hypercube with many dimensions: Label: en
Reversible coagulation-fragmentation processes and random combinatorial structures: Asymptotics for the number of groups: Label: en
Some bounds on the coupon collector problem: Label: en
The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees: Label: en
Is constraint satisfaction over two variables always easy?: Label: en
A system of grabbing particles related to Galton-Watson trees: Label: en
The mixing time of Glauber dynamics for coloring regular trees: Label: en
Asymptotic random graph intuition for the biased connectivity game: Label: en
Random graphs with forbidden vertex degrees: Label: en
Random majority percolation: Label: en
Merging percolation onZdand classical random graphs: Phase transition: Label: en
The second largest component in the supercritical 2D Hamming graph: Label: en
Asymptotic equivalence and contiguity of some random graphs: Label: en
Coloring H-free hypergraphs: Label: en
Bond percolation with attenuation in high dimensional VoronoiÌ tilings: Label: en
Analysis of Steiner subtrees of random trees for traceroute algorithms: Label: en
Longest convex chains: Label: en
When almost all sets are difference dominated: Label: en
On the girth of random Cayley graphs: Label: en
Equitable coloring of random graphs: Label: en
Dispersing hash functions: Label: en
Analysis of three graph parameters for random trees: Label: en
On systematic scan for sampling H-colorings of the path: Label: en
Linear lower bounds for δc(p) for a class of 2D self-destructive percolation models: Label: en