Random graph models of social networks
From MaRDI portal
Publication:4547693
DOI10.1073/PNAS.012582999zbMATH Open1114.91362OpenAlexW2101267973WikidataQ34139030 ScholiaQ34139030MaRDI QIDQ4547693FDOQ4547693
Authors: D. J. Watts, M. E. J. Newman, Steven Strogatz 
Publication date: 11 September 2002
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.012582999
Recommendations
Cites Work
Cited In (only showing first 100 items - show all)
- Motif-based embedding for graph clustering
- Probabilistic Inductive Classes of Graphs
- Eigenvector-based identification of bipartite subgraphs
- Clustering coefficient of a preferred attachment affiliation network
- Efficient Computation of the Weighted Clustering Coefficient
- Dynamics of large cooperative pulsed-coupled networks
- Do scale-free regulatory networks allow more expression than random ones?
- The plurality of social relations: \(k\)-partite representations of interdependent social forms
- A note on perfect simulation for exponential random graph models
- Topological features of online social networks
- Modeling and Designing Real–World Networks
- Bounds on the spectral radius of digraphs from subgraph counts
- Dynamics of random graphs with bounded degrees
- Quantitative controllability index of complex networks
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- Summarized bit batch-based triangle listing in massive graphs
- On a distance-constrained graph labeling to model cooperation
- Patterns in coupled FitzHugh-Nagumo model on duplex networks
- The many faces of graph dynamics
- Sampling on bipartite networks: a comparative analysis of eight crawling methods
- Global dynamics of an epidemic model with incomplete recovery in a complex network
- Genetic networks encode secrets of their past
- Parties and networks: Stochastic models for relationship networks
- The social network model on infinite graphs
- OODA of graph and tree-structured data
- Topology discovery of sparse random graphs with few participants
- Long-distance travel behaviours accelerate and aggravate the large-scale spatial spreading of infectious diseases
- A mean field approach for Ising models on scale-free networks
- Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
- The correlation of the degrees of Bernoulli random graphs
- Exact recovery of community detection in \(k\)-partite graph models with applications to learning electric potentials in electric networks
- Two evolving social network models
- Bridging the gap between different social networks
- Spectrum graph coloring and applications to Wi-Fi channel assignment
- Efficient computation of the Weighted Clustering Coefficient
- iTri: index-based triangle listing in massive graphs
- Book embedding of complex network with community structure
- Random graph ensembles with many short loops
- An Experimental Study of Algorithms for Online Bipartite Matching
- Modeling social networks through user background and behavior
- Emergent networks in fractional percolation
- On limit behavior of maximum vertex degree in a conditional configuration graph near critical points
- Visualizing bivariate long-tailed data
- Combinatorial models for cooperation networks
- Dynamics of a single particle moving on a random Lorentz lattice-gas
- Title not available (Why is that?)
- SIR epidemics and vaccination on random graphs with clustering
- Stability of degree distributions of social networks
- Vertex nomination, consistent estimation, and adversarial modification
- Non-equilibrium opinion spreading on 2D small-world networks
- Bending of the ``\(9+2\) axoneme analyzed by the finite element method
- Contiguity and non-reconstruction results for planted partition models: the dense case
- Networks beyond pairwise interactions: structure and dynamics
- Farey graphs as models for complex networks
- Minimum-cost control of complex networks
- SPANNING TREES AND BOOTSTRAP RELIABILITY ESTIMATION IN CORRELATION-BASED NETWORKS
- Phase transitions in social networks
- Micro- and macromodels of social networks. I: Theory fundamentals
- A scale-free graph model based on bipartite graphs
- The clustering coefficient and the diameter of small-world networks
- The rise and fall of a networked society: A formal model
- Epistemic democracy with correlated voters
- Discrete-time epidemic dynamics with awareness in random networks
- Community detection and stochastic block models: recent developments
- Random-walk models of network formation and sequential Monte Carlo methods for graphs
- Editorial: Tails and ties
- A diffusive strategic dynamics for social systems
- A hierarchical network model for epidemic spreading. analysis of A/H1N1 virus spreading in Romania
- Bipartite structure of all complex networks
- Scale-free percolation in continuum space
- Low-temperature behaviour of social and economic networks
- Epidemic models on social networks—With inference
- Modeling one-mode projection of bipartite networks by tagging vertex information
- Optimizing controllability of edge dynamics in complex networks by perturbing network structure
- SIR dynamics in random networks with heterogeneous connectivity
- Complex networks: structure and dynamics
- Correlation based networks of equity returns sampled at different time horizons
- Degree distributions of evolving alphabetic bipartite networks and their projections
- Emergence of clustering in an acquaintance model without homophily
- Contact processes on random graphs with power law degree distributions have critical value 0
- A note on competitive diffusion through social networks
- Studies of opinion stability for small dynamic networks with opportunistic agents
- Opinion dynamics in populations with implicit community structure
- Principles of statistical mechanics of uncorrelated random networks
- Small-world graphs: characterization and alternative constructions
- Degree and clustering coefficient in sparse random intersection graphs
- A general evolving model for growing bipartite networks
- Phase transition for the threshold contact process, an approximation of heterogeneous random Boolean networks
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- Dynamic random networks in dynamic populations
- Title not available (Why is that?)
- Preferred attachment in affiliation networks
- Modeling acquaintance networks based on balance theory
- A PROBABILISTIC FRIENDSHIP NETWORK MODEL
- Model for the evolution of the degree distributions of the vertices of social network graphs
- An Experimental Study of the Treewidth of Real-World Graph Data
- Building models for social space: neighbourhood-based models for social networks and affiliation structures
- Clusters from higher order correlations
- Asymptotic distributions in random graphs with applications to social networks
- Social ontologies as generalized nearly acyclic directed graphs: a quantitative graph model of social tagging
This page was built for publication: Random graph models of social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547693)
