We present a general theory which allows one to accurately evaluate the mean first-passage
time (FPT) for regular random walks in bounded domains, and its extensions to related first …

We present a general framework, applicable to a broad class of random walks on complex
networks, which provides a rigorous lower bound for the mean first-passage time of a …

The Fermat point of a triangle is the point with the minimal total distance from the three
vertices of the triangle. Meanwhile, the total distance from the three vertices to the Fermat …

A vast variety of real-life networks display the ubiquitous presence of scale-free
phenomenon and small-world effect, both of which play a significant role in the dynamical …

The family of Vicsek fractals is one of the most important and frequently studied regular
fractal classes, and it is of considerable interest to understand the dynamical processes on …

Background: The pseudospin symmetry (PSS) has been studied extensively for bound
states. Recently, we justified rigorously that the PSS in single-particle resonant states is …

The determination of mean first-passage time (MFPT) for random walks in networks is a
theoretical challenge, and is a topic of considerable recent interest within the physics …

The Fermat point of a triangle is a point that the total distance from the three vertices of the
triangle to the point is the minimum possible. Considering the Fermat problem within a …

A wide variety of real-life networks share two remarkable generic topological properties:
scale-free behavior and modular organization, and it is natural and important to study how …

For a random walk on a network, the mean first-passage time from a node i to another node j
chosen stochastically, according to the equilibrium distribution of Markov chain representing …