residential location choice modeling is one of the areas in transportation planning that attempts to examine households location search behavior incorporating their trade-offs between housing quality, prices or rents, distance to work and other key factors. this brings up the need to come up with methods to logically allocate credible choice alternatives for individuals.this article attempts to...

The growing affordable housing crisis in high-cost metropolitan areas may force households to seek lower cost the outer reaches of contributing recent increase commute distance. To explore this assertion, we test relationship between availability relative jobs and distance two diverse statistical Southern California: Los Angeles-Orange (higher cost, coastal, older, more urban) Riverside-San Ber...

In everyday life, the process of commuting to work from home happens every now and then. And the research of commute characteristics is useful for urban function planning. For humans, the commute of an individual seems revealing no regular universal patterns, but it is true that people try to find a satisfactory state of life regarding commute issues. Commute time and distance are most importan...

The commute distance between two vertices in a graph is the expected time it takes a random walk to travel from the first to the second vertex and back. We study the behavior of the commute distance as the size of the underlying graph increases. We prove that the commute distance converges to an expression that does not take into account the structure of the graph at all and that is completely ...

The commute distance between two vertices in a graph is the expected time it takes a random walk to travel from the first to the second vertex and back. We study the behavior of the commute distance as the size of the underlying graph increases. We prove that the commute distance converges to an expression that does not take into account the structure of the graph at all and that is completely ...

We present a method to find outliers using ‘commute distance’ computed from a random walk on graph. Unlike Euclidean distance, commute distance between two nodes captures both the distance between them and their local neighborhood densities. Indeed commute distance is the Euclidean distance in the space spanned by eigenvectors of the graph Laplacian matrix. We show by analysis and experiments t...

Does a stop a commuter makes on the way to or from work adversely affect peak-period traffic? This question is addressed by examining the effects of stops made as part of commute journeys upon daily, as well as peak-period, travel time and distance, using a six-week travel diary data set from Germany. Increments in travel time and distance due to stops made in commute journeys are evaluated and...

Home-work commuting has always attracted significant research attention because of its impact on human mobility. One of the key assumptions in this domain of study is the universal uniformity of commute times. However, a true comparison of commute patterns has often been hindered by the intrinsic differences in data collection methods, which make observation from different countries potentially...

Next to the shortest path distance, the second most popular distance function between vertices in a graph is the commute distance (resistance distance). For two vertices u and v, the hitting time Huv is the expected time it takes a random walk to travel from u to v. The commute time is its symmetrized version Cuv = Huv + Hvu. In our paper we study the behavior of hitting times and commute dista...

Commute Time Distance (CTD) is a random walk based metric on graphs. CTD has found widespread applications in many domains including personalized search, collaborative filtering and making search engines robust against manipulation. Our interest is inspired by the use of CTD as a metric for anomaly detection. It has been shown that CTD can be used to simultaneously identify both global and loca...