Random walks and flights over connected graphs and complex networks
Markov chains provide us with a powerful probabilistic tool that allows to study the structure of connected graphs in details. The statistics of events for Markov chains defined on connected graphs can be effectively studied by the method of generalized inverses which we review. The approach is also...
Gespeichert in:
| Veröffentlicht in: | Communications in nonlinear science & numerical simulation 2011, Vol.16 (1), p.21-55 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 55 |
|---|---|
| container_issue | 1 |
| container_start_page | 21 |
| container_title | Communications in nonlinear science & numerical simulation |
| container_volume | 16 |
| creator | Volchenkov, D. |
| description | Markov chains provide us with a powerful probabilistic tool that allows to study the structure of connected graphs in details. The statistics of events for Markov chains defined on connected graphs can be effectively studied by the method of generalized inverses which we review. The approach is also applicable for directed graphs and interacting networks which share the set of nodes. We discuss a generalization of Lévy flight random walks for large complex networks and study the interplay between the nonlinearity of diffusion process and the topological structure of the network. |
| doi_str_mv | 10.1016/j.cnsns.2010.02.016 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_818831126</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1007570410001127</els_id><sourcerecordid>818831126</sourcerecordid><originalsourceid>FETCH-LOGICAL-c335t-2212ae734b1b2fdc303ce6b978ba567883c32c1bf68327e25ad82ac344cfff023</originalsourceid><addsrcrecordid>eNp9kMtOwzAURC0EEqXwBWyyY5XgRxK7Cxao4iVVQkKwthznuk2a2MFOW_h7XMKa1R2Nzox0B6FrgjOCSXnbZtoGGzKKo4NpFr0TNCOCi5RTnp9GjTFPC47zc3QRQosjsSjyGVq-KVu7PjmobhuSqBPTNevNGBK3B59oZy3oEepk7dWwmQjt-qGDr8TCeHB-Gy7RmVFdgKu_O0cfjw_vy-d09fr0srxfpZqxYkwpJVQBZ3lFKmpqzTDTUFYLLipVlFwIphnVpDKlYJQDLVQtqNIsz7UxBlM2RzdT7-Dd5w7CKPsmaOg6ZcHtghQkdhBCy0iyidTeheDByME3vfLfkmB5XEy28ncxeVxMYiqjF1N3UwriE_sGvAy6AauhbnwcQdau-Tf_A-hrddY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>818831126</pqid></control><display><type>article</type><title>Random walks and flights over connected graphs and complex networks</title><source>ScienceDirect Journals (5 years ago - present)</source><creator>Volchenkov, D.</creator><creatorcontrib>Volchenkov, D.</creatorcontrib><description>Markov chains provide us with a powerful probabilistic tool that allows to study the structure of connected graphs in details. The statistics of events for Markov chains defined on connected graphs can be effectively studied by the method of generalized inverses which we review. The approach is also applicable for directed graphs and interacting networks which share the set of nodes. We discuss a generalization of Lévy flight random walks for large complex networks and study the interplay between the nonlinearity of diffusion process and the topological structure of the network.</description><identifier>ISSN: 1007-5704</identifier><identifier>EISSN: 1878-7274</identifier><identifier>DOI: 10.1016/j.cnsns.2010.02.016</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Complex networks ; Electrical networks ; Graph theory ; Graphs ; Lévy flights ; Markov chains ; Mathematical models ; Networks ; Nonlinearity ; Random walk ; Random walks ; Statistics</subject><ispartof>Communications in nonlinear science & numerical simulation, 2011, Vol.16 (1), p.21-55</ispartof><rights>2010 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c335t-2212ae734b1b2fdc303ce6b978ba567883c32c1bf68327e25ad82ac344cfff023</citedby><cites>FETCH-LOGICAL-c335t-2212ae734b1b2fdc303ce6b978ba567883c32c1bf68327e25ad82ac344cfff023</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.cnsns.2010.02.016$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3548,4022,27922,27923,27924,45994</link.rule.ids></links><search><creatorcontrib>Volchenkov, D.</creatorcontrib><title>Random walks and flights over connected graphs and complex networks</title><title>Communications in nonlinear science & numerical simulation</title><description>Markov chains provide us with a powerful probabilistic tool that allows to study the structure of connected graphs in details. The statistics of events for Markov chains defined on connected graphs can be effectively studied by the method of generalized inverses which we review. The approach is also applicable for directed graphs and interacting networks which share the set of nodes. We discuss a generalization of Lévy flight random walks for large complex networks and study the interplay between the nonlinearity of diffusion process and the topological structure of the network.</description><subject>Complex networks</subject><subject>Electrical networks</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Lévy flights</subject><subject>Markov chains</subject><subject>Mathematical models</subject><subject>Networks</subject><subject>Nonlinearity</subject><subject>Random walk</subject><subject>Random walks</subject><subject>Statistics</subject><issn>1007-5704</issn><issn>1878-7274</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNp9kMtOwzAURC0EEqXwBWyyY5XgRxK7Cxao4iVVQkKwthznuk2a2MFOW_h7XMKa1R2Nzox0B6FrgjOCSXnbZtoGGzKKo4NpFr0TNCOCi5RTnp9GjTFPC47zc3QRQosjsSjyGVq-KVu7PjmobhuSqBPTNevNGBK3B59oZy3oEepk7dWwmQjt-qGDr8TCeHB-Gy7RmVFdgKu_O0cfjw_vy-d09fr0srxfpZqxYkwpJVQBZ3lFKmpqzTDTUFYLLipVlFwIphnVpDKlYJQDLVQtqNIsz7UxBlM2RzdT7-Dd5w7CKPsmaOg6ZcHtghQkdhBCy0iyidTeheDByME3vfLfkmB5XEy28ncxeVxMYiqjF1N3UwriE_sGvAy6AauhbnwcQdau-Tf_A-hrddY</recordid><startdate>2011</startdate><enddate>2011</enddate><creator>Volchenkov, D.</creator><general>Elsevier B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>2011</creationdate><title>Random walks and flights over connected graphs and complex networks</title><author>Volchenkov, D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c335t-2212ae734b1b2fdc303ce6b978ba567883c32c1bf68327e25ad82ac344cfff023</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Complex networks</topic><topic>Electrical networks</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Lévy flights</topic><topic>Markov chains</topic><topic>Mathematical models</topic><topic>Networks</topic><topic>Nonlinearity</topic><topic>Random walk</topic><topic>Random walks</topic><topic>Statistics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Volchenkov, D.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Communications in nonlinear science & numerical simulation</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Volchenkov, D.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Random walks and flights over connected graphs and complex networks</atitle><jtitle>Communications in nonlinear science & numerical simulation</jtitle><date>2011</date><risdate>2011</risdate><volume>16</volume><issue>1</issue><spage>21</spage><epage>55</epage><pages>21-55</pages><issn>1007-5704</issn><eissn>1878-7274</eissn><abstract>Markov chains provide us with a powerful probabilistic tool that allows to study the structure of connected graphs in details. The statistics of events for Markov chains defined on connected graphs can be effectively studied by the method of generalized inverses which we review. The approach is also applicable for directed graphs and interacting networks which share the set of nodes. We discuss a generalization of Lévy flight random walks for large complex networks and study the interplay between the nonlinearity of diffusion process and the topological structure of the network.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.cnsns.2010.02.016</doi><tpages>35</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1007-5704 |
| ispartof | Communications in nonlinear science & numerical simulation, 2011, Vol.16 (1), p.21-55 |
| issn | 1007-5704 1878-7274 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_818831126 |
| source | ScienceDirect Journals (5 years ago - present) |
| subjects | Complex networks Electrical networks Graph theory Graphs Lévy flights Markov chains Mathematical models Networks Nonlinearity Random walk Random walks Statistics |
| title | Random walks and flights over connected graphs and complex networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T08%3A53%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Random%20walks%20and%20flights%20over%20connected%20graphs%20and%20complex%20networks&rft.jtitle=Communications%20in%20nonlinear%20science%20&%20numerical%20simulation&rft.au=Volchenkov,%20D.&rft.date=2011&rft.volume=16&rft.issue=1&rft.spage=21&rft.epage=55&rft.pages=21-55&rft.issn=1007-5704&rft.eissn=1878-7274&rft_id=info:doi/10.1016/j.cnsns.2010.02.016&rft_dat=%3Cproquest_cross%3E818831126%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=818831126&rft_id=info:pmid/&rft_els_id=S1007570410001127&rfr_iscdi=true |