Dynamic random intersection graph: dynamic local convergence and giant structure

DOI10.1002/RSA.21264MaRDI QIDQ7027475zbMATH OpenFDO

Authors Marta Milewska, Remco van der Hofstad, Bert Zwart

Publication date 14 February 2025

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/RSA.21264

zbMATH Keywords

bipartite generalized random graphdynamic largest connected component processdynamic local convergencerandom intersection graphs

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76) Random graphs (graph-theoretic aspects) (05C80) Social networks; opinion dynamics (91D30)

Cites work

• A critical point for random graphs with a given degree sequence
• A new approach to the giant component problem
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• A survey of dynamical percolation
• An old approach to the giant component problem
• Assortativity and clustering of sparse random intersection graphs
• Asymptotic equivalence and contiguity of some random graphs
• Community structure in social and biological networks
• Complex graphs and networks
• Component evolution in general random intersection graphs
• Connected components in random graphs with given expected degree sequences
• Connectivity of the uniform random intersection graph
• Contagions in random networks with overlapping communities
• Cutoff for random walk on dynamical Erdős-Rényi graph
• Degree and clustering coefficient in sparse random intersection graphs
• Degree distribution of an inhomogeneous random intersection graph
• Degree-degree distribution in a power law random intersection graph with clustering
• Diameter, connectivity, and phase transition of the uniform random intersection graph
• Dynamical percolation
• Emergence of Scaling in Random Networks
• Epidemics on random intersection graphs
• Generating simple random graphs with prescribed degree distribution
• scientific article; zbMATH DE number 1713116 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 1354815 (Why is no real title available?)
• scientific article; zbMATH DE number 2042286 (Why is no real title available?)
• Limit laws for self-loops and multiple edges in the configuration model
• Linking the mixing times of random walks on static and dynamic random graphs
• Networks. An introduction.
• ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
• On a conditionally Poissonian graph process
• On analytical approaches to epidemics on networks
• On Random Intersection Graphs: The Subgraph Problem
• Phase transition in random intersection graphs with communities
• Random Graphs and Complex Networks
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Random intersection graphs with communities
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• Random walks on dynamic configuration models: a trichotomy
• Recurrence of distributional limits of finite planar graphs
• Susceptible-infected-removed epidemic models with dynamic partnerships
• The phase transition in inhomogeneous random graphs
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Volume of the Giant Component of a Random Graph with Given Expected Degrees

Cited in

(3)

• Local limit of the random degree constrained process
• Two models of sparse and clustered dynamic networks
• Random connection hypergraphs

This page was built for publication: Dynamic random intersection graph: dynamic local convergence and giant structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027475)