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
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, On the second eigenvalue of random bipartite biregular graphs, Statistics of finite degree covers of torus knot complements, Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\), Optimal linear‐Vizing relationships for (total) domination in graphs, The jamming constant of uniform random graphs, Spanning trees in random regular uniform hypergraphs, Partition expanders, Random lifts of graphs: Independence and chromatic number, Rainbow Connection of Random Regular Graphs, On the number of circuits in random graphs, Bounds on the bisection width for random \(d\)-regular graphs, The minimality of the Georges–Kelmans graph, Analyzing local and global properties of multigraphs, Almost all regular graphs are normal, Poisson approximation for non-backtracking random walks, Asymptotic bounds on total domination in regular graphs, The distinct roles of initial transmission and retransmission in the persistence of knowledge in complex networks, Maximum independent sets on random regular graphs, On the number of coloured triangulations of \(d\)-manifolds, Perfect fractional matchings in \(k\)-out hypergraphs, \(1/n\) expansion for the number of matchings on regular graphs and Monomer-Dimer entropy, Discrepancies of spanning trees and Hamilton cycles, On vertex-weighted realizations of acyclic and general graphs, Counting colorings of triangle-free graphs, The mesoscopic geometry of sparse random maps, On the modularity of 3‐regular random graphs and random graphs with given degree sequences, Reliable Spanners for Metric Spaces, Hamiltonicity of graphs perturbed by a random regular graph, The number of perfect matchings, and the nesting properties, of random regular graphs, Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs, On the almost eigenvectors of random regular graphs, Local Kesten-McKay law for random regular graphs, Graph realizations: maximum degree in vertex neighborhoods, On the minimum bisection of random 3-regular graphs, Triangles and subgraph probabilities in random regular graphs, On some Multicolor Ramsey Properties of Random Graphs, Statistics of Feynman amplitudes in \(\phi^4\)-theory, On tension-continuous mappings, Unnamed Item, Unnamed Item, Replica-symmetric approach to the typical eigenvalue fluctuations of Gaussian random matrices, Expander graphs and their applications, The length of closed geodesics on random Riemann surfaces, Loose Hamilton Cycles in Regular Hypergraphs, On the structure of random graphs with constant \(r\)-balls, A model for random three-manifolds, On the Method of Typical Bounded Differences, The Interpolation Method for Random Graphs with Prescribed Degrees, Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models, Random graphs with given vertex degrees and switchings, Unnamed Item, Subcritical Random Hypergraphs, High-Order Components, and Hypertrees, Random-link matching problems on random regular graphs, Lower bounds for sense of direction in regular graphs, The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime, The evolution of altruism in spatial threshold public goods games via an insurance mechanism, Random regular graphs of high degree, Emergence of the circle in a statistical model of random cubic graphs, Hamilton cycles in the union of random permutations, Exchangeable pairs, switchings, and random regular graphs, Maximizing algebraic connectivity for certain families of graphs, Cycle double covers and spanning minors. I, Random strongly regular graphs?, Hamiltonicity of random graphs produced by 2‐processes, The acyclic edge chromatic number of a random d‐regular graph is d + 1, Unnamed Item, Combinatorial approach to the interpolation method and scaling limits in sparse random graphs, Short cycle distribution in random regular graphs recursively generated by pegging, Anatomy of the giant component: the strictly supercritical regime, A family of \(m\)-ovoids of parabolic quadrics, Satisfiability threshold for random regular \textsc{nae-sat}, Infinite and Giant Components in the Layers Percolation Model, Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm, The circular law for random regular digraphs, Fast winning strategies in maker-breaker games, On Weisfeiler-Leman invariance: subgraph counts and related graph properties, Speeding up non-Markovian first-passage percolation with a few extra edges, Self-assembly of geometric space from random graphs, The descriptive complexity of subgraph isomorphism without numerics, On the Number of Solutions in Random Graphk-Colouring, Expanders with respect to Hadamard spaces and random graphs, MAX k‐CUT and approximating the chromatic number of random graphs, THE ASYMPTOTIC DISTRIBUTION OF THE NUMBER OF 3-STAR FACTORS IN RANDOM d-REGULAR GRAPHS, The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime, The probabilistic analysis of a greedy satisfiability algorithm, Small maximal matchings of random cubic graphs, Dirac’s theorem for random regular graphs, Directed random graphs with given degree distributions, Sampling \(k\)-partite graphs with a given degree sequence, Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results, Rainbow Hamilton cycles in random regular graphs, The generalized acyclic edge chromatic number of random regular graphs, The 2-dimensional rigidity of certain families of graphs, Explicit Near-Ramanujan Graphs of Every Degree, Book Embeddings of Regular Graphs, Imperfect bifurcations in opinion dynamics under external fields, Lower bounds for boxicity, Unnamed Item, Evolution of random graph processes with degree constraints, Hitting times for Shamir’s problem, Percolation on Random Graphs with a Fixed Degree Sequence, On local weak limit and subgraph counts for sparse random graphs, Critical percolation on random regular graphs
