WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Methodology and Computing in Applied Probability
  2. Methodology and Computing in Applied Probability : Volume 18
  3. Methodology and Computing in Applied Probability : Volume 18, Issue 4, December 2016
  4. Decomposing Hitting Times of Walks on Graphs into Simpler Ones
Loading...

Please wait, while we are loading the content...

Methodology and Computing in Applied Probability : Volume 19
Methodology and Computing in Applied Probability : Volume 18
Methodology and Computing in Applied Probability : Volume 18, Issue 4, December 2016
Editorial ( Methodology and Computing in Applied Probability , Volume 18 , Issue 4 )
Piecewise Linear Approximations for Cure Rate Models and Associated Inferential Issues
Multiple Window Scan Statistics for Two Dimensional Poisson Processes
Merging Exchangeable Occupancy Distributions: The Family $\mathcal {M}^{(a)}$ and its Connection with the Maximum Entropy Principle
Some New Concepts and Their Computational Formulae in Aggregated Stochastic Processes with Classifications Based on Sojourn Times
Some Sufficient Conditions for Stochastic Comparisons Between Hitting Times for Skip-free Markov Chains
Decomposing Hitting Times of Walks on Graphs into Simpler Ones
A Pseudo-Pareto Distribution and Concomitants of Its Order Statistics
Power Laws Variance Scaling of Boolean Random Varieties
Stochastic Comparisons Between Lifetimes of Reliability Systems with Exchangeable Components
Asymptotic Multivariate Dominance: A Financial Application
Stirling’s Formula for Gamma Functions, Bounds for Ratios of Gamma Functions, Beta Functions and Percentiles of a Studentized Sample Mean: A Synthesis with New Results
A Stochastic Model for Multi-Hierarchical Networks
An Analytic Expression for the Distribution of the Generalized Shiryaev–Roberts Diffusion : The Fourier Spectral Expansion Approach
An Operator Property of the Distribution of a Nonhomogeneous Poisson Process with Applications
Interaction Processes for Unions of Facets, the Asymptotic Behaviour with Increasing Intensity
Methodology and Computing in Applied Probability : Volume 18, Issue 3, September 2016
Methodology and Computing in Applied Probability : Volume 18, Issue 2, June 2016
Methodology and Computing in Applied Probability : Volume 18, Issue 1, March 2016
Methodology and Computing in Applied Probability : Volume 17
Methodology and Computing in Applied Probability : Volume 16
Methodology and Computing in Applied Probability : Volume 15
Methodology and Computing in Applied Probability : Volume 14
Methodology and Computing in Applied Probability : Volume 13
Methodology and Computing in Applied Probability : Volume 12
Methodology and Computing in Applied Probability : Volume 11
Methodology and Computing in Applied Probability : Volume 10
Methodology and Computing in Applied Probability : Volume 9
Methodology and Computing in Applied Probability : Volume 8
Methodology and Computing in Applied Probability : Volume 7
Methodology and Computing in Applied Probability : Volume 6
Methodology and Computing in Applied Probability : Volume 5
Methodology and Computing in Applied Probability : Volume 4
Methodology and Computing in Applied Probability : Volume 3
Methodology and Computing in Applied Probability : Volume 2
Methodology and Computing in Applied Probability : Volume 1

Similar Documents

...
Hitting Times and Interlacing Eigenvalues: A Stochastic Approach Using Intertwinings

Article

...
Mixing Times are Hitting Times of Large Sets

Article

...
An Interlacing Technique for Spectra of Random Walks and Its Application to Finite Percolation Clusters

Article

...
Coalescence and Meeting Times on $$n$$ -Block Markov Chains

Article

...
Escape Rate of Markov Chains on Infinite Graphs

Article

...
A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs

Article

...
Some Sufficient Conditions for Stochastic Comparisons Between Hitting Times for Skip-free Markov Chains

Article

...
The Spectrum and Convergence Rates of Exclusion and Interchange Processes on the Complete Graph

Article

...
On Hitting Times and Fastest Strong Stationary Times for Skip-Free and More General Chains

Article

Decomposing Hitting Times of Walks on Graphs into Simpler Ones

Content Provider Springer Nature Link
Author Palacios, José Luis Río, Miguel
Copyright Year 2015
Abstract Using the electric approach, we derive a formula that expresses an expected hitting time of a random walk between two vertices a and b of a graph G as a convex linear combination of expected hitting times of walks between a and b on subgraphs of G, provided certain condition on a and b is satisfied. Then we use this formula in several applications.
Ending Page 1042
Page Count 8
Starting Page 1035
File Format PDF
ISSN 13875841
e-ISSN 15737713
Journal Methodology and Computing in Applied Probability
Issue Number 4
Volume Number 18
Language English
Publisher Springer US
Publisher Date 2015-07-25
Publisher Place New York
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword Life Sciences Economics Business and Management Voltage Effective resistance Random walks on graphs Statistics Unicyclic graphs Markov chains (discrete-time Markov processes on discrete state spaces) Electrical Engineering
Content Type Text
Resource Type Article
Subject Statistics and Probability
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
I will try my best to help you...
Cite this Content
Loading...