A Hierarchy of Network Models Giving Bistability Under Triadic Closure

DOI10.1137/21M1461290OpenAlexW3214514461MaRDI QIDQ5880624

No author found.

Publication date: 3 March 2023

Published in: Multiscale Modeling & Simulation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.05715

zbMATH Keywords

graphbirth and death processesLangevin equationmetastabilitymean fieldstochastic simulation algorithm

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30) Probabilistic models, generic numerical methods in probability and statistics (65C20) Applications of stochastic analysis (to PDEs, etc.) (60H30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hybrid framework for the simulation of stochastic chemical kinetics
• Counting Triangles in Massive Graphs with MapReduce
• Predicting Triadic Closure in Networks Using Communicability Distance Functions
• Models for evolving networks: with applications in telecommunication and online activities
• Modeling and Simulating Chemical Reactions
• Comparing Hitting Time Behavior of Markov Jump Processes and Their Diffusion Approximations
• On Constrained Langevin Equations and (Bio)Chemical Reaction Networks
• Numerical approximation of a metastable system
• Bistability through Triadic Closure
• Classes of preferential attachment and triangle preferential attachment models with power-law spectra
• The Why, How, and When of Representations for Complex Systems
• Finding Cliques in Social Networks: A New Distribution-Free Model
• Stochastic Processes and Applications
• Markoff Chains--Denumerable Case
• Multiscale Global Sensitivity Analysis for Stochastic Chemical Systems
• Handbook of stochastic methods for physics, chemistry and the natural sciences.

This page was built for publication: A Hierarchy of Network Models Giving Bistability Under Triadic Closure