scientific article

Publication date: 26 September 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Random graphs (graph-theoretic aspects) (05C80) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05Cxx)

Related Items

On limit points of spectra of the random graph first-order properties, Separating OR, SUM, and XOR circuits, Waiter-Client and Client-Waiter planarity, colorability and minor games, On random subgraphs of Kneser and Schrijver graphs, The bondage number of random graphs, On large subgraphs with small chromatic numbers contained in distance graphs, Connectivity of soft random geometric graphs, Percolation with small clusters on random graphs, Sequential Monte Carlo for counting vertex covers in general graphs, Independence numbers of random subgraphs of a distance graph, On the path separation number of graphs, Micro- and macromodels of social networks. I: Theory fundamentals, Universal zero-one $k$-law, Independence numbers of random subgraphs of distance graphs, A new encoding of coalescent processes: applications to the additive and multiplicative cases, The transmission process: a combinatorial stochastic process for the evolution of transmission trees over networks, A GRASP metaheuristic for microarray data analysis, Bounding the $HL$-index of a graph: a majorization approach, Random cyclic dynamical systems, Unperturbed Schelling segregation in two or three dimensions, Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity, Extremal results for random discrete structures, The degree distribution of the random multigraphs, Infinite systems of interacting chains with memory of variable length -- a stochastic model for biological neural nets, On the singularity of random Bernoulli matrices -- novel integer partitions and lower bound expansions, Asymptotics for the size of the largest component scaled to ``$\log n$ in inhomogeneous random graphs, Functional limit theorems for random regular graphs, Interacting particle systems as stochastic social dynamics, A note on the von Neumann entropy of random graphs, Cops and robbers from a distance, Applications of Stein's method for concentration inequalities, Bootstrap percolation in living neural networks, Constant rate distributions on partially ordered sets, A loop-free shortest-path routing algorithm for dynamic networks, A supernodal formulation of vertex colouring with applications in course timetabling, The skew energy of random oriented graphs, Asymptotics and random sampling for BCI and BCK lambda terms, New bounds for the distance Ramsey number, On globally sparse Ramsey graphs, Average-case complexity of backtrack search for coloring sparse random graphs, Random graphs from a weighted minor-closed class, A note on the acquaintance time of random graphs, $k$-connectivity of uniform $s$-intersection graphs, On an anti-Ramsey threshold for random graphs, Clique versus independent set, Long paths and cycles in random subgraphs of $\mathcal{H}$-free graphs, On the number of orientations of random graphs with no directed cycles of a given length, On the hyperbolicity of random graphs, All normalized anti-monotonic overlap graph measures are bounded, Large graph limit for an SIR process in random network with heterogeneous connectivity, Computational algebraic algorithms for the reliability of generalized $k$-out-of-$n$ and related systems, On the complexity of the herding attack and some related attacks on hash functions, Random groups arising as graph products., Lack of Gromov-hyperbolicity in small-world networks, Mixing time of near-critical random graphs, Spreading of messages in random graphs, Limit laws for sums of independent random products: the lattice case, Conformally invariant scaling limits in planar critical percolation, On the uniformity of peer sampling based on view shuffling, Full connectivity: corners, edges and faces, Small components in $k$-nearest neighbour graphs, Frugal, acyclic and star colourings of graphs, How tight is the corner relaxation? Insights gained from the stable set problem, A latent process model for time series of attributed random graphs, Trapping of continuous-time quantum walks on Erdős-Rényi graphs, Randomly colouring graphs (a combinatorial view), The cook-book approach to the differential equation method, The minimal covering set in large tournaments, Realization of subgraphs of random graphs by graphs of diameters in Euclidean spaces, Intersections of random hypergraphs and tournaments, The component sizes of a critical random graph with given degree sequence, Target-synchronization of the distributed wireless sensor networks under the same sleeping-awaking method, Potential distribution on random electrical networks, A sharp threshold for a modified bootstrap percolation with recovery, Parsimonious flooding in dynamic graphs, MAX-plus objects to study the complexity of graphs, The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs, Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs, The road to deterministic matrices with the restricted isometry property, Distribution of coefficients of rank polynomials for random sparse graphs, Random Kneser graphs and hypergraphs, The asymptotic value of the zeroth-order Randić index and sum-connectivity index for trees, Poisson eigenvalue statistics for random Schrödinger operators on regular graphs, Reconstruction and estimation in the planted partition model, Client-waiter games on complete and random graphs, Majority bootstrap percolation on $G(n,p)$, Strong games played on random graphs, On the chromatic number of a random subgraph of the Kneser graph, On random subgraphs of Kneser graphs and their generalizations, First-order and monadic properties of highly sparse random graphs, The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs, Near-critical SIR epidemic on a random graph with given degrees, Recent advances in percolation theory and its applications, The complexity of partitioning into disjoint cliques and a triangle-free graph, The maximum and minimum degree of the random $r$-uniform $r$-partite hypergraphs, Phase transitions for modified Erdős--Rényi processes, On the isolated vertices and connectivity in random intersection graphs, The energy of random graphs, Relating multiway discrepancy and singular values of nonnegative rectangular matrices, The $(k,\ell)$-rainbow index of random graphs, Testing community structure for hypergraphs, Local maxima of the systole function, One-dimensional cellular automata with random rules: longest temporal period of a periodic solution, Null models and community detection in multi-layer networks, $K_{r,s}$ graph bootstrap percolation, Percolation on finite graphs and isoperimetric inequalities., SSE and SSD: page-efficient searchable symmetric encryption, Validity of Akbari's energy conjecture for threshold graphs, Catching homologies by geometric entropy, Relaxing the independence assumption in sequential posted pricing, prophet inequality, and random bipartite matching, Upper tails via high moments and entropic stability, Root finding algorithms and persistence of Jordan centrality in growing random trees, Universality for critical heavy-tailed network models: metric structure of maximal components, Detecting autocatalytic, self-sustaining sets in chemical reaction systems, A note on a conjecture of star chromatic index for outerplanar graphs, Quantifier alternation in first-order formulas with infinite spectra, General independence sets in random strongly sparse hypergraphs, The median of the number of simple paths on three vertices in the random graph, Dynamics in network interaction games, Normal approximations for discrete-time occupancy processes, The clustering coefficient and the diameter of small-world networks, Monte Carlo simulation and analytic approximation of epidemic processes on large networks, The average distance and the diameter of dense random regular graphs, On reversible cascades in scale-free and Erdős-Rényi random graphs, Comparing the strength of query types in property testing: the case of $k$-colorability, Exponential Chebyshev inequalities for random graphons and their applications, Stochastic coalescence in logarithmic time, Engineering a new algorithm for distributed shortest paths on dynamic networks, Contact processes on scale-free networks, Percolation on fitness landscapes: effects of correlation, phenotype, and incompatibilities, First passage percolation on random graphs with finite mean degrees, Ramsey numbers of path-matchings, covering designs, and 1-cores, Graphs with no induced $K_{2,t}$, Blowup Ramsey numbers, On-line size Ramsey number for monotone $k$-uniform ordered paths with uniform looseness, $\boldsymbol{borealis}$ -- a generalized global update algorithm for Boolean optimization problems, Thresholds versus fractional expectation-thresholds, The random connection model and functions of edge-marked Poisson processes: second order properties and normal approximation, Optimal subgraph structures in scale-free configuration models, PageRank's behavior under degree correlations, Preferential attachment without vertex growth: emergence of the giant component, Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions, Delocalization transition for critical Erdős-Rényi graphs, A weighted regularity lemma with applications, Weakly interacting particle systems on inhomogeneous random graphs, Faber approximation of the Mori-Zwanzig equation, A combinatorial Li-Yau inequality and rational points on curves, Power of $k$ choices and rainbow spanning trees in random graphs, In search of the densest subgraph, Counting matroids in minor-closed classes, Zero-one law for random distance graphs with vertices in $\{-1,0,1\}^n$, Burning graphs: a probabilistic perspective, The characteristics of cycle-nodes-ratio and its application to network classification, Cutoff for random walk on dynamical Erdős-Rényi graph, Metastability in stochastic replicator dynamics, Distance graphs with large chromatic number and without cliques of given size in the rational space, On threshold probability for the stability of independent sets in distance graphs, The normalized matching property in random and pseudorandom bipartite graphs, Adaptive estimation of nonparametric geometric graphs, Determining $r$- and $(r,s)$-robustness of digraphs using mixed integer linear programming, Recent progress in combinatorial random matrix theory, Persistence of hubs in growing random networks, Recent results of quantum ergodicity on graphs and further investigation, Stochastic block model in a new critical regime and the interacting multiplicative coalescent, Random-cluster dynamics on random regular graphs in tree uniqueness, Local algorithms for sparse spanning graphs, Power-law bounds for critical long-range percolation below the upper-critical dimension, Graphs with prescribed local neighborhoods of their universal coverings, Strong and weighted matchings in inhomogenous random graphs, Precise asymptotics of some meeting times arising from the voter model on large random regular graphs, Secretary problem: graphs, matroids and greedoids, New lower bounds on the size-Ramsey number of a path, Adaptive rewiring of random neural networks generates convergent-divergent units, The planted matching problem: phase transitions and exact results, Penalising transmission to hubs in scale-free spatial random graphs, The completely delocalized region of the Erdős-Rényi graph, The Myerson value on local structures of coalitions, Asymptotic connectedness of random interval graphs in a one dimensional data delivery problem, Interacting diffusions on random graphs with diverging average degrees: hydrodynamics and large deviations, Typicality and entropy of processes on infinite trees, Model-based clustering with sparse covariance matrices, A note on the warmth of random graphs with given expected degrees, Fast and memory-optimal dimension reduction using Kac's walk, On the double Roman domination of graphs, Escaping Braess's paradox through approximate Caratheodory's theorem, Permutations destroying arithmetic structure, Identifying influential spreaders in artificial complex networks, On the expected total number of infections for virus spread on a finite network, Lower bounds for boxicity, Tipping points in 1-dimensional Schelling models with switching agents, Large deviations for the largest eigenvalue of Gaussian networks with constant average degree, On large subgraphs of a distance graph which have small chromatic number, Counting phylogenetic networks, Expansion in supercritical random subgraphs of the hypercube and its consequences, Poisson statistics and localization at the spectral edge of sparse Erdős-Rényi graphs, Distance evolutions in growing preferential attachment graphs, The matching process and independent process in random regular graphs and hypergraphs, A triangle process on regular graphs, On asymptotic properties of Bell polynomials and concentration of vertex degree of large random graphs, Large degrees in scale-free inhomogeneous random graphs, Bootstrap percolation on the hypercube, Topology of random geometric complexes: a survey, Hermitian matrices and graphs: Singular values and discrepancy, On the likelihood of forests, Gambler's ruin problem on Erdős-Rényi graphs, Phase transitions in discrete structures, Random monomial ideals, Greedy can beat pure dynamic programming, Fundamentals of spreading processes in single and multilayer complex networks, On edge exchangeable random graphs, Limiting properties of random graph models with vertex and edge weights, Geometric representation of graphs in low dimension using axis parallel boxes, The sharp threshold for making squares, Vertices cannot be hidden from quantum spatial search for almost all random graphs, On the variational distance of two trees, Quenched invariance principle for simple random walk on percolation clusters, How unproportional must a graph be?, On comparing algorithms for the maximum clique problem, Note on the multicolour size-Ramsey number for paths, A hard dial-a-ride problem that is easy on average, Small subgraphs of random regular graphs, Explore and repair graphs with black holes using mobile entities, Random-player maker-breaker games, The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree, Random walks and diffusion on networks, Diameters of random distance graphs, On threshold probabilities for the realization of a random graph by a geometric graph, On the spectra of first-order language properties for random graphs, ILIGRA: an efficient inverse line graph algorithm, Monochromatic trees in random graphs, A transition of limiting distributions of large matchings in random graphs, On the chromatic number of random regular graphs, First order sentences about random graphs: small number of alternations, Proper connection number of random graphs, Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited, Online sum-paintability: the slow-coloring game, The configuration model for partially directed graphs, Matrix and discrepancy view of generalized random and quasirandom graphs, A graph for which the inertia bound is not tight, Logical laws for existential monadic second-order sentences with infinite first-order parts, On the stability of the independence number of a random subgraph, Efficient counting of degree sequences, Existential monadic second order logic of undirected graphs: the Le Bars conjecture is false, A rumor spreading model considering the cumulative effects of memory, Asymptotic normality of the $k$-core in random graphs, Tight fluctuations of weight-distances in random graphs with infinite-variance degrees, On the distribution of the maximum $k$-degrees of the binomial random graph, On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase, The largest component in a subcritical random graph with a power law degree distribution, Edge percolation on a random regular graph of low degree, A stochastic SIR network epidemic model with preventive dropping of edges, Reliability evaluation of a multicast over coded packet networks, Phase transition in inhomogenous Erdős-Rényi random graphs via tree counting, Transience and recurrence of random walks on percolation clusters in an ultrametric space, Critical random graphs and the differential equations technique, On subgraphs of random Cayley sum graphs, Further results on distance estrada index of random graphs, Embedding nearly-spanning bounded degree trees, Evolution of a modified binomial random graph by agglomeration, A moment-generating formula for Erdős-Rényi component sizes, Charting the replica symmetric phase, Improved random graph isomorphism, On connected diagrams and cumulants of Erdős-Rényi matrix models, Cluster tails for critical power-law inhomogeneous random graphs, The number of possibilities for random dating, Invasion fronts on graphs: the Fisher-KPP equation on homogeneous trees and Erdős-Réyni graphs, Universality for the distance in finite variance random graphs, Triadic closure in configuration models with unbounded degree fluctuations, Large deviations for the annealed Ising model on inhomogeneous random graphs: spins and degrees, Minority population in the one-dimensional Schelling model of segregation, The full replica symmetry breaking in the Ising spin glass on random regular graph, Novel scaling limits for critical inhomogeneous random graphs, Distance graphs with large chromatic numbers and small clique numbers, Diameters in preferential attachment models, Contact processes on random graphs with power law degree distributions have critical value 0, Continuum percolation with steps in an annulus, On the scaling of the chemical distance in long-range percolation models, Interval routing in reliability networks, The picker-chooser diameter game, How likely is an LLD degree sequence to be graphical?, Tracking analysis for general linearly coupled dynamical systems, Algebraic connectivity of interdependent networks, Spread of epidemic-like failures in telecommunication networks, Algebraic bounds for heterogeneous site percolation on directed and undirected graphs, Transforming a graph into a 1-balanced graph, Community detection in sparse networks via Grothendieck's inequality, On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces, The set of solutions of random XORSAT formulae, Large deviations of empirical neighborhood distribution in sparse random graphs, Predicting unobserved links in incompletely observed networks, Choosing from a large tournament, On a sequence of random distance graphs subject to the zero-one law, Two remarks on the Burr-Erdős conjecture, The asymptotic value of graph energy for random graphs with degree-based weights, On a parallel genetic-tabu search based algorithm for solving the graph colouring problem, Quantitative graph theory: a new branch of graph theory and network science, Random biochemical networks: the probability of self-sustaining autocatalysis, Threshold dominating cliques in random graphs and interval routing, Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers, On the singularity probability of discrete random matrices, Spectra of short monadic sentences about sparse random graphs, The rectangle covering number of random Boolean matrices, Energy landscape for large average submatrix detection problems in Gaussian random matrices, Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction, On the Hamiltonicity of random bipartite graphs, On a class of optimization problems with no ``efficiently computable solution, Threshold and hitting time for high-order connectedness in random hypergraphs, The total acquisition number of random graphs, A note on jointly modeling edges and node attributes of a network, Bernoulli trials of fixed parity, random and randomly oriented graphs, Fast canonical labeling of random subgraphs, Swarming on random graphs, On the number of circuits in random graphs, Calculation of minimal capacity vectors through $k$ minimal paths under budget and time constraints, Effective storage capacity of labeled graphs, Random Oxford graphs, Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them, Random Deterministic Automata, The (minimum) rank of typical fooling-set matrices, On the number of solutions in random hypergraph 2-colouring, Efficient random graph matching via degree profiles, Upper tails and independence polynomials in random graphs, How Clustering Affects Epidemics in Random Networks, Resolving Braess's paradox in random networks, Asynchronous rumor spreading on random graphs, The complexity of optimal design of temporally connected graphs, Corrigendum to: ``On the limiting distribution of the metric dimension for random forests, On the concentration of the chromatic number of a random hypergraph, Strategies for generating tree spanners: algorithms, heuristics and optimal graph classes, A Precise Threshold for Quasi-Ramsey Numbers, Independence number of graphs with a prescribed number of cliques, Network robustness depth and topology management of networked dynamic systems, Relationship between fragility and resilience in complex networks, Mechanism of investor behavior propagation in stock market, Distinct degrees and homogeneous sets, Impact of the malicious input data modification on the efficiency of quantum spatial search, Random assignment versus fixed assignment in multilevel importance splitting for estimating stochastic reach probabilities, Markovian online matching algorithms on large bipartite random graphs, Thresholds for virus spread on networks, The replicator equation in stochastic spatial evolutionary games, Near-linear convergence of the random Osborne algorithm for matrix balancing, The continuum limit of critical random graphs, Circular law theorem for random Markov matrices, The length of closed geodesics on random Riemann surfaces, The replica symmetric solution for orthogonally constrained Heisenberg model on Bethe lattice, A model for random three-manifolds, The concentration of the maximum degree in the duplication-divergence models, Leader election in well-connected graphs, Noise sensitivity of critical random graphs, Discussion about properties of first nearest neighbor graphs, Estimating and understanding exponential random graph models, A Gibbs sampler on the $n$-simplex, Statistical inference on attributed random graphs: fusion of graph features and content, Analysis of convergence rates of some Gibbs samplers on continuous state spaces, Global offensive alliances in graphs and random graphs, On a new cyclicity measure of graphs -- the global cyclicity index, Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract), The nonlinear heat equation on $W$-random graphs, Sharp vanishing thresholds for cohomology of random flag complexes, On hitting times for a simple random walk on dense Erdös-Rényi random graphs, Online balanced graph avoidance games, Two Hardness Results on Feedback Vertex Sets, Monotonicity, asymptotic normality and vertex degrees in random graphs, On the fundamental limits of topology control in ad hoc networks, The percolation signature of the spin glass transition, Unnamed Item, Unnamed Item, Bounds on the generalised acyclic chromatic numbers of bounded degree graphs, Lifshitz tails for spectra of Erdős-Rényi random graphs, Monotone properties of random geometric graphs have sharp thresholds, Stochastic processes in random graphs, The typical structure of sparse $K_{r+1}$-free graphs, Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms, Cubicity, degeneracy, and crossing number, The range of thresholds for diameter 2 in random Cayley graphs, Anatomy of the giant component: the strictly supercritical regime, Largest sparse subgraphs of random graphs, Community detection in dense random networks, Acquaintance Time of Random Graphs Near Connectivity Threshold, Colorings of partial Steiner systems and their applications, The strong giant in a random digraph, Critical epidemics, random graphs, and Brownian motion with a parabolic drift, The fundamental group of random 2-complexes, Phase Transitions in Discrete Structures, Turán-type results for complete $h$-partite graphs in comparability and incomparability graphs, The Role of Nonlinear Relapse on Contagion Amongst Drinking Communities, Small Subgraphs in Random Distance Graphs, Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates, A note on counting orientations, On an anti-Ramsey property of random graphs, A general critical condition for the emergence of a giant component in random graphs with given degrees, Random subgraphs of finite graphs. II: The lace expansion and the triangle condition, Extremal connectivity for topological cliques in bipartite graphs, The diameter of weighted random graphs, The acquaintance time of (percolated) random geometric graphs, New upper bound for the chromatic number of a random subgraph of a distance graph, On the number of components of fixed size in a random $A$-mapping, On the zero-one 4-law for the Erdős-Rényi random graphs, Degree distribution of shortest path trees and bias of network sampling algorithms, Joint Vertex Degrees in the Inhomogeneous Random Graph Model ℊ(n,{p_ij}), On extension of regular graphs, On Stable Systems with Random Structure, Исследование статистик графов ближайших соседей, Preferential attachment processes approaching the Rado multigraph, Rare Event Simulation Using Reversible Shaking Transformations, Analytical results for the distribution of cover times of random walks on random regular graphs, An elementary approach to component sizes in critical random graphs, Symmetric Graph Properties Have Independent Edges, Rainbow Connection of Random Regular Graphs, Elegantly Colored Paths and Cycles in Edge Colored Random Graphs, Lower and Upper Bounds for Random Mimimum Satisfiability Problem, Random Subgraphs in Sparse Graphs, Consensus Algorithm with Censored Data for Distributed Detection with Corrupted Measurements: A Game-Theoretic Approach, A survey of graph burning, Path-Fault-Tolerant Approximate Shortest-Path Trees, Some Introductory Notes on Random Graphs, Neural and Cognitive Modeling with Networks of Leaky Integrator Units, An Introduction to Temporal Graphs: An Algorithmic Perspective, Liquidity Shock, Animal Spirits and Bank Runs, Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs, Short Monadic Second Order Sentences about Sparse Random Graphs, The genus of the Erd\H{o}s-R\'enyi random graph and the fragile genus property, Small subgraphs and their extensions in a random distance graph, Power-law decay of the degree-sequence probabilities of multiple random graphs with application to graph isomorphism, Binomial subsampling, On Ramsey Type Problems in Combinatorial Geometry, The t-improper chromatic number of random graphs, Random Graphs, Retractions and Clique Graphs, Spreading Messages, Unnamed Item, Replica-symmetric approach to the typical eigenvalue fluctuations of Gaussian random matrices, The Construction and Properties of Assortative Configuration Graphs, First-order properties of bounded quantifier depth of very sparse random graphs, The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs, The Evolution of Random Graphs on Surfaces, Random perfect graphs, Lectures on the Ising and Potts Models on the Hypercubic Lattice, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Rank and Bollobás-Riordan polynomials: Coefficient measures and zeros, The existence of a giant cluster for percolation on large Crump–Mode–Jagers trees, Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝), Extremal Graphs with Local Covering Conditions, Stable Consensus Decision Making for Spatially Distributed Multiagent Systems with Multiple Leaders, Yard-Sale exchange on networks: wealth sharing and wealth appropriation, Circular coloring of random graphs: statistical physics investigation, Phase diagram and metastability of the Ising model on two coupled networks, Maximizing the Size of the Giant, Thermal inclusions: how one spin can destroy a many-body localized phase, Sentry Selection in Wireless Networks, Branching Process Approach for 2-Sat Thresholds, Connectivity of random k-nearest-neighbour graphs, Small-world graphs: characterization and alternative constructions, Nonuniversality of weighted random graphs with infinite variance degree, On the asymptotics of constrained exponential random graphs, Inhomogeneous random graphs, isolated vertices, and Poisson approximation, Spectral properties of the trap model on sparse networks, Unnamed Item, Combinatorial anti-concentration inequalities, with applications, Structure learning of Bayesian networks by continuous particle swarm optimization algorithms, The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛, Exponential Random Graphs as Models of Overlay Networks, A preferential attachment process approaching the Rado graph, Limiting eigenvalue distribution of random matrices of Ihara zeta function of long-range percolation graphs, Largest Components in Random Hypergraphs, An Average Case NP-complete Graph Colouring Problem, Enhancement of Signal Response in Complex Networks Induced by Topology and Noise, Structure learning in inverse Ising problems using ℓ ₂-regularized linear estimator, Random coxeter groups, Operator growth bounds in a cartoon matrix model, Short proofs of some extremal results III, The Kőnig graph process, Construction of Directed Assortative Configuration Graphs, Modeling and Designing Real–World Networks, Aspects of large random Markov kernels, Selected Combinatorial Properties of Random Intersection Graphs, Long paths and cycles in random subgraphs of graphs with large minimum degree, Toward Quantifying Vertex Similarity in Networks, Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees, Weak Balance in Random Signed Graphs, The Degree Distribution and the Number of Edges Between Nodes of given Degrees in Directed Scale-Free Graphs, A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter, The threshold for the square of a Hamilton cycle, The replica symmetric phase of random constraint satisfaction problems, Independent dominating sets in graphs of girth five, Hamiltonian Berge cycles in random hypergraphs, From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces, Covering 3-Edge-Colored Random Graphs with Monochromatic Trees, Controllability of Network Opinion in Erdös--Rényi Graphs Using Sparse Control Inputs, Random intersection graphs with communities, Maker-Breaker Games on Randomly Perturbed Graphs, Unnamed Item, Topology of random -dimensional cubical complexes, Eigenvalues of the non-backtracking operator detached from the bulk, Borsuk's problem and the chromatic numbers of metric spaces, Evolution of random graph processes with degree constraints, Low-Density Parity-Check Codes Achieve List-Decoding Capacity, Sofic homological invariants and the Weak Pinsker Property, Pure Nash Equilibria and Best-Response Dynamics in Random Games, Compressive Sensing for Cut Improvement and Local Clustering, On the Largest Common Subtree of Random Leaf-Labeled Binary Trees, The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes, On Induced Paths, Holes, and Trees in Random Graphs, Large complete minors in random subgraphs, Strong couplings for static locally tree-like random graphs, The mean and variance of the distribution of shortest path lengths of random regular graphs, A Comparative Study of Polynomial-Type Chaos Expansions for Indicator Functions, Bifurcations in synergistic epidemics on random regular graphs, A functional central limit theorem for SI processes on configuration model graphs, Analytical results for the distribution of first-passage times of random walks on random regular graphs, The random field XY model on sparse random graphs shows replica symmetry breaking and marginally stable ferromagnetism, Factor of IID Percolation on Trees, Spectral alignment of correlated Gaussian matrices, A note on the Screaming Toes game, Random transceiver networks, On the probability of the existence of fixed-size components in random geometric graphs, Planarity and Genus of Sparse Random Bipartite Graphs, A Dynamic Contagion Risk Model with Recovery Features, Giant descendant trees, matchings, and independent sets in age-biased attachment graphs, Unnamed Item, Spanning Trees at the Connectivity Threshold, EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs, On Two Limit Values of the Chromatic Number of a Random Hypergraph, On the Power of Choice for Boolean Functions, Perfect matchings in inhomogeneous random bipartite graphs in random environment, Unnamed Item, Persuasion in Networks: Public Signals and Cores, Seeding with Costly Network Information, Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations, The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘), Эволюционные уравнения и случайные графы, On some Multicolor Ramsey Properties of Random Graphs, Loose Hamilton Cycles in Regular Hypergraphs, The Random Graph Intuition for the Tournament Game, Logical laws for short existential monadic second-order sentences about graphs, The Persistence Landscape and Some of Its Properties, Activity maxima in random networks in the heavy tail case, First-order zero-one law for the uniform model of the random graph, Constructing Hard Examples for Graph Isomorphism, Subcritical Random Hypergraphs, High-Order Components, and Hypertrees, Asymptotics in percolation on high‐girth expanders, Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries, Glassy dynamics on networks: local spectra and return probabilities, Statistical properties of model kinship networks, Random-link matching problems on random regular graphs, Complex networks: when random walk dynamics equals synchronization, The Genus of a Random Bipartite Graph, Average-Case Analysis of Online Topological Ordering, First-Order Model-Checking in Random Graphs and Complex Networks, Non-concentration of the chromatic number of a random graph, Phase transition in random contingency tables with non-uniform margins, Avalanches in a short-memory excitable network, Ramsey Goodness of Clique Versus Paths in Random Graphs, Unnamed Item, Nishimori meets Bethe: a spectral method for node classification in sparse weighted graphs, Leader–follower consensus on activity-driven networks, Clustering and the Hyperbolic Geometry of Complex Networks, Topics of Stochastic Algebraic Topology, On the connectivity and diameter of small-world networks, Graphs with specified degree distributions, simple epidemics, and local vaccination strategies, Size Ramsey number of bipartite graphs and bipartite Ramanujan graphs, Percolation Hamiltonians, Central limit theorem for statistics of subcritical configuration models, DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS, Vertex Pursuit Games in Stochastic Network Models, Physicist’s approach to public transportation networks: between data processing and statistical physics, The probability of unusually large components in the near-critical Erdős–Rényi graph, Disparity of clustering coefficients in the Holme‒Kim network model, Generalized quasirandom properties of expanding graph sequences, Plane and planarity thresholds for random geometric graphs, On the Number of Solutions in Random Graphk-Colouring, Expected Maximum Block Size in Critical Random Graphs, On the Size-Ramsey Number of Cycles, Long Monotone Trails in Random Edge-Labellings of Random Graphs, Expansion of Percolation Critical Points for Hamming Graphs, Multiscale dynamics of an adaptive catalytic network, Unnamed Item, Weak limits for the largest subpopulations in Yule processes with high mutation probabilities, Rigid Colorings of Hypergraphs and Contiguity, Diffusion processes on small-world networks with distance dependent random links, Superboolean rank and the size of the largest triangular submatrix of a random matrix, Ferromagnetic Models for Cooperative Behavior: Revisiting Universality in Complex Phenomena, On the Concentration of the Domination Number of the Random Graph, The front of the epidemic spread and first passage percolation, The probability that a random multigraph is simple. II, On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$, The Size Ramsey Number of Graphs with Bounded Treewidth, The effects of evolutionary adaptations on spreading processes in complex networks, Explicit Near-Ramanujan Graphs of Every Degree, A Theory of Network Security: Principles of Natural Selection and Combinatorics, An Introduction to Temporal Graphs: An Algorithmic Perspective^*, The Phase Transition in Multitype Binomial Random Graphs, Unnamed Item, Unnamed Item, Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs, Imaginary replica analysis of loopy regular random graphs, Spectral theory of sparse non-Hermitian random matrices, Contact network models matching the dynamics of the COVID-19 spreading, The planted k-factor problem, Analytical results for the distribution of first return times of random walks on random regular graphs, Finite temperature quantum condensations in the space of states: general proof, On the size-Ramsey number of grid graphs, The power of two choices for random walks, Spectral gap in random bipartite biregular graphs and applications, Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems, Short proofs for long induced paths, On anti-stochastic properties of unlabeled graphs, A note on long cycles in sparse random graphs, On a problem of M. Talagrand, On the modularity of 3‐regular random graphs and random graphs with given degree sequences, Cycle lengths in sparse random graphs, A proof of the Kahn–Kalai conjecture, Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs, Multivariate generating functions for information spread on multi-type random graphs, Pinning control of social fairness in the ultimatum game, Upper tail for homomorphism counts in constrained sparse random graphs, Phase transition in random intersection graphs with communities, Longest and shortest cycles in random planar graphs, The asymptotic distribution of cluster sizes for supercritical percolation on random split trees, On the largest part size of low‐rank combinatorial assemblies, On the clique number of noisy random geometric graphs, Respondent-driven sampling on sparse Erdös-Rényi graphs, A Sum of Squares Characterization of Perfect Graphs, An accurate, scalable and verifiable protocol for federated differentially private averaging, $\boldsymbol{H}$-Games Played on Vertex Sets of Random Graphs, A central limit theorem for the mean starting hitting time for a random walk on a random graph, Causal Structural Learning via Local Graphs, Formalizing delayed adaptive corruptions and the security of flooding networks, On the minimum bisection of random 3-regular graphs, Connected domination in random graphs, Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication, A combinatorial link between labelled graphs and increasingly labelled Schröder trees, The probability of unusually large components for critical percolation on random $d$-regular graphs, The complexity of growing a graph, Necessary and sufficient conditions for exact closures of epidemic equations on configuration model networks, Contagion risks and security investment in directed networks, Two-Point Concentration of the Independence Number of the Random Graph, Approximate Bayesian Estimation of Parameters of an Agent-Based Model in Epidemiology, Sharp Thresholds in Random Simple Temporal Graphs, Practical provably secure flooding for blockchains, Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor, Convergence of measures after adding a real, On Ramsey Size-Linear Graphs and Related Questions, Statistics of Feynman amplitudes in $\phi^4$-theory, The communication complexity of functions with large outputs, Random geometric graph: some recent developments and perspectives, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, On the Gamma-Vector of Symmetric Edge Polytopes, Edge and pair queries-random graphs and complexity, Cycle Saturation in Random Graphs, Component behaviour and excess of random bipartite graphs near the critical point, Percolation of arbitrary uncorrelated nested subgraphs, Cramér distance and discretizations of circle expanding maps II: simulations, Asymptotic Absence of Poles of Ihara Zeta Function of Large Erdős–Rényi Random Graphs, Determinants of Laplacians on random hyperbolic surfaces, Girth, magnitude homology and phase transition of diagonality, Whom to trust in a signed network? Optimal solution and two heuristic rules, On the Concentration of the Maximum Degree in the Duplication-Divergence Models, Unnamed Item, Optimal path and cycle decompositions of dense quasirandom graphs, Unnamed Item, Symmetry in complex networks, Information and complexity in control systems: A tutorial, Combinatorial approach to the interpolation method and scaling limits in sparse random graphs, Simple and efficient local codes for distributed stable network construction, Strong noise sensitivity and random graphs, Packet efficient implementation of the Omega failure detector, The descriptive complexity of subgraph isomorphism without numerics, The order of the largest complete minor in a random graph