Random Graphs
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Phase transitions and percolation at criticality in enhanced random connection models
- Comparing classical and quantum pageranks
- Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős-Rényi graphs
- Monadic second-order properties of very sparse random graphs
- Asymptotics of integrals of Betti numbers for random simplicial complex processes
- The threshold probability for long cycles
- Queues on a dynamically evolving graph
- Sparse maximum-entropy random graphs with a given power-law degree distribution
- Sieve methods in combinatorics
- Self-awareness control effect of cooperative epidemics on complex networks
- Analyzing local and global properties of multigraphs
- Study of discrete automaton models of gene networks of nonregular structure using symbolic calculations
- Minimum vertex cover in generalized random graphs with power law degree distribution
- Expected Maximum Block Size in Critical Random Graphs
- Asymptotic degree of random monomial ideals
- Limit theorems for complete subgraphs of random graphs
- On Nice \((1,1)\) edge-magic graphs
- Symmetric graph properties have independent edges
- Underestimated cost of targeted attacks on complex networks
- Dimension reduction in vertex-weighted exponential random graphs
- Extreme events in dynamical systems and random walkers: a review
- Lower and upper bounds on graph communicabilities
- scientific article; zbMATH DE number 15665 (Why is no real title available?)
- Tree and forest weights and their application to nonuniform random graphs
- Consistent structure estimation of exponential-family random graph models with block structure
- scientific article; zbMATH DE number 5942363 (Why is no real title available?)
- Euler index in uncertain graph
- Long paths in heterogeneous random subgraphs of graphs with large minimum degree
- Goodness-of-fit testing based on graph functionals for homogeneous Erdős-Rényi graphs
- Constructions of independent sets in random intersection graphs
- A random-line-graph approach to overlapping line segments
- Normal approximation for generalized \(U\)-statistics and weighted random graphs
- Coin-flipping, Ball-dropping, and Grass-hopping for generating random graphs from matrices of edge probabilities
- Note on directed proper connection number of a random graph
- A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm
- An approximation algorithm for the maximum spectral subgraph problem
- Connected domination in random graphs
- Construction of directed assortative configuration graphs
- Coexistence of several currencies in presence of increasing returns to adoption
- The Threshold of Symmetry in Random Graphs with Specified Degree Sequences
- Near-linear runtime for a classical matrix preconditioning algorithm
- The biclique partitioning polytope
- Analysis and synthesis problems for network resilience
- Symmetric graph properties have independent edges
- A global optimization algorithm for target set selection problems
- A classification of isomorphism-invariant random digraphs
- On the number of crossings in a random labeled tree
- Girth, magnitude homology and phase transition of diagonality
- Stochastic recursions on directed random graphs
- Universal insulating-to-metallic crossover in tight-binding random geometric graphs
- scientific article; zbMATH DE number 3943863 (Why is no real title available?)
- Detection of core-periphery structure in networks using spectral methods and geodesic paths
- On solving manufacturing cell formation via bicluster editing
- Uniform sampling of directed and undirected graphs conditional on vertex connectivity
- Operation comfort of multistate system vs. the importance of its components
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
- Tempus volat, hora fugit: A survey of tie‐oriented dynamic network models in discrete and continuous time
- Uncertain vertex coloring problem
- Taming vagueness: the philosophy of network science
- The correlation of the degrees of Bernoulli random graphs
- Random planar graphs
- Statistical inference on random dot product graphs: a survey
- Minimum distance estimators of population size from snowball samples using conditional estimation and scaling of exponential random graph models
- Characterization of the asymptotic behaviour of U-statistics on row-column exchangeable matrices
- Constructing optimal ultrametrics
- The expected linearity of a simple equivalence algorithm
- The graph spectra and spectral moments of random graphs
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials
- Kolmogorov bounds for decomposable random variables and subgraph counting by the Stein-Tikhomirov method
- Superlogarithmic cliques in dense inhomogeneous random graphs
- Edge universality of sparse random matrices
- Evolution of a modified binomial random graph by agglomeration
- Factorization of network reliability with perfect nodes. II: Connectivity matrix
- Random threshold graphs
- The transmission process: a combinatorial stochastic process for the evolution of transmission trees over networks
- A GRASP metaheuristic for microarray data analysis
- Anatomy of a Gaussian giant: supercritical level-sets of the free field on regular graphs
- Simulating aggregates of bivalents in \(2n=40\) mouse meiotic spermatocytes through inhomogeneous site percolation processes
- Consensus dynamics on random rectangular graphs
- Connected components and evolution of random graphs: An algebraic approach
- Lack of hyperbolicity in asymptotic Erdős-Renyi sparse random graphs
- Multiplex Depth for Network-Valued Data and Applications
- scientific article; zbMATH DE number 3904623 (Why is no real title available?)
- An exact method for the minimum feedback arc set problem
- Information propagation in stochastic networks
- Thresholds for patterns in random permutations with a given number of inversions
- A generalization of an inequality of Stepanov
- Random Oxford graphs
- A gentle introduction to deep learning for graphs
- A combinatorial branch and bound for the safe set problem
- Normal to Poisson phase transition for subgraph counting in the random-connection model
- The degree sequence of a scale-free random graph process
- Insights into (k,)-shortcutting algorithms
- An uncertain chromatic number of an uncertain graph based on -cut coloring
- Generating directed networks with predetermined assortativity measures
- Geodesic cycles in random graphs
- Random interval graphs
- The Erlang weighted tree, a new branching process
- In defense of the indefensible: a very naïve approach to high-dimensional inference
- On -Forman-Ricci curvature of networks
This page was built for publication: Random Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5555420)
