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

Ring structures and mean first passage time in networks.

Andrea Baronchelli1, Vittorio Loreto

  • 1INFM and Dipartimento di Fisica, Università di Roma "La Sapienza" and INFM Center for Statistical Mechanics and Complexity (SMC), Piazzale A. Moro 2, 00185 Roma, Italy.

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|April 12, 2006
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

How malicious AI swarms can threaten democracy.

Science (New York, N.Y.)·2026
Same author

Ideology and polarization set the agenda on social media.

Scientific reports·2025
Same author

Time-space dynamics of income segregation in the city of Milan.

PNAS nexus·2025
Same author

How language, culture, and geography shape online dialogue: Insights from Koo.

PloS one·2025
Same author

Emergent social conventions and collective bias in LLM populations.

Science advances·2025
Same author

Patterns of partisan toxicity and engagement reveal the common structure of online political communication across countries.

Nature communications·2024
Same journal

Tension on dsDNA bound to ssDNA-RecA filaments may play an important role in driving efficient and accurate homology recognition and strand exchange.

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Publisher's Note: Amplitude-phase coupling drives chimera states in globally coupled laser networks [Phys. Rev. E 91, 040901(R) (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Erratum: Shapes of sedimenting soft elastic capsules in a viscous fluid [Phys. Rev. E 92, 033003 (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Erratum: Attenuation of excitation decay rate due to collective effect [Phys. Rev. E 90, 022142 (2014)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Publisher's Note: Role of connectivity and fluctuations in the nucleation of calcium waves in cardiac cells [Phys. Rev. E 92, 052715 (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Publisher's Note: Lattice Boltzmann approach for complex nonequilibrium flows [Phys. Rev. E 92, 043308 (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
See all related articles

This study introduces an efficient method to calculate mean first passage times on graphs. The approach significantly reduces computational cost for random walks on complex networks.

Area of Science:

  • Graph theory
  • Network analysis
  • Computational physics

Background:

  • Calculating mean first passage time (MFPT) is crucial for understanding random walks on networks.
  • Traditional methods face computational challenges with large and complex graphs.

Purpose of the Study:

  • To develop an approximate calculation scheme for MFPT on generic graphs.
  • To reduce the computational complexity of MFPT calculations for large networks.

Main Methods:

  • Mapping the original random walk process to a Markov process in the 'rings' space.
  • Utilizing a transition matrix of size O(ln N/ln k x ln N/ln k), where N is graph size and k is average degree.
  • Developing an approximate scheme for calculating mean first passage time.

Related Experiment Videos

Main Results:

  • The method shows almost perfect agreement with numerical simulations on Erdös-Renyi random graphs.
  • It yields excellent results for Barabási-Albert scale-free graphs.
  • Accurate results are obtained for real-world networks like the Internet and brain networks.

Conclusions:

  • The proposed approximate scheme offers a computationally efficient approach for MFPT calculations.
  • This method significantly reduces the degrees of freedom and computational cost.
  • The technique is validated across various synthetic and real-world network structures.