On partial sums of hitting times

José Luis Palacios; José M. Renom

doi:10.1016/j.spl.2011.12.012

On partial sums of hitting times

José Luis Palacios
, José M. Renom

Producción científica: Contribución a una revista › Artículo › revisión exhaustiva

3 Citas (Scopus)

Resumen

We conjecture that if T _j is the hitting time of vertex j then ∑jEiTj≥(N-1)2, for all i, for a random walk on any connected graph G=(V, E) with {pipe}E{pipe}=N. We prove the conjecture for a family of graphs containing the regular graphs and obtain slightly better bounds for trees and non-regular edge-transitive graphs.

Idioma original	Inglés
Páginas (desde-hasta)	783-785
Número de páginas	3
Publicación	Statistics and Probability Letters
Volumen	82
N.º	4
DOI	https://doi.org/10.1016/j.spl.2011.12.012
Estado	Publicada - abr. 2012
Publicado de forma externa	Sí

Acceder al documento

10.1016/j.spl.2011.12.012

Otros archivos y enlaces

Enlace a la publicación en Scopus

Citar esto

@article{af46c5ad84f746e6b4b5958430cbeee3,

title = "On partial sums of hitting times",

abstract = "We conjecture that if T j is the hitting time of vertex j then ∑jEiTj≥(N-1)2, for all i, for a random walk on any connected graph G=(V, E) with \{pipe\}E\{pipe\}=N. We prove the conjecture for a family of graphs containing the regular graphs and obtain slightly better bounds for trees and non-regular edge-transitive graphs.",

keywords = "Effective resistance, Kirchhoff index",

author = "Palacios, \{Jos{\'e} Luis\} and Renom, \{Jos{\'e} M.\}",

year = "2012",

month = apr,

doi = "10.1016/j.spl.2011.12.012",

language = "English",

volume = "82",

pages = "783--785",

journal = "Statistics and Probability Letters",

issn = "0167-7152",

number = "4",

}

TY - JOUR

T1 - On partial sums of hitting times

AU - Palacios, José Luis

AU - Renom, José M.

PY - 2012/4

Y1 - 2012/4

N2 - We conjecture that if T j is the hitting time of vertex j then ∑jEiTj≥(N-1)2, for all i, for a random walk on any connected graph G=(V, E) with {pipe}E{pipe}=N. We prove the conjecture for a family of graphs containing the regular graphs and obtain slightly better bounds for trees and non-regular edge-transitive graphs.

AB - We conjecture that if T j is the hitting time of vertex j then ∑jEiTj≥(N-1)2, for all i, for a random walk on any connected graph G=(V, E) with {pipe}E{pipe}=N. We prove the conjecture for a family of graphs containing the regular graphs and obtain slightly better bounds for trees and non-regular edge-transitive graphs.

KW - Effective resistance

KW - Kirchhoff index

UR - https://www.scopus.com/pages/publications/84856297064

U2 - 10.1016/j.spl.2011.12.012

DO - 10.1016/j.spl.2011.12.012

M3 - Article

AN - SCOPUS:84856297064

SN - 0167-7152

VL - 82

SP - 783

EP - 785

JO - Statistics and Probability Letters

JF - Statistics and Probability Letters

IS - 4

ER -

On partial sums of hitting times

Resumen

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto