Skip to content

Author

E. Ghorbani

We have 3 of 72 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Kemeny's constant via matrix compression and eigenvalue interlacing

Kemeny's constant quantifies the expected time for a random walk to reach a randomly chosen vertex, capturing global properties of a Markov chain. We develop a matrix-analytic framework for bounding Kemeny's constant of a finite connected weighted graph using degree-weighted compressions of the normalized adjacency mat...

A. Abiad, Á. Carmona, A. Encinas et al. · 1 citation
Preprint Sep 2026

Graphs with Minimum Algebraic Connectivity II: Regular Graphs of Even Degree

Aldous and Fill (2002) conjectured the asymptotic maximum relaxation time of a random walk on a connected regular graph. Since the relaxation time of a $d$-regular graph $G$ is $d/\mu(G)$, where $\mu(G)$ denotes its algebraic connectivity, this conjecture is closely related to the problem of minimizing algebraic connec...

M. Abdi, E. Ghorbani · 0 citations
Preprint Sep 2026

Graphs with Minimum Algebraic Connectivity I: Proofs of Aldous-Fill and Guiduli-Mohar Conjectures

Aldous and Fill (2002) conjectured that the maximum relaxation time of a random walk on a connected regular graph with $n$ vertices is bounded above by $(1+o(1))\frac{3n^2}{2\pi^2}$, with asymptotic equality for even $n$. Since the relaxation time of a $d$-regular graph $G$ is $d/\mu(G)$, where $\mu(G)$ denotes its alg...

M. Abdi, E. Ghorbani · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.