Random Graphs
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A note on coloring sparse random graphs
- Chip firing and all-terminal network reliability bounds
- Graph evolution by stochastic additions of points and lines
- The expected linearity of a simple equivalence algorithm
- Survey sampling in graphs
- Limit theorems for complete subgraphs of random graphs
- Tree and forest weights and their application to nonuniform random graphs
- Analysis and synthesis problems for network resilience
- Constructing optimal ultrametrics
- Age, innovations and time operator of networks
- Investigating the relationship between k-core and s-core network decompositions
- Phase transitions in discrete structures
- Symmetric graph properties have independent edges
- Epidemics on plants: modeling long-range dispersal on spatially embedded networks
- Underestimated cost of targeted attacks on complex networks
- Local law and Tracy-Widom limit for sparse random matrices
- Minimum distance estimators of population size from snowball samples using conditional estimation and scaling of exponential random graph models
- New heuristics for the bicluster editing problem
- Geodesic cycles in random graphs
- A recursive formula for the reliability of a r-uniform complete hypergraph and its applications
- Same stats, different graphs (graph statistics and why we need graph drawings)
- Transience and recurrence of random walks on percolation clusters in an ultrametric space
- Evolution of a modified binomial random graph by agglomeration
- Sparse maximum-entropy random graphs with a given power-law degree distribution
- Queues on a dynamically evolving graph
- Random planar graphs
- Synchronization by small time delays
- Simulating aggregates of bivalents in \(2n=40\) mouse meiotic spermatocytes through inhomogeneous site percolation processes
- An uncertain chromatic number of an uncertain graph based on -cut coloring
- On the evolution of islands
- Implementation of a unimodularity test
- Classification and estimation in the stochastic blockmodel based on the empirical degrees
- Searchability of central nodes in networks
- PageRank on inhomogeneous random digraphs
- Uncertain vertex coloring problem
- Second-order consensus protocols based on transformed \(d\)-path Laplacians
- Asymptotics of integrals of Betti numbers for random simplicial complex processes
- The biclique partitioning polytope
- A gentle introduction to deep learning for graphs
- Modifying the network-based stochastic SEIR model to account for quarantine: an application to COVID-19
- Large cycles in random generalized Johnson graphs
- The relative fit measure for evaluating a blockmodel
- Information propagation in stochastic networks
- Phase transitions and percolation at criticality in enhanced random connection models
- In defense of the indefensible: a very naïve approach to high-dimensional inference
- Public health interventions in the face of pandemics: network structure, social distancing, and heterogeneity
- Best response dynamics on random graphs
- Asymptotic connectedness of random interval graphs in a one dimensional data delivery problem
- An approximation algorithm for the maximum spectral subgraph problem
- Phases of small worlds: a mean field formulation
- The impact of geometry on monochrome regions in the flip Schelling process
- On the significance of edges for connectivity in uncertain random graphs
- Expansion in supercritical random subgraphs of the hypercube and its consequences
- Dimension reduction in vertex-weighted exponential random graphs
- Extreme events in dynamical systems and random walkers: a review
- Coexistence of several currencies in presence of increasing returns to adoption
- Unidirectional random growth with resetting
- Operation comfort of multistate system vs. the importance of its components
- Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős-Rényi graphs
- On the use of random graphs as null model of large connected networks
- Large-scale network motif analysis using compression
- Distributed cooperative learning over time-varying random networks using a gossip-based communication protocol
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- The random connection model and functions of edge-marked Poisson processes: second order properties and normal approximation
- PageRank's behavior under degree correlations
- A motif building process for simulating random networks
- Bootstrap percolation in power-law random graphs
- Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting
- Note on directed proper connection number of a random graph
- The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws
- The geometry of continuous latent space models for network data
- Consistent structure estimation of exponential-family random graph models with block structure
- The graph spectra and spectral moments of random graphs
- Asymptotic behavior of lifetime sums for random simplicial complex processes
- Fast computation of von Neumann entropy for large-scale graphs via quadratic approximations
- Consensus dynamics on random rectangular graphs
- Random threshold graphs
- Random Oxford graphs
- Monadic second-order properties of very sparse random graphs
- Learning structures of Bayesian networks for variable groups
- Comparing classical and quantum pageranks
- On resilience of connectivity in the evolution of random graphs
- Triangulations of Cayley and Tutte polytopes
- On the number of isolated vertices in a growing random graph
- Model-based clustering of large networks
- Statistical inference on attributed random graphs: fusion of graph features and content
- Sieve methods in combinatorics
- Radio communication in random graphs
- A web model with power law exponents less than 2
- Evolution of social networks
- Topological variability of collectives and its import for social epistemology
- Random matrices and graphs
- A global optimization algorithm for target set selection problems
- A tutorial on methods for the modeling and analysis of social network data
- Constructions of independent sets in random intersection graphs
- A generalization of an inequality of Stepanov
- A graph complexity measure based on the spectral analysis of the Laplace operator
- Sieve methods in random graph theory
- Random graphs.
- The degree sequence of a scale-free random graph process
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)
