scientific article; zbMATH DE number 1342092
From MaRDI portal
Publication:4263664
zbMath0935.05080MaRDI QIDQ4263664
Publication date: 26 April 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Related Items (only showing first 100 items - show all)
Testing community structure for hypergraphs ⋮ A likelihood-ratio type test for stochastic block models with bounded degrees ⋮ A formalism for evaluating analytically the cross-correlation structure of a firing-rate network model ⋮ Total domination in regular graphs ⋮ Bounds on the max and min bisection of random cubic and random 4-regular graphs ⋮ Random groups, random graphs and eigenvalues of \(p\)-Laplacians ⋮ Quantum ergodicity for quantum graphs without back-scattering ⋮ Sandwiching random graphs: universality between random graph models ⋮ Some remarks on rainbow connectivity ⋮ 3-star factors in random \(d\)-regular graphs ⋮ Random 4-regular graphs have 3-star decompositions asymptotically almost surely ⋮ On large deviation properties of Erdős-Rényi random graphs ⋮ Properties of atypical graphs from negative complexities ⋮ On degree anti-Ramsey numbers ⋮ Poisson-Dirichlet distribution for random Belyi surfaces ⋮ Finite covers of random 3-manifolds ⋮ Large deviation for uniform graphs with given degrees ⋮ Functional limit theorems for random regular graphs ⋮ Proof of the satisfiability conjecture for large \(k\) ⋮ A sequential algorithm for generating random graphs ⋮ Statistical limits of spiked tensor models ⋮ Small subgraphs of random regular graphs ⋮ On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \) ⋮ Cycles and eigenvalues of sequentially growing random regular graphs ⋮ Threshold functions for small subgraphs in simple graphs and multigraphs ⋮ On the number of spanning trees in random regular graphs ⋮ Threshold functions for small subgraphs: an analytic approach ⋮ On star decompositions of random regular graphs ⋮ General independence sets in random strongly sparse hypergraphs ⋮ Community detection in sparse random networks ⋮ Dense subgraphs in the \(H\)-free process ⋮ Cooperation in partly observable networked markets ⋮ Independence numbers of random sparse hypergraphs ⋮ \(H\)-colouring bipartite graphs ⋮ On dissemination thresholds in regular and irregular graph classes ⋮ Fighting constrained fires in graphs ⋮ Cores of random \(r\)-partite hypergraphs ⋮ Araneola: a scalable reliable multicast system for dynamic environments ⋮ Random graphs with a given degree sequence ⋮ Some topics in the dynamics of group actions on rooted trees. ⋮ Analysis of greedy algorithms on graphs with bounded degrees ⋮ Perfect matchings as IID factors on non-amenable groups ⋮ Outer-totalistic cellular automata on graphs ⋮ Hamiltonian decompositions of random bipartite regular graphs. ⋮ The flip Markov chain for connected regular graphs ⋮ Expansion properties of a random regular graph after random vertex deletions ⋮ Dynamic monopolies with randomized starting configuration ⋮ The cook-book approach to the differential equation method ⋮ Cleaning random \(d\)-regular graphs with brooms ⋮ The spectral gap of dense random regular graphs ⋮ The weak limit of Ising models on locally tree-like graphs ⋮ Rejection sampling of bipartite graphs with given degree sequence ⋮ Reconstruction and estimation in the planted partition model ⋮ Expansion of random graphs: new proofs, new results ⋮ \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph ⋮ A threshold result for loose Hamiltonicity in random regular uniform hypergraphs ⋮ Randomly twisted hypercubes ⋮ On the singularity of adjacency matrices for random regular digraphs ⋮ Random cubic planar graphs revisited ⋮ Size biased couplings and the spectral gap for random regular graphs ⋮ How to determine if a random graph with a fixed degree sequence has a giant component ⋮ Clique partitions of complements of forests and bounded degree graphs ⋮ Contiguity and non-reconstruction results for planted partition models: the dense case ⋮ Size-Ramsey numbers of cycles versus a path ⋮ On cycle lengths in claw-free graphs with complete closure ⋮ Review mechanism promotes knowledge transmission in complex networks ⋮ Random cubic graphs are not homomorphic to the cycle of size 7 ⋮ Spectra of lifted Ramanujan graphs ⋮ Cutoff phenomena for random walks on random regular graphs ⋮ Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs ⋮ On the unbalanced cut problem and the generalized Sherrington-Kirkpatrick model ⋮ Injective edge-coloring of graphs with given maximum degree ⋮ On the chromatic number of the preferential attachment graph ⋮ Induced subgraph in random regular graph ⋮ Recent progress in combinatorial random matrix theory ⋮ Vertex percolation on expander graphs ⋮ Optimality and sub-optimality of PCA. I: Spiked random matrix models ⋮ On the robustness of random \(k\)-cores ⋮ Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly ⋮ Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem ⋮ The set of solutions of random XORSAT formulae ⋮ Large deviations of empirical neighborhood distribution in sparse random graphs ⋮ On the hardness of sampling independent sets beyond the tree threshold ⋮ Connected domination of regular graphs ⋮ On the computational tractability of statistical estimation on amenable graphs ⋮ Spectral density of equitable core-periphery graphs ⋮ Limits of sparse configuration models and beyond: graphexes and multigraphexes ⋮ On the chromatic number of random \(d\)-regular graphs ⋮ Random regular graphs of non-constant degree: concentration of the chromatic number ⋮ The evolution of the min-min random graph process ⋮ Sparse SYK and traversable wormholes ⋮ Typicality and entropy of processes on infinite trees ⋮ Sandwiching dense random regular graphs between binomial random graphs ⋮ Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs ⋮ Regular graphs with no homomorphisms onto cycles ⋮ The matching process and independent process in random regular graphs and hypergraphs ⋮ Relaxed and approximate graph realizations ⋮ A triangle process on regular graphs ⋮ Asymptotic enumeration of sparse graphs with a minimum degree constraint ⋮ Maximum induced matchings of random cubic graphs
This page was built for publication:
