Bistability through triadic closure

DOI10.1080/15427951.2012.714718MaRDI QIDQ4905095zbMATH OpenOpenAlexFDO

Authors Peter Grindrod, Desmond J. Higham, Mark C. Parsons

Publication date 15 February 2013

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.im/1354809991

zbMATH Keywords

applicationscalibrationrandom graphsgroup dynamicssocial behaviordiscrete time Markov chainbistable dynamicsdynamic topological structureevolving network modelsinformation processing in neurosciencetelecomminicationstriadic closure effect

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• A Hierarchy of Network Models Giving Bistability Under Triadic Closure
• Models for evolving networks: with applications in telecommunication and online activities
• Empirical Analysis of an Evolving Social Network
• Study of a class of dynamic complex network evolving models with a triangular structure
• Evolving graphs: dynamical models, inverse problems and propagation

Cited in

(4)

• Predicting triadic closure in networks using communicability distance functions
• A Hierarchy of Network Models Giving Bistability Under Triadic Closure
• A framework for second-order eigenvector centralities and clustering coefficients
• Block matrix formulations for evolving networks

This page was built for publication: Bistability through triadic closure

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