Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Dynamical random graphs with memory.

Tatyana S Turova1

  • 1Center for Mathematical Sciences, University of Lund, Box 118, Lund 22100, Sweden.

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|August 22, 2002
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Visual cortical networks for "What" and "Where" to the human hippocampus revealed with dynamical graphs.

Cerebral cortex (New York, N.Y. : 1991)·2025
Same author

Structural phase transitions in neural networks.

Mathematical biosciences and engineering : MBE·2013
Same author

The emergence of connectivity in neuronal networks: from bootstrap percolation to auto-associative memory.

Brain research·2011
Same author

On a phase diagram for random neural networks with embedded spike timing dependent plasticity.

Bio Systems·2007
Same author

Study of synaptic plasticity via random graphs.

Bio Systems·2002

This study introduces a dynamical graph model unifying random growth and random graph models. It identifies critical parameters for phase transitions and analyzes network efficiency.

Area of Science:

  • Complex Systems
  • Network Science
  • Probability Theory

Background:

  • Markov processes model systems with evolving states.
  • Branching processes describe population growth.
  • Mean-field dynamics simplify interactions in large systems.

Purpose of the Study:

  • To introduce a general class of dynamical graphs.
  • To unify existing models like random growth and random graphs.
  • To analyze phase transitions and network efficiency.

Main Methods:

  • Modeling Markov processes on graphs with evolving vertices and edges.
  • Utilizing supercritical branching processes for vertex dynamics.
  • Implementing mean-field edge dynamics with exponential lifetimes and a memory parameter.

Related Experiment Videos

Main Results:

  • Demonstrated the model bridges random growth (infinite memory) and random graphs (zero memory).
  • Identified critical parameter values for phase transitions.
  • Characterized the phase diagram and network properties.

Conclusions:

  • The proposed dynamical graph model offers a unified framework for studying network evolution.
  • Understanding memory parameter effects is key to network behavior and efficiency.
  • The model provides insights into the relationship between different network models.