Random graphs: models and asymptotic characteristics
From MaRDI portal
Recommendations
Cited in
(67)- Asymptotic theory for the multidimensional random on-line nearest-neighbour graph
- A simple model of graphs
- Diameters of random distance graphs
- First order sentences about random graphs: small number of alternations
- Logical laws for existential monadic second-order sentences with infinite first-order parts
- Existential monadic second order logic of undirected graphs: the Le Bars conjecture is false
- On the distribution of the maximum k-degrees of the binomial random graph
- A disproof the Le Bars conjecture about the zero-one law for existential monadic second-order sentences
- Existential monadic second order convergence law fails on sparse random graphs
- \(\gamma\)-variable first-order logic of uniform attachment random graphs
- \( \gamma \)-variable first-order logic of preferential attachment random graphs
- Rare event asymptotics for exploration processes for random graphs
- Quantifier alternation in first-order formulas with infinite spectra
- The median of the number of simple paths on three vertices in the random graph
- Maximum sparse induced subgraphs of the binomial random graph with given number of edges
- On the convergence of probabilities of first-order sentences for recursive random graph models
- MSO 0-1 law for recursive random trees
- The size of a maximum subgraph of the random graph with a given number of edges
- Zero-one laws for \(k\)-variable first-order logic of sparse random graphs
- Infinite spectra of first-order properties for random hypergraphs
- Zero-one laws for sentences with \(k\) variables
- Spectra of short monadic sentences about sparse random graphs
- Monadic second-order properties of very sparse random graphs
- Spectra of first-order formulas with a low quantifier depth and a small number of quantifier alternations
- Disproof of the zero-one law for existential monadic properties of a sparse binomial random graph
- Limit points of spectra for first-order properties of random hypergraphs
- On limit points of spectra of the random graph first-order properties
- Bounded quantifier depth spectra for random graphs
- Random graphs, geometry and asymptotic structure
- Asymptotic equivalence and contiguity of some random graphs
- When does the zero-one k-law fail?
- Universal zero-one k-law
- scientific article; zbMATH DE number 3891422 (Why is no real title available?)
- Algebraic statistics for a directed random graph model with reciprocation
- Expectation and Variance of Self-assembled Graph Structures
- scientific article; zbMATH DE number 3917336 (Why is no real title available?)
- scientific article; zbMATH DE number 4072015 (Why is no real title available?)
- scientific article; zbMATH DE number 4105010 (Why is no real title available?)
- scientific article; zbMATH DE number 17680 (Why is no real title available?)
- Asymptotic distributions in random graphs with applications to social networks
- scientific article; zbMATH DE number 1222148 (Why is no real title available?)
- scientific article; zbMATH DE number 1342092 (Why is no real title available?)
- Properties of Classes of Random Graphs
- scientific article; zbMATH DE number 1775054 (Why is no real title available?)
- Short monadic second order sentences about sparse random graphs
- The random connection model: Connectivity, edge lengths, and degree distributions
- Small subgraphs and their extensions in a random distance graph
- First-order properties of bounded quantifier depth of very sparse random graphs
- Global Structural Properties of Random Graphs
- scientific article; zbMATH DE number 845673 (Why is no real title available?)
- scientific article; zbMATH DE number 863475 (Why is no real title available?)
- Logical complexity of induced subgraph isomorphism for certain families of graphs
- Logical laws for short existential monadic second-order sentences about graphs
- First-order zero-one law for the uniform model of the random graph
- First-order and monadic properties of highly sparse random graphs
- From heavy-tailed Boolean models to scale-free Gilbert graphs
- On the structure of classes of random graphs
- The strange logic of random graphs
- Bounded quantifier depth spectrum for random uniform hypergraphs
- Spectrum of FO logic with quantifier depth 4 is finite
- Maximum induced trees in sparse random graphs
- Maximum induced subgraphs of the binomial random graph
- On first-order definitions of subgraph isomorphism properties
- Logical convergence laws via stochastic approximation and Markov processes
- Johnson graphs, their random subgraphs, and some of their extremal characteristics
- On a 2-parameter class of scale free random graphs
- The Markov chain asymptotics of random mapping graphs
This page was built for publication: Random graphs: models and asymptotic characteristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262204)
