scientific article; zbMATH DE number 1231233

Publication date: 8 December 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

random graphs linear equations random permutations probabilistic combinatorics graph evolution

Random graphs (graph-theoretic aspects) (05C80) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02)

Related Items (75)

Generalized Poisson--Dirichlet Distributions Based on the Dickman Subordinator ⋮ Coagulation Processes with Gibbsian Time Evolution ⋮ On large subgraphs with small chromatic numbers contained in distance graphs ⋮ Gibbs distributions for random partitions generated by a fragmentation process ⋮ Sizes of trees in a random forest and configuration graphs ⋮ Towards the fast scrambling conjecture ⋮ The topology and geometry of random square-tiled surfaces ⋮ Limit theorems for the number of points of a given set covered by a random linear subspace ⋮ Random matrices and codes for the erasure channel ⋮ On limit theorems for the generalised allocation scheme ⋮ On asymptotic expansions for the distributions of the number of cycles in a random permutation ⋮ Limit distributions of the number of cycles of given length in a random permutation with given number of cycles ⋮ Emergence of a giant component in a random permutation with given number of cycles ⋮ An improved affine equivalence algorithm for random permutations ⋮ Some classes of random mappings of finite sets and non-homogeneous branching processes ⋮ Smooth and sharp thresholds for random{k}-XOR-CNF satisfiability ⋮ Smooth and sharp thresholds for random{k}-XOR-CNF satisfiability ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Extrema of the Generalized Allocation Scheme Based on an $m$-Dependent Sequence ⋮ Spectral distributions of adjacency and Laplacian matrices of random graphs ⋮ Some limit theorems for the cell load in the generalized allocation scheme ⋮ The birth of the strong components ⋮ Number of cells containing a given number of particles in a generalized allocation scheme ⋮ On a surface formed by randomly gluing together polygonal discs ⋮ Random mappings with constraints on the cycle lengths ⋮ On some aspects of evolution of generalized allocation schemes ⋮ Tree components in random distance graphs of special form ⋮ The Satisfiability Threshold fork-XORSAT ⋮ On the number of isolated vertices in a growing random graph ⋮ Occupancy distributions arising in sampling from Gibbs-Poisson abundance models ⋮ Phase transition in the spanning-hyperforest model on complete hypergraphs ⋮ On the number of empty cells in the allocation scheme of indistinguishable particles ⋮ Asymptotics of the moments of the number of cycles of a random $A$-permutation ⋮ Random $A$-permutations and Brownian motion ⋮ Universality of the limit shape of convex lattice polygonal lines ⋮ On hitting times for a simple random walk on dense Erdös-Rényi random graphs ⋮ An exponential inequality and strong limit theorems for conditional expectations ⋮ Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit ⋮ The conditional maximum of Poisson random variables ⋮ Limit theorems for the logarithm of the order of a random $A$-mapping ⋮ Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof ⋮ Colorings of spaces, and random graphs ⋮ Limit Distributions of the Number of Vertices of a Given Degree in a Configuration Graph with Bounded Number of Edges ⋮ Clustering in coagulation-fragmentation processes, random combinatorial structures and additive number systems: Asymptotic formulae and limiting laws ⋮ Cycle detection algorithms and their applications ⋮ Asymptotic formula for a partition function of reversible coagulation-fragmentation processes ⋮ The distributions of the numbers of finite subgraphs in random nonhomogeneous hypergraphs ⋮ On the rate of convergence of the distribution of the number of cycles of given length in a random permutation with known number of cycles to the limit distributions ⋮ Random permutations: the general parametric model ⋮ On one characteristic of a random mapping with given number of cycles ⋮ On transition of distributions of sums of independent identically distributed random variables from one lattice to another in the generalised allocation scheme ⋮ Random combinatorial structures: the convergent case ⋮ Stochastic processes in random graphs ⋮ On the number of empty cells in a non-homogeneous allocation scheme ⋮ On the number of colored balls from a fixed set in a multi-color urn scheme without return ⋮ Size distribution of the largest component of a random $a$-mapping ⋮ Limit shapes of Gibbs distributions on the set of integer partitions: The expansive case ⋮ On the Order of Random Permutation with Cycle Weights ⋮ Small Subgraphs in Random Distance Graphs ⋮ On the minimum value of a cell from a pointed set of cells ⋮ On the maximal value of a cell from a pointed set of cells ⋮ Poisson limit theorems for number of given value cells in non-homogeneous generalized allocation scheme ⋮ Limit theorems for number of particles from a fixed set of cells ⋮ On the distribution of the mth maximal cycle lengths of random A-permutations ⋮ The limit distribution of the number of cyclic vertices in a random mapping in a special case ⋮ The joint distribution of the number of ones and the number of 1-runs in binary Markov sequences ⋮ Abelian Theorem for the Regularly Varying Measure and Its Density in Orthant ⋮ Interval-parameter optimization problems on graphs ⋮ On some limit properties for the power series distribution ⋮ On a Number of Components in a Random $A$-Mapping ⋮ Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems ⋮ The MALICIOUS framework: embedding backdoors into tweakable block ciphers ⋮ Sampling part sizes of random integer partitions ⋮ On the zero-one 4-law for the Erdős-Rényi random graphs

This page was built for publication: