Interpolating between Random Walks and Shortest Paths: a Path Functional Approach
General models of network navigation must contain a deterministic or drift component, encouraging the agent to follow routes of least cost, as well as a random or diffusive component, enabling free wandering. This paper proposes a thermodynamic formalism involving two path functionals, namely an ene...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Bavaud, François Guex, Guillaume |
| description | General models of network navigation must contain a deterministic or drift
component, encouraging the agent to follow routes of least cost, as well as a
random or diffusive component, enabling free wandering. This paper proposes a
thermodynamic formalism involving two path functionals, namely an energy
functional governing the drift and an entropy functional governing the
diffusion. A freely adjustable parameter, the temperature, arbitrates between
the conflicting objectives of minimising travel costs and maximising spatial
exploration. The theory is illustrated on various graphs and various
temperatures. The resulting optimal paths, together with presumably new
associated edges and nodes centrality indices, are analytically and numerically
investigated. |
| doi_str_mv | 10.48550/arxiv.1207.1253 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1207_1253</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1207_1253</sourcerecordid><originalsourceid>FETCH-LOGICAL-a653-d99bb8bbe7999db8a0a60f34e8581ffb49932e5ab72b14cfedc0b17c85b7ca5c3</originalsourceid><addsrcrecordid>eNotj71OwzAURr0woMLOVPkFUuw4rm22qqJQqVKBVmKM7nVsEpHakWP-3p62sHzfmY50CLnhbFZpKdktpO_uc8ZLpo4jxSV5Xofs0hB7yF14o-jyl3OBvkBo4oG-Qv8-0iPTXRtTdmOmT5Db8Y7CGejqI9jcxQA9XQxDimDbK3LhoR_d9f9PyH51v18-Fpvtw3q52BQwl6JojEHUiE4ZYxrUwGDOvKiclpp7j5UxonQSUJXIK-tdYxlyZbVEZUFaMSHTP-05qR5Sd4D0U5_S6lOa-AVUa0p1</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Interpolating between Random Walks and Shortest Paths: a Path Functional Approach</title><source>arXiv.org</source><creator>Bavaud, François ; Guex, Guillaume</creator><creatorcontrib>Bavaud, François ; Guex, Guillaume</creatorcontrib><description>General models of network navigation must contain a deterministic or drift
component, encouraging the agent to follow routes of least cost, as well as a
random or diffusive component, enabling free wandering. This paper proposes a
thermodynamic formalism involving two path functionals, namely an energy
functional governing the drift and an entropy functional governing the
diffusion. A freely adjustable parameter, the temperature, arbitrates between
the conflicting objectives of minimising travel costs and maximising spatial
exploration. The theory is illustrated on various graphs and various
temperatures. The resulting optimal paths, together with presumably new
associated edges and nodes centrality indices, are analytically and numerically
investigated.</description><identifier>DOI: 10.48550/arxiv.1207.1253</identifier><language>eng</language><subject>Computer Science - Social and Information Networks ; Physics - Physics and Society</subject><creationdate>2012-07</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1207.1253$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1207.1253$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Bavaud, François</creatorcontrib><creatorcontrib>Guex, Guillaume</creatorcontrib><title>Interpolating between Random Walks and Shortest Paths: a Path Functional Approach</title><description>General models of network navigation must contain a deterministic or drift
component, encouraging the agent to follow routes of least cost, as well as a
random or diffusive component, enabling free wandering. This paper proposes a
thermodynamic formalism involving two path functionals, namely an energy
functional governing the drift and an entropy functional governing the
diffusion. A freely adjustable parameter, the temperature, arbitrates between
the conflicting objectives of minimising travel costs and maximising spatial
exploration. The theory is illustrated on various graphs and various
temperatures. The resulting optimal paths, together with presumably new
associated edges and nodes centrality indices, are analytically and numerically
investigated.</description><subject>Computer Science - Social and Information Networks</subject><subject>Physics - Physics and Society</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj71OwzAURr0woMLOVPkFUuw4rm22qqJQqVKBVmKM7nVsEpHakWP-3p62sHzfmY50CLnhbFZpKdktpO_uc8ZLpo4jxSV5Xofs0hB7yF14o-jyl3OBvkBo4oG-Qv8-0iPTXRtTdmOmT5Db8Y7CGejqI9jcxQA9XQxDimDbK3LhoR_d9f9PyH51v18-Fpvtw3q52BQwl6JojEHUiE4ZYxrUwGDOvKiclpp7j5UxonQSUJXIK-tdYxlyZbVEZUFaMSHTP-05qR5Sd4D0U5_S6lOa-AVUa0p1</recordid><startdate>20120705</startdate><enddate>20120705</enddate><creator>Bavaud, François</creator><creator>Guex, Guillaume</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20120705</creationdate><title>Interpolating between Random Walks and Shortest Paths: a Path Functional Approach</title><author>Bavaud, François ; Guex, Guillaume</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a653-d99bb8bbe7999db8a0a60f34e8581ffb49932e5ab72b14cfedc0b17c85b7ca5c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Computer Science - Social and Information Networks</topic><topic>Physics - Physics and Society</topic><toplevel>online_resources</toplevel><creatorcontrib>Bavaud, François</creatorcontrib><creatorcontrib>Guex, Guillaume</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bavaud, François</au><au>Guex, Guillaume</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Interpolating between Random Walks and Shortest Paths: a Path Functional Approach</atitle><date>2012-07-05</date><risdate>2012</risdate><abstract>General models of network navigation must contain a deterministic or drift
component, encouraging the agent to follow routes of least cost, as well as a
random or diffusive component, enabling free wandering. This paper proposes a
thermodynamic formalism involving two path functionals, namely an energy
functional governing the drift and an entropy functional governing the
diffusion. A freely adjustable parameter, the temperature, arbitrates between
the conflicting objectives of minimising travel costs and maximising spatial
exploration. The theory is illustrated on various graphs and various
temperatures. The resulting optimal paths, together with presumably new
associated edges and nodes centrality indices, are analytically and numerically
investigated.</abstract><doi>10.48550/arxiv.1207.1253</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1207.1253 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1207_1253 |
| source | arXiv.org |
| subjects | Computer Science - Social and Information Networks Physics - Physics and Society |
| title | Interpolating between Random Walks and Shortest Paths: a Path Functional Approach |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T17%3A44%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Interpolating%20between%20Random%20Walks%20and%20Shortest%20Paths:%20a%20Path%20Functional%20Approach&rft.au=Bavaud,%20Fran%C3%A7ois&rft.date=2012-07-05&rft_id=info:doi/10.48550/arxiv.1207.1253&rft_dat=%3Carxiv_GOX%3E1207_1253%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |