Random graphs: models and asymptotic characteristics
From MaRDI portal
Publication:5262204
DOI10.1070/RM2015V070N01ABEH004936zbMATH Open1408.05116OpenAlexW2337348193MaRDI QIDQ5262204FDOQ5262204
Authors: M. E. Zhukovskii, Andrei M. Raigorodskii 
Publication date: 13 July 2015
Published in: Russian Mathematical Surveys (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/rm2015v070n01abeh004936
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Zero-one laws (60F20) Basic properties of first-order languages and structures (03C07)
Cited In (63)
- Bounded quantifier depth spectrum for random uniform hypergraphs
- Maximum induced trees in sparse random graphs
- Logical complexity of induced subgraph isomorphism for certain families of graphs
- Maximum induced subgraphs of the binomial random graph
- Spectrum of FO logic with quantifier depth 4 is finite
- Properties of Classes of Random Graphs
- On the distribution of the maximum \(k\)-degrees of the binomial random graph
- Short Monadic Second Order Sentences about Sparse Random Graphs
- Title not available (Why is that?)
- On limit points of spectra of the random graph first-order properties
- Bounded quantifier depth spectra for random graphs
- When does the zero-one \(k\)-law fail?
- Spectra of short monadic sentences about sparse random graphs
- A disproof the Le Bars conjecture about the zero-one law for existential monadic second-order sentences
- \(\gamma\)-variable first-order logic of uniform attachment random graphs
- Zero-one laws for sentences with \(k\) variables
- The strange logic of random graphs
- MSO 0-1 law for recursive random trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spectra of first-order formulas with a low quantifier depth and a small number of quantifier alternations
- Small subgraphs and their extensions in a random distance graph
- Existential monadic second order convergence law fails on sparse random graphs
- Maximum sparse induced subgraphs of the binomial random graph with given number of edges
- Title not available (Why is that?)
- Title not available (Why is that?)
- \( \gamma \)-variable first-order logic of preferential attachment random graphs
- Diameters of random distance graphs
- Title not available (Why is that?)
- Monadic second-order properties of very sparse random graphs
- On the convergence of probabilities of first-order sentences for recursive random graph models
- The random connection model: Connectivity, edge lengths, and degree distributions
- Title not available (Why is that?)
- The Markov chain asymptotics of random mapping graphs
- Asymptotic theory for the multidimensional random on-line nearest-neighbour graph
- Algebraic statistics for a directed random graph model with reciprocation
- Universal zero-one \(k\)-law
- Infinite spectra of first-order properties for random hypergraphs
- Title not available (Why is that?)
- On a 2-parameter class of scale free random graphs
- Logical laws for short existential monadic second-order sentences about graphs
- Limit points of spectra for first-order properties of random hypergraphs
- Asymptotic distributions in random graphs with applications to social networks
- First-order properties of bounded quantifier depth of very sparse random graphs
- Global Structural Properties of Random Graphs
- Asymptotic equivalence and contiguity of some random graphs
- Rare event asymptotics for exploration processes for random graphs
- A simple model of graphs
- First order sentences about random graphs: small number of alternations
- Quantifier alternation in first-order formulas with infinite spectra
- The median of the number of simple paths on three vertices in the random graph
- First-order zero-one law for the uniform model of the random graph
- The size of a maximum subgraph of the random graph with a given number of edges
- Title not available (Why is that?)
- First-order and monadic properties of highly sparse random graphs
- Disproof of the zero-one law for existential monadic properties of a sparse binomial random graph
- Zero-one laws for \(k\)-variable first-order logic of sparse random graphs
- Logical laws for existential monadic second-order sentences with infinite first-order parts
- From heavy-tailed Boolean models to scale-free Gilbert graphs
- Expectation and Variance of Self-assembled Graph Structures
- On first-order definitions of subgraph isomorphism properties
- Existential monadic second order logic of undirected graphs: the Le Bars conjecture is false
- Random graphs, geometry and asymptotic structure
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)
