Random Graphs
From MaRDI portal
Publication:5555420
DOI10.1214/aoms/1177706098zbMath0168.40801OpenAlexW4252973173WikidataQ29027318 ScholiaQ29027318MaRDI QIDQ5555420
Publication date: 1959
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177706098
Related Items
Consensus dynamics on random rectangular graphs, ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH, On connectivity and robustness of random graphs with inhomogeneity, The Threshold of Symmetry in Random Graphs with Specified Degree Sequences, Percolation on spatial anisotropic networks*, Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization, Symmetric Graph Properties Have Independent Edges, A global optimization algorithm for target set selection problems, Random Simplicial Complexes: Models and Phenomena, A tutorial on methods for the modeling and analysis of social network data, Constructions of independent sets in random intersection graphs, Optimization in Designing Complex Communication Networks, A generalization of an inequality of Stepanov, Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs, Optimal control of aging in complex networks, Analyzing local and global properties of multigraphs, Information Dissipation in Random Quantum Networks, Connectivity of finite anisotropic random graphs and directed graphs, Maps on random hypergraphs and random simplicial complexes, Planarity and Genus of Sparse Random Bipartite Graphs, Integer Programming Formulations for Minimum Spanning Tree Interdiction, Monadic second-order properties of very sparse random graphs, Normal approximation for generalizedU-statistics and weighted random graphs, Giant descendant trees, matchings, and independent sets in age-biased attachment graphs, How Clustering Affects Epidemics in Random Networks, Power-law decay of the degree-sequence probabilities of multiple random graphs with application to graph isomorphism, Learning structures of Bayesian networks for variable groups, Comparing classical and quantum pageranks, Exponentially time decaying susceptible-informed (SIT) model for information diffusion process on networks, On resilience of connectivity in the evolution of random graphs, A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing, A large-deviations principle for all the components in a sparse inhomogeneous random graph, A graph complexity measure based on the spectral analysis of the Laplace operator, An Exact Method for the Minimum Feedback Arc Set Problem, Detection of core–periphery structure in networks using spectral methods and geodesic paths, Continuum limit of the nonlocal p-Laplacian evolution problem on random inhomogeneous graphs, Unnamed Item, Unnamed Item, Unnamed Item, The Threshold Probability for Long Cycles, Triangulations of Cayley and Tutte polytopes, Sieve methods in random graph theory, 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, The three kinds of degree distributions and nash equilibrium on the limiting random network, Self-awareness control effect of cooperative epidemics on complex networks, Unnamed Item, Bipartite quantum states and random complex networks, Perspectives on exponential random graphs, The degree sequence of a scale-free random graph process, Two Hardness Results on Feedback Vertex Sets, Exploring the “Middle Earth” of network spectra via a Gaussian matrix function, A Network‐based Analysis of the 1861 Hagelloch Measles Data, Statistical inference on random dot product graphs: a survey, BOOTSTRAP PERCOLATION ON RANDOM GEOMETRIC GRAPHS, Euler index of uncertain random graph: concepts and properties, Sieve methods in combinatorics, INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES, Maximum likelihood estimation for discrete exponential families and random graphs, Radio communication in random graphs, Distinguished vertices in probabilistic rooted graphs, CoReS: a tool for computing core graphs via SAT/SMT solvers, Rumor spreading in random evolving graphs, A web model with power law exponents less than 2, Efficient algorithms for cluster editing, Evolution of social networks, Topological variability of collectives and its import for social epistemology, Packet efficient implementation of the Omega failure detector, THE CORRELATION OF THE DEGREES OF BERNOULLI RANDOM GRAPHS, Universality for distances in power-law random graphs, Random matrices and graphs, Most graphs are knotted, Plane and planarity thresholds for random geometric graphs, A classification of isomorphism-invariant random digraphs, Expected Maximum Block Size in Critical Random Graphs, Construction of Directed Assortative Configuration Graphs, Modeling and Designing Real–World Networks, TheN-star network evolution model, Long paths and cycles in random subgraphs of graphs with large minimum degree, Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities, Lack of Hyperbolicity in Asymptotic Erdös–Renyi Sparse Random Graphs, A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter, On the Degree Sequence of an Evolving Random Graph Process and Its Critical Phenomenon, CENTRALITY ESTIMATION IN LARGE NETWORKS, CENTRALITY ESTIMATION IN LARGE NETWORKS, Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs, On Nice (1,1) Edge-Magic Graphs, Hybrid Metaheuristic for Bicluster Editing Problem, The Structure of an Outbreak on a College Campus, 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, Unnamed Item, Rate of Convergence to the Poisson Law of the Numbers of Cycles in the Generalized Random Graphs, Connectedness strength of two vertices in an uncertain graph, Study of discrete automaton models of gene networks of nonregular structure using symbolic calculations, Threshold function of ray nonsingularity for uniformly random ray pattern matrices, A multiscale network-based model of contagion dynamics: Heterogeneity, spatial distancing and vaccination, Statistical Network Analysis: A Review with Applications to the Coronavirus Disease 2019 Pandemic, Tempus volat, hora fugit: A survey of tie‐oriented dynamic network models in discrete and continuous time, Law of large numbers for Betti numbers of homogeneous and spatially independent random simplicial complexes, Algebraic and combinatorial expansion in random simplicial complexes, A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty, ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs, A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm, Network reliability: Heading out on the highway, Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs, On the time to identify the nodes in a random graph, Kolmogorov bounds for decomposable random variables and subgraph counting by the Stein-Tikhomirov method, Connected domination in random graphs, A combinatorial link between labelled graphs and increasingly labelled Schröder trees, Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas, Random hypergraphs, random simplicial complexes and their Künneth-type formulae, The birth of the strong components, Quantum encoding of dynamic directed graphs, Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials, Long paths in heterogeneous random subgraphs of graphs with large minimum degree, Anatomy of a Gaussian giant: supercritical level-sets of the free field on regular graphs, Asymptotic degree of random monomial ideals, A combinatorial branch and bound for the safe set problem, Girth, magnitude homology and phase transition of diagonality, Stochastic recursions on directed random graphs, The Erlang weighted tree, a new branching process, Networks beyond pairwise interactions: structure and dynamics, Age, innovations and time operator of networks, Investigating the relationship between \(k\)-core and \(s\)-core network decompositions, Phase transitions in discrete structures, Maximum likelihood analysis of the Ford-Fulkerson method on special graphs, Linking number and writhe in random linear embeddings of graphs, Minimum vertex cover in generalized random graphs with power law degree distribution, Dimension reduction in vertex-weighted exponential random graphs, Extreme events in dynamical systems and random walkers: a review, Symmetric graph properties have independent edges, Epidemics on plants: modeling long-range dispersal on spatially embedded networks, On solving manufacturing cell formation via bicluster editing, Coexistence of several currencies in presence of increasing returns to adoption, Unidirectional random growth with resetting, Uniform sampling of directed and undirected graphs conditional on vertex connectivity, Underestimated cost of targeted attacks on complex networks, Operation comfort of multistate system vs. the importance of its components, Local law and Tracy-Widom limit for sparse random matrices, The transmission process: a combinatorial stochastic process for the evolution of transmission trees over networks, A GRASP metaheuristic for microarray data analysis, Minimum distance estimators of population size from snowball samples using conditional estimation and scaling of exponential random graph models, Communication in markets. A suggested approach, Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős-Rényi graphs, A generalization of the Buckley-Osthus model for web graphs, New heuristics for the bicluster editing problem, Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs, Factorization of network reliability with perfect nodes. II: Connectivity matrix, Implementation of a unimodularity test, Classification and estimation in the stochastic blockmodel based on the empirical degrees, Searchability of central nodes in networks, Network routing in a dynamic environment, Geodesic cycles in random graphs, Euler index in uncertain graph, On the use of random graphs as null model of large connected networks, Large-scale network motif analysis using compression, Graph clustering, A recursive formula for the reliability of a \(r\)-uniform complete hypergraph and its applications, Failed disk recovery in double erasure RAID arrays, Distributed cooperative learning over time-varying random networks using a gossip-based communication protocol, Same stats, different graphs (graph statistics and why we need graph drawings), Exponential-family models of random graphs: inference in finite, super and infinite population scenarios, Characterisations and examples of graph classes with bounded expansion, On the radius of centrality in evolving communication networks, Herd behavior and financial crashes: an interacting particle system approach, PageRank on inhomogeneous random digraphs, The random connection model and functions of edge-marked Poisson processes: second order properties and normal approximation, PageRank's behavior under degree correlations, Transience and recurrence of random walks on percolation clusters in an ultrametric space, A motif building process for simulating random networks, Learning network structures from contagion, Small subgraphs in the trace of a random walk, Evolution of a modified binomial random graph by agglomeration, Statistical physics of vaccination, Bootstrap percolation in power-law random graphs, On distribution function of the diameter in uncertain graph, Sparse maximum-entropy random graphs with a given power-law degree distribution, Queues on a dynamically evolving graph, Incremental single-source shortest paths in digraphs with arbitrary positive arc weights, Uncertain vertex coloring problem, Second-order consensus protocols based on transformed \(d\)-path Laplacians, Generating directed networks with predetermined assortativity measures, Testing Linearity for Network Autoregressive Models, Asymptotics of integrals of Betti numbers for random simplicial complex processes, Synchronization by small time delays, 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, Simulating aggregates of bivalents in \(2n=40\) mouse meiotic spermatocytes through inhomogeneous site percolation processes, The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws, The biclique partitioning polytope, The expected linearity of a simple equivalence algorithm, Survey sampling in graphs, An uncertain chromatic number of an uncertain graph based on \(\alpha \)-cut coloring, Limit theorems for complete subgraphs of random graphs, The geometry of continuous latent space models for network data, Consistent structure estimation of exponential-family random graph models with block structure, Large random graphs in pseudo-metric spaces, A gentle introduction to deep learning for graphs, Modifying the network-based stochastic SEIR model to account for quarantine: an application to COVID-19, A note on coloring sparse random graphs, 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, Chip firing and all-terminal network reliability bounds, Best response dynamics on random graphs, Topological price of anarchy bounds for clustering games on networks, Clique-based method for social network clustering, Asymptotic connectedness of random interval graphs in a one dimensional data delivery problem, Uncertain multi-objective Chinese postman problem, An approximation algorithm for the maximum spectral subgraph problem, Tree and forest weights and their application to nonuniform random graphs, Phases of small worlds: a mean field formulation, The impact of geometry on monochrome regions in the flip Schelling process, Graph evolution by stochastic additions of points and lines, On the significance of edges for connectivity in uncertain random graphs, Analysis and synthesis problems for network resilience, Expansion in supercritical random subgraphs of the hypercube and its consequences, Constructing optimal ultrametrics