Skip to main content
SpringerLink
Log in

Paths in Complex Networks

  • Living reference work entry
  • First Online:
Encyclopedia of Social Network Analysis and Mining

  • 359 Accesses

Synonyms

Human movement; Navigation; Routing; Sequence; Trajectory

Glossary

Path:

A path is a sequence of nodes and edges in a graph such that each node and edge of the path is contained in the graph

Polygonal curve or polygonal chain:

A sequence of connected line segments (in geometry, usually in the Euclidean plane). It is also uniquely determined by the sequence of points at which the line segments are connected

Sequence:

A sequence is an ordered list of elements in which elements are of arbitrary type and repetitions of elements are allowed

Trajectory:

A trajectory describes the position of a moving object through space. A discrete trajectory is usually a sequence of (possibly time-stamped) locations in two- or three-dimensional space, for example, given as GPS coordinates

Definition

Given a simple, undirected, and unweighted graph G = (V, E) with a set of nodes V = {v 1,  … , v n } and a set of edges E ⊆ V × V, a path in G is defined as finite sequence P = (p 1 e p1 p 2 … p...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  • Aginsky V, Harris C, Rensink R, Beusmans J (1997) Two strategies for learning a route in a driving simulator. J Environ Psychol 17(4):317–331

    Article  Google Scholar 

  • Alt H, Godau M (1995) Computing the Fréchet distance between two polygonal curves. Int J Comput Geom Appl 5:75–91

    Article  MATH  Google Scholar 

  • Benkert M, Djordjevic B, Gudmundsson J, Wolle T (2010) Finding popular places. Int J Comput Geom Appl 20(01):19–42

    Article  MathSciNet  MATH  Google Scholar 

  • Bockholt M (2015) Measures for the similarity of paths in complex networks. Master thesis, TU Kaiserslautern

    Google Scholar 

  • Buchin K, Buchin M, Gudmundsson J, Löffler M, Luo J (2008) Detecting commuting patterns by clustering subtrajectories. In: Algorithms and computation: 19th international symposium, ISAAC 2008, Gold Coast, 15–17 Dec 2008. Proceedings, September, pp 644–655

    Google Scholar 

  • Cho E, Myers SA, Leskovec J (2011) Friendship and mobility: user movement in location-based social networks. In: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD ‘11). ACM, New York, pp 1082–1090. doi: 10.1145/2020408.2020579

    Google Scholar 

  • Das G, Gunopulos D, Mannila H (1997) Finding similar time series. In: Komorowski J, Zytkow J (eds) Principles of data mining and knowledge discovery, Lecture notes in computer science, vol 1263. Springer, Berlin/Heidelberg, pp 88–100

    Chapter  Google Scholar 

  • Dorn I, Lindenblatt A, Zweig KA (2012) The trilemma of network analysis. In: Proceedings of the 2012 IEEE/ACM international conference on advances in social network analysis and mining, Istanbul

    Google Scholar 

  • Ducruet C, Notteboom T (2012) The worldwide maritime network of container shipping: spatial structure and regional dynamics. Glob Netw 12(3):395–423

    Article  Google Scholar 

  • Eiter T, Mannila H (1994) Computing discrete Fréchet distance. Technical report. Information Systems Department, Technical University of Vienna

    Google Scholar 

  • Eiter T, Mannila H (1997) Distance measures for point sets and their computation. Acta Inform 34(2):109–133

    Article  MathSciNet  MATH  Google Scholar 

  • Fréchet MM (1906) Sur quelques points du calcul fonctionnel. Rend Circ Mat Palermo (1884–1940) 22(1):1–72

    Article  MATH  Google Scholar 

  • González MC, Hidalgo CA, Barabási AL (2008) Understanding individual human mobility patterns. Nature 453(7196):779–782. 0806.1256

    Article  Google Scholar 

  • Gudmundsson J, Thom A, Vahrenhold J (2012) Of motifs and goals: mining trajectory data. In: Proceedings of the 20th international conference on advances in geographic information systems – SIGSPATIAL ’12, ACM, New York, pp 129–138

    Google Scholar 

  • Guimerá R, Amaral LAN (2004) Modeling the world-wide airport network. Eur Phys J B 38(2):381–385

    Article  Google Scholar 

  • Gündüz Åž, Özsu MT (2003) A web page prediction model based on click-stream tree representation of user behavior. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, pp 535–540

    Google Scholar 

  • Gusfield D (1997) Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press, New York

    Book  MATH  Google Scholar 

  • Hausdorff F (1914) Grundzüge der Mengenlehre. Veit and Company, Leipzig

    MATH  Google Scholar 

  • Jaccard P (1912) The distribution of the flora in the alpine zone. New Phytol 11(2):37–50

    Article  Google Scholar 

  • JaruÅ¡ek P, Pelánek R (2011) What determines difficulty of transport puzzles? In: Proceedings of Florida Artificial Intelligence Research Society conference. AAAI Press, pp 428–433

    Google Scholar 

  • Junejo IN, Javed O, Shah M (2004) Multi feature path modeling for video surveillance. In: Proceedings of the international conference on pattern recognition, vol 2, pp 716–719

    Google Scholar 

  • Kaluza P, Kölzsch A, Gastner MT, Blasius B (2010) The complex network of global cargo ship movements. J R Soc Interface 7(48):1093–1103, 1001.2172

    Article  Google Scholar 

  • Kleinberg J (2000a) The small-world phenomenon: an algorithmic perspective. In: Proceedings of the thirty-second annual ACM symposium on theory of computing, STOC 00, ACM, New York, pp 163–170

    Google Scholar 

  • Kleinberg JM (2000b) Navigation in a small world. Nature 406:845–845

    Article  Google Scholar 

  • Kumar P, Raju BS, Radha Krishna P (2010) A new similarity metric for sequential data. Int J Data Warehous Min 6(4):16–32. doi:10.4018/jdwm.2010100102

    Article  Google Scholar 

  • Laasonen K (2005a) Clustering and prediction of mobile user routes from cellular data. In: Knowledge discovery in databases: PKDD 2005. Lecture notes in computer science, vol 3721. Springer, Berlin/Heidelberg, pp 569–576

    Google Scholar 

  • Laasonen K (2005b) Route prediction from cellular data. In: Workshop on Context-Awareness for Proactive Systems (CAPS), vol 1617

    Google Scholar 

  • Larson JS, Bradlow ET, Fader PS (2005) An exploratory look at supermarket shopping paths. Int J Res Mark 22(4):395–414

    Article  Google Scholar 

  • Lee JG, Han J, Whang KY (2007) Trajectory clustering: a partition-and-group framework. In: Proceedings of the 2007 ACM SIGMOD international conference on management of data, ACM, New York, pp 593–604

    Google Scholar 

  • Levenshtein V (1966) Binary codes capable of correcting deletions, insertions and reversals. Sov Phys Dokl 10(8):707–710. Original in Russian in Dokl Akad Nauk SSSR 163(4):845–848, 1965

    MathSciNet  MATH  Google Scholar 

  • Mannila H, Ronkainen P (1997) Similarity of event sequences. In: Temporal representation and reasoning, 1997. (TIME ‘97), Proceedings., fourth international workshop on, Dayton Beach, pp 136–139. doi:10.1109/TIME.1997.600793

    Google Scholar 

  • McDonald TP, Pellegrino JW (1993) Psychological perspectives on spatial cognition. In: Gärling T, Golledge RG (eds) Behavior and environment – psychological and geographical approaches, advances in psychology, vol 96. Elsevier Science Publishers, North-Holland, pp 47–82

    Chapter  Google Scholar 

  • Milgram S (1967) The small world problem. Psychol Today 2(1):60–67

    Google Scholar 

  • Moen P (2000) Attribute, event sequence, and event type similarity notions for data mining. PhD thesis, Department of Computer Science, University of Helsinki

    Google Scholar 

  • Moeser SD (1988) Cognitive mapping in a complex building. Environ Behav 20(1):21–49

    Article  Google Scholar 

  • Navarro G (2001) A guided tour to approximate string matching. ACM Comput Surv 33(1):31–88

    Article  Google Scholar 

  • Needleman SB, Wunsch CD (1970) A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol 48(3):443–453

    Article  Google Scholar 

  • Newell A (1980) Reasoning, problem solving and decision processes: the problem space as a fundamental category. In: Nickerson R (ed) Attention and performance VIII. Erlbaum, Hillsdale. (Also available as Technical Report, Carnegie Mellon University, Computer Science, Report No. 2482, 1979)

    Google Scholar 

  • Niiniluoto I (1987) Truthlikeness, vol 185. Springer Science & Business Media, Dordrecht

    Book  MATH  Google Scholar 

  • Oddie G (1986) Likeness to truth. D. Reidel, Dordrecht

    Book  Google Scholar 

  • Ramon J, Bruynooghe M (2001) A polynomial time computable metric between point sets. Acta Inform 37(10):765–780

    Article  MathSciNet  MATH  Google Scholar 

  • Sen P, Dasgupta S, Chatterjee A, Sreeram PA, Mukherjee G, Manna SS (2003) Small-world properties of the Indian railway network. Phys Rev E 67(3):036106

    Article  Google Scholar 

  • Sener IN, Eluru N, Bhat CR (2009) An analysis of bicycle route choice preferences in Texas, US. Transportation 36(5):511–539

    Article  Google Scholar 

  • Shamoun-Baranes J, van Loon EE, Purves RS, Speckmann B, Weiskopf D, Camphuysen C (2011) Analysis and visualization of animal movement. Biol Lett 8(1):6–9

    Article  Google Scholar 

  • Sudarshan Iyengar S, Veni Madhavan C, Zweig KA, Natarajan A (2012) Understanding human navigation using network analysis. Top Cogn Sci 4(1):121–134

    Article  Google Scholar 

  • Vlachos M, Kollios G, Gunopulos D (2002) Discovering similar multidimensional trajectories. In: Proceedings 18th international conference on data engineering, San Jose, pp 673–684. doi:10.1109/ICDE.2002.994784

    Google Scholar 

  • Vogel M, Hamon R, Lozenguez G, Merchez L, Abry P, Barnier J, Borgnat P, Flandrin P, Mallon I, Robardet C (2014) From bicycle sharing system movements to users: a typology of Vélo’v cyclists in Lyon based on large-scale behavioural dataset. J Transp Geogr 41:280–291

    Article  Google Scholar 

  • Wang Q, Zaiane OR (2002) Clustering web sessions by sequence alignment. In: Proceedings. 13th international workshop on database and expert systems applications, Aix-en-Provence, pp 394–398. doi:10.1109/DEXA.2002.1045928

    Google Scholar 

  • Watts DJ, Strogatz SH (1998) Collective dynamics of small-world networks. Nature 393(6684):440–442

    Article  Google Scholar 

  • West R, Leskovec J (2012) Human wayfinding in information networks. In: Proceedings of the 21st international conference on World wide web, ACM, New York, pp 619–628

    Google Scholar 

  • West R, Pineau J, Precup D (2009) Wikispeedia: an online game for inferring semantic distances between concepts. In: Kitano H (ed) Proceedings of the 21st international joint conference on artificial intelligence (IJCAI ‘09). Morgan Kaufmann, San Francisco, pp 1598–1603

    Google Scholar 

  • Yuan J, Zheng Y, Zhang C, Xie W (2010) T-Drive: driving directions based on Taxi trajectories. In: Proceedings of the 18th SIGSPATIAL international conference on advances in geographic information systems, pp 99–108

    Google Scholar 

  • Yuan J, Zheng Y, Xie X, Sun G (2011) Driving with knowledge from the physical world. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining (KDD ’11), vol 5, pp 316–324

    Google Scholar 

  • Zheng Y, Zhang L, Xie X, Ma WY (2009) Mining interesting locations and travel sequences from GPS trajectories. In: Proceedings of the 18th international conference on World Wide Web. ACM, pp 791–800

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Complex Network Analysis and Graph Theory, University of Kaiserslautern, Kaiserslautern, Germany

    Mareike Bockholt & Katharina A. Zweig

Authors
  1. Mareike Bockholt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Katharina A. Zweig
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mareike Bockholt .

Editor information

Editors and Affiliations

  1. Computer Science, University of Calgary, Calgary, Alberta, Canada

    Reda Alhajj

  2. University of Calgary Computer Science, Calgary, Canada

    Jon Rokne

Section Editor information

  1. Yahoo Inc, London, UK

    Fabrizio Silvestri

  2. University of Calabria, Via Pietro Bucci, 42C, 87036, Arcavacata di Rende, Italy

    Andrea Tagarelli

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Science+Business Media LLC

About this entry

Cite this entry

Bockholt, M., Zweig, K.A. (2017). Paths in Complex Networks. In: Alhajj, R., Rokne, J. (eds) Encyclopedia of Social Network Analysis and Mining. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7163-9_110183-1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-7163-9_110183-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-7163-9

  • Online ISBN: 978-1-4614-7163-9

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation