The transitive closure of a random digraph
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1019391
- scientific article; zbMATH DE number 992950
- Connectivities of random circulant digraphs
- scientific article; zbMATH DE number 4029600
- Random threshold digraphs
- A random fixed point theorem and the random graph transformation
- On the number of edges in the transitive closure of a graph
- On a generalization of transitivity for digraphs
- The critical behavior of random digraphs
- scientific article; zbMATH DE number 4110727
Cited in
(83)- When does the giant component bring unsatisfiability?
- An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
- An efficient transitive closure algorithm for cyclic digraphs
- Phase transition phenomena in random discrete structures
- Algorithms for transitive closure
- The bunkbed conjecture on the complete graph
- Computing transitive closure of bipolar weighted digraphs
- Directed cycles and related structures in random graphs. I: Static properties
- A remark on random 2-SAT
- Information integration from distributed threshold-based interactions
- Generating functions of some families of directed uniform hypergraphs
- Functional integration of ecological networks through pathway proliferation
- Note on directed proper connection number of a random graph
- Mean-field conditions for percolation on finite graphs
- The diameter of the directed configuration model
- A phase transition phenomenon in a random directed acyclic graph
- The scaling window of the 2-SAT transition
- Lengths of attractors and transients in neuronal networks with random connectivities
- Coloring graphs using two colors while avoiding monochromatic cycles
- Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs
- Improved bounds on induced acyclic subgraphs in random digraphs
- Small subgraphs in random distance graphs
- Boolean delay equations on networks in economics and the geosciences
- Counting strongly-connected, moderately sparse directed graphs
- The phase transition in random graphs: a simple proof
- The scaling window for a random graph with a given degree sequence
- Random deterministic automata
- A power law of order 1/4 for critical mean field Swendsen-Wang dynamics
- The critical behavior of random digraphs
- Critical percolation on random regular graphs
- On percolation and the bunkbed conjecture
- The Largest Component in Subcritical Inhomogeneous Random Graphs
- Average case analysis of fully dynamic reachability for directed graphs
- Asymptotic normality of the size of the giant component in a random hypergraph
- Birth of a strongly connected giant in an inhomogeneous random digraph
- Quasispecies dynamics on a network of interacting genotypes and idiotypes: formulation of the model
- On Random Ordering Constraints
- scientific article; zbMATH DE number 4156471 (Why is no real title available?)
- scientific article; zbMATH DE number 4156472 (Why is no real title available?)
- Combinatorial Problems for Horn Clauses
- scientific article; zbMATH DE number 3958732 (Why is no real title available?)
- scientific article; zbMATH DE number 1186727 (Why is no real title available?)
- The Evolution of Random Subgraphs of the Cube
- scientific article; zbMATH DE number 1019391 (Why is no real title available?)
- The phase transition in the uniformly grown random graph has infinite order
- scientific article; zbMATH DE number 813252 (Why is no real title available?)
- Component structure of the vacant set induced by a random walk on a random graph
- On random betweenness constraints
- Superspreaders and high variance infectious diseases
- The giant component of the directed configuration model revisited
- Phase transitions in graphs on orientable surfaces
- A classification of isomorphism-invariant random digraphs
- Birth of a giant \((k_{1},k_{2})\)-core in the random digraph
- Aggregation models with limited choice and the multiplicative coalescent
- Survey of scalings for the largest connected component in inhomogeneous random graphs
- Random models for evaluating efficient Büchi universality checking
- Гигантская компонента в случайных дистанционных графах специального вида
- The Hausdorff dimension of a class of random self-similar fractal trees
- Exploring hypergraphs with martingales
- Heterogeneity and superspreading effect on herd immunity
- The critical window in random digraphs
- Large deviations of the greedy independent set algorithm on sparse random graphs
- A scaling limit for the length of the longest cycle in a sparse random digraph
- Transitive closure in a polluted environment
- The scaling limit of a critical random directed graph
- Locality of random digraphs on expanders
- The birth of the strong components
- Exact enumeration of satisfiable 2-SAT formulae
- Improved baselines for causal structure learning on interventional data
- Average case analysis of fully dynamic connectivity for directed graphs
- On the largest component of the critical random digraph
- Low recourse arborescence forests under uniformly random arcs
- Efficient sampling strategies for relational database operations
- Parallel processing of graph reachability in databases
- Are giants in random digraphs `almost' local?
- On z-analogue of Stepanov-Lomonosov-Polesskii inequality
- Local weak limit of preferential attachment random trees with additive fitness
- Giant components in random temporal graphs
- Catalan percolation
- On the chromatic number of random triangle-free graphs
- Asymptotic normality of the size of the giant component via a random walk
- Phase transitions in dynamical random graphs
- The critical random graph, with martingales
This page was built for publication: The transitive closure of a random digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3197352)
