Random Graphs and Complex Networks
From MaRDI portal
Publication:2833172
DOI10.1017/9781316779422zbMath1361.05002OpenAlexW2290127356MaRDI QIDQ2833172
Publication date: 17 November 2016
Full work available at URL: https://doi.org/10.1017/9781316779422
Random graphs (graph-theoretic aspects) (05C80) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Analytic circuit theory (94C05) Random walks on graphs (05C81)
Related Items
Graph distances in scale-free percolation: the logarithmic case, Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs, Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems, The partial duplication random graph with edge deletion, Existence of absolutely continuous spectrum for Galton-Watson random trees, Fluctuations and precise deviations of cumulative INAR time series, Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves, Limit theorems for the maximal tree size of a Galton-Watson forest in the critical case, Local limits of spatial inhomogeneous random graphs, Marginal dynamics of interacting diffusions on unimodular Galton-Watson trees, On Bollobás‐Riordan random pairing model of preferential attachment graph, Phase transition in random intersection graphs with communities, Voter models on subcritical scale‐free random graphs, MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023, Clustering and percolation on superpositions of Bernoulli random graphs, Respondent-driven sampling on sparse Erdös-Rényi graphs, A central limit theorem for the mean starting hitting time for a random walk on a random graph, Cutoff for rewiring dynamics on perfect matchings, Local weak convergence for sparse networks of interacting processes, A continuous-time network evolution model describing 3-interactions, The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses, Necessary and sufficient conditions for exact closures of epidemic equations on configuration model networks, Contagion risks and security investment in directed networks, Locality of random digraphs on expanders, The birth of the strong components, Scaling of the clustering function in spatial inhomogeneous random graphs, A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees, Convergence in total variation for nonlinear functionals of random hyperspherical harmonics, An algorithm of the prey and predator struggle to survive as a random walk simulation case study, The chemical distance in random interlacements in the low-intensity regime, On connectivity of conditional configuration graphs under destruction, Degree distributions in recursive trees with fitnesses, Stable graphs: distributions and line-breaking construction, On the Number of Trees of a Given Size in a Galton--Watson Forest in the Critical Case, Unnamed Item, Fluctuation bounds for continuous time branching processes and evolution of growing trees with a change point, Dense multigraphon-valued stochastic processes and edge-changing dynamics in the configuration model, Exploring Endless Space, Analyticity Results in Bernoulli Percolation, Propagation Reversal for Bistable Differential Equations on Trees, Scale-free graphs with many edges, Large deviations for the greedy exploration process on configuration models, Edge ideals of Erdős-Rényi random graphs: linear resolution, unmixedness and regularity, On mean-field super-Brownian motions, Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes, Critical Window for Connectivity in the Configuration Model, Uniform Entropy Scalings of Filtrations, Asymptotics in percolation on high‐girth expanders, Unnamed Item, Order optimal information spreading using algebraic gossip, Diameter in ultra‐small scale‐free random graphs, Chain-referral sampling on stochastic block models, Growth of common friends in a preferential attachment model, The idemetric property: when most distances are (almost) the same, How rare are power-law networks really?, Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size, Asymptotic normality of degree counts in a preferential attachment model, The spread of fire on a random multigraph, Subgraphs in preferential attachment models, Speeding up non-Markovian first-passage percolation with a few extra edges, Disparity of clustering coefficients in the Holme‒Kim network model, Fluctuations in a general preferential attachment model via Stein's method, Expansion of Percolation Critical Points for Hamming Graphs, TheN-star network evolution model, First passage percolation on sparse random graphs with boundary weights, Joint degree distributions of preferential attachment random graphs, Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs, Degree correlations in scale-free random graph models, Trajectories in random minimal transposition factorizations, Component structure of the configuration model: Barely supercritical case, The front of the epidemic spread and first passage percolation, Spectra of adjacency and Laplacian matrices of inhomogeneous Erdős–Rényi random graphs, Dynamical fitness models: evidence of universality classes for preferential attachment graphs, The jamming constant of uniform random graphs, Strong couplings for static locally tree-like random graphs, Ultra-Fast Load Balancing on Scale-Free Networks, SMALL-WORLD EFFECT IN GEOGRAPHICAL ATTACHMENT NETWORKS, A Comparative Study of Polynomial-Type Chaos Expansions for Indicator Functions, Measuring reciprocity in a directed preferential attachment network, A functional central limit theorem for SI processes on configuration model graphs, Scale-free network clustering in hyperbolic and other random graphs, A SPECTRUM OF SERIES–PARALLEL GRAPHS WITH MULTIPLE EDGE EVOLUTION, Control of Interbank Contagion Under Partial Information, Mean Field at Distance One, From trees to graphs: collapsing continuous-time branching processes, Large communities in a scale-free network, On the minimal diameter of closed hyperbolic surfaces, Large deviations for empirical measures of generalized random graphs, Critical value asymptotics for the contact process on random graphs, Mixing time of the switch Markov chain and stable degree sequences, Root finding algorithms and persistence of Jordan centrality in growing random trees, Critical percolation on scale-free random graphs: new universality class for the configuration model, Giant descendant trees, matchings, and independent sets in age-biased attachment graphs, Influence of the seed in affine preferential attachment trees, On the continuous-time limit of the Barabási-Albert random graph, Spectral properties for the Laplacian of a generalized Wigner matrix, Local weak convergence for PageRank, PageRank in Scale-Free Random Graphs, Floodings of metric graphs, Scalable Load Balancing in Networked Systems: A Survey of Recent Advances, Fast mixing via polymers for random graphs with unbounded degree, Universality for critical heavy-tailed network models: metric structure of maximal components, Red light green light method for solving large Markov chains, Asymptotics for cliques in scale-free random graphs, Consistency of Hill estimators in a linear preferential attachment model, Persistence of sums of correlated increments and clustering in cellular automata, Threshold functions for small subgraphs in simple graphs and multigraphs, Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations, Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs, Complex Contagions on Configuration Model Graphs with a Power-Law Degree Distribution, The diameter of the directed configuration model, A central limit theorem for diffusion in sparse random graphs, Ensemble nonequivalence in random graphs with modular structure, Long paths in first passage percolation on the complete graph. I: Local PWIT dynamics, On the independence number of some random trees, First Order Probabilities for Galton–Watson Trees, Long paths in first passage percolation on the complete graph II. Global branching dynamics, Random graphs with given vertex degrees and switchings, Random Graphs and Their Subgraphs, Towards degree distribution of a duplication-divergence graph model, Probabilistic Partial Set Covering with an Oracle for Chance Constraints, Preferential attachment random graphs with edge-step functions, KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation, Epidemics on a weighted network with tunable degree-degree correlation, On hitting times for a simple random walk on dense Erdös-Rényi random graphs, Heavy-tailed configuration models at criticality, Line Percolation in Finite Projective Planes, 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, Preferential attachment without vertex growth: emergence of the giant component, Central limit theorems for SIR epidemics and percolation on configuration model random graphs, Bootstrap percolation in power-law random graphs, Quick Detection of Nodes with Large Degrees, Critical random forests, Hitting times, commute times, and cover times for random walks on random hypergraphs, Random walks on dynamic configuration models: a trichotomy, A version of Herbert A. Simon's model with slowly fading memory and its connections to branching processes, Cliques in rank-1 random graphs: the role of inhomogeneity, Local law and complete eigenvector delocalization for supercritical Erdős-Rényi graphs, Two limit theorems for the high-dimensional two-stage contact process, Metastability of the contact process on fast evolving scale-free networks, Search for an immobile hider on a stochastic network, Marketing in a Random Network, Degree growth rates and index estimation in a directed preferential attachment model, Estimation of local degree distributions via local weighted averaging and Monte Carlo cross-validation, Unnamed Item, Scale-free percolation in continuous space: quenched degree and clustering coefficient, Size of the largest component in a critical graph, Crossing a fitness valley as a metastable transition in a stochastic population model, Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs, Are extreme value estimation methods useful for network data?, Managing Default Contagion in Inhomogeneous Financial Networks, Birds of a feather or opposites attract - effects in network modelling, Construction of Directed Assortative Configuration Graphs, Metastability for the contact process on the preferential attachment graph, Typical distances in a geometric model for complex networks, Limit laws for the number of triangles in the generalized random graphs with random node weights, From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial), Bootstrap percolation in directed inhomogeneous random graphs, Mixing time of vertex-weighted exponential random graphs, The replica symmetric phase of random constraint satisfaction problems, Networks of reinforced stochastic processes: asymptotics for the empirical means, Studies on generalized Yule models, Universality for random surfaces in unconstrained genus, Limit theorems for assortativity and clustering in null models for scale-free networks, Statistical Clustering of a Random Network by Extremal Properties, Taylor's power law for the \(N\)-stars network evolution model, Limit laws for self-loops and multiple edges in the configuration model, Parameterized clique on inhomogeneous random graphs, Random intersection graphs with communities, Clustering in preferential attachment random graphs with edge-step, Rate of Convergence to the Poisson Law of the Numbers of Cycles in the Generalized Random Graphs, On a Minimum Distance Procedure for Threshold Selection in Tail Analysis, Random tree-weighted graphs, Not all interventions are equal for the height of the second peak, Mixing times of random walks on dynamic configuration models, Exceptional times of the critical dynamical Erdős-Rényi graph, The many facets of the Estrada indices of graphs and networks, Is breaking of ensemble equivalence monotone in the number of constraints?, Sizes of trees in a random forest and configuration graphs, Rare event asymptotics for exploration processes for random graphs, Extremal linkage networks, Mesoscopic scales in hierarchical configuration models, Depth first exploration of a configuration model, Large deviations in generalized random graphs with node weights, On edge exchangeable random graphs, Local neighbourhoods for first-passage percolation on the configuration model, Covariance structure behind breaking of ensemble equivalence in random graphs, The tail does not determine the size of the giant, Minimum vertex cover in generalized random graphs with power law degree distribution, Max-linear models in random environment, Central limit theorem for the largest component of random intersection graph, Ising critical behavior of inhomogeneous Curie-Weiss models and annealed random graphs, A topological insight into restricted Boltzmann machines, Spatial Gibbs random graphs, On the threshold of spread-out contact process percolation, Asymptotic dependence of in- and out-degrees in a preferential attachment model with reciprocity, Directed hybrid random networks mixing preferential attachment with uniform attachment mechanisms, Typical distances in the directed configuration model, Random walk on the random connection model, Short paths for first passage percolation on the complete graph, Coalescent results for diploid exchangeable population models, The dynamics of power laws: fitness and aging in preferential attachment trees, A theoretical and empirical evaluation of an algorithm for self-healing computation, When is a scale-free graph ultra-small?, Community detection in sparse random networks, Critical behavior of the annealed Ising model on random regular graphs, Bootstrap percolation and the geometry of complex networks, Asymptotic behavior of critical infection rates for threshold-one contact processes on lattices and regular trees, Synchronization of reinforced stochastic processes with a network-based interaction, Respondent-driven sampling on directed networks, Exponential extinction time of the contact process on rank-one inhomogeneous random graphs, A population evolution model and its applications to random networks, Tight fluctuations of weight-distances in random graphs with infinite-variance degrees, Network models: structure and function. Abstracts from the workshop held December 10--16, 2017, Glauber dynamics on the Erdős-Rényi random graph, The parabolic Anderson model on a Galton-Watson tree, PageRank on inhomogeneous random digraphs, Dangerous connections: on binding site models of infectious disease dynamics, Evolution of a modified binomial random graph by agglomeration, The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs, A moment-generating formula for Erdős-Rényi component sizes, Ensemble equivalence for dense graphs, Contact processes with random recovery rates and edge weights on complete graphs, Recent advances in percolation theory and its applications, Change point detection in network models: preferential attachment and long range dependence, On the connectivity of configuration graphs, De-anonymization of heterogeneous random graphs in quasilinear time, Triadic closure in configuration models with unbounded degree fluctuations, Large deviations for the annealed Ising model on inhomogeneous random graphs: spins and degrees, Synchronization and functional central limit theorems for interacting reinforced random walks, Uniqueness of post-gelation solutions of a class of coagulation equations, Diameters in preferential attachment models, Generating directed networks with predetermined assortativity measures, Level-set percolation of the Gaussian free field on regular graphs II: finite expanders, Cutoff for random walk on dynamical Erdős-Rényi graph, Metric dimension of critical Galton-Watson trees and linear preferential attachment trees, Number of edges in inhomogeneous random graphs, Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing, Age evolution in the mean field forest fire model via multitype branching processes, Detecting a planted community in an inhomogeneous random graph, Explicit bounds for critical infection rates and expected extinction times of the contact process on finite random graphs, Geometry of the minimal spanning tree of a random 3-regular graph, A phase transition for preferential attachment models with additive fitness, Stochastic block model in a new critical regime and the interacting multiplicative coalescent, Metastability for the dilute Curie-Weiss model with Glauber dynamics, Geometry of weighted recursive and affine preferential attachment trees, Quenched central limit theorems for the Ising model on random graphs, Frozen percolation on the binary tree is nonendogenous, Asymptotic analysis of Poisson shot noise processes, and applications, Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems, Secretary problem: graphs, matroids and greedoids, Phase transitions and percolation at criticality in enhanced random connection models, Limits of sparse configuration models and beyond: graphexes and multigraphexes, Tree builder random walk: recurrence, transience and ballisticity, Annealed Ising model on configuration models, A random graph of moderate density, Remarks on power-law random graphs, The random cluster model on the complete graph via large deviations, Extensive condensation in a model of preferential attachment with fitness, Global lower mass-bound for critical configuration models in the heavy-tailed regime, Susceptible-infected epidemics on evolving graphs, Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs, Dynamical models for random simplicial complexes, Pagerank asymptotics on directed preferential attachment networks, Typicality and entropy of processes on infinite trees, Counting triangles in power-law uniform random graphs, Mean field behavior during the big bang regime for coalescing random walks, On a game of chance in Marc Elsberg's thriller ``GREED, The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees, Distance evolutions in growing preferential attachment graphs, On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities, Large degrees in scale-free inhomogeneous random graphs
