中文
相关论文

相关论文: Random walks on graphs: ideas, techniques and resu…

200 篇论文

In the study of dynamical processes on networks, there has been intense focus on network structure -- i.e., the arrangement of edges and their associated weights -- but the effects of the temporal patterns of edges remains poorly…

物理与社会 · 物理学 2015-06-16 Till Hoffmann , Mason A. Porter , Renaud Lambiotte

A Random Walk in Changing Environment (RWCE) is a weighted random walk on a locally finite, connected graph $G$ with random, time-dependent edge-weights. This includes self-interacting random walks, where the edge-weights depend on the…

概率论 · 数学 2024-06-24 Bryan Park , Souvik Ray

The concept of random dynamical system is a comparatively recent development combining ideas and methods from the well developed areas of probability theory and dynamical systems. Due to our inaccurate knowledge of the particular physical…

动力系统 · 数学 2007-05-23 Vitor Araujo

We investigate unimodular random networks. Our motivations include their characterization via reversibility of an associated random walk and their similarities to unimodular quasi-transitive graphs. We extend various theorems concerning…

概率论 · 数学 2020-05-20 David Aldous , Russell Lyons

Graph vertex embeddings based on random walks have become increasingly influential in recent years, showing good performance in several tasks as they efficiently transform a graph into a more computationally digestible format while…

机器学习 · 统计学 2021-07-22 Dominik Kloepfer , Angelica I. Aviles-Rivero , Daniel Heydecker

Graphs are useful structures that can model several important real-world problems. Recently, learning graphs have drawn considerable attention, leading to the proposal of new methods for learning these data structures. One of these studies…

机器学习 · 计算机科学 2020-01-07 Amir Jalilifard , Vinicius Caridá , Alex Mansano , Rogers Cristo

A functional approach for the study of the random walks in random sceneries (RWRS) is proposed. Under fairly general assumptions on the random walk and on the random scenery, functional limit theorems are proved. The method allows to study…

概率论 · 数学 2009-03-06 Clément Dombry , Nadine Guillotin-Plantard

We establish recurrence criteria for sums of independent random variables which take values in Euclidean lattices of varying dimension. In particular, we describe transient inhomogenous random walks in the plane which interlace two…

概率论 · 数学 2007-05-23 Itai Benjamini , Robin Pemantle , Yuval Peres

Random walks on multidimensional nonlinear landscapes are of interest in many areas of science and engineering. In particular, properties of adaptive trajectories on fitness landscapes determine population fates and thus play a central role…

种群与进化 · 定量生物学 2014-10-08 Michael Manhart , Alexandre V. Morozov

A popular account of the connection between random walks and electric networks.

概率论 · 数学 2007-05-23 Peter G. Doyle , J. Laurie Snell

Simple random walks on various types of partially horizontally oriented regular lattices are considered. The horizontal orientations of the lattices can be of various types (deterministic or random) and depending on the nature of the…

概率论 · 数学 2007-05-23 Massimo Campanino , Dimitri Petritis

We present a new approach of topology biased random walks for undirected networks. We focus on a one parameter family of biases and by using a formal analogy with perturbation theory in quantum mechanics we investigate the features of…

统计力学 · 物理学 2010-12-09 Vinko Zlatić , Andrea Gabrielli , Guido Caldarelli

Machine learning, deep learning, and NLP methods on knowledge graphs are present in different fields and have important roles in various domains from self-driving cars to friend recommendations on social media platforms. However, to apply…

机器学习 · 计算机科学 2024-09-25 Elika Bozorgi , Sakher Khalil Alqaiidi , Afsaneh Shams , Hamid Reza Arabnia , Krzysztof Kochut

We show that the edges crossed by a random walk in a network form a recurrent graph a.s. In fact, the same is true when those edges are weighted by the number of crossings.

概率论 · 数学 2009-09-29 Itai Benjamini , Ori Gurel-Gurevich , Russell Lyons

In this article, we develop a theory for understanding the traces left by a random walk in the vicinity of a randomly chosen reference vertex. The analysis is related to interlacements but goes beyond previous research by showing weak limit…

概率论 · 数学 2024-03-25 Steffen Dereich

We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…

概率论 · 数学 2023-07-26 Theo van Uem

Hypergraphs are used in machine learning to model higher-order relationships in data. While spectral methods for graphs are well-established, spectral theory for hypergraphs remains an active area of research. In this paper, we use random…

机器学习 · 计算机科学 2019-05-22 Uthsav Chitra , Benjamin J Raphael

Natural data offer a hard challenge to data analysis. One set of tools is being developed by several teams to face this difficult task: Persistent topology. After a brief introduction to this theory, some applications to the analysis and…

代数拓扑 · 数学 2017-08-21 Massimo Ferri

A graph theoretic perspective is taken for a range of phenomena in continuum physics in order to develop representations for analysis of large scale, high-fidelity solutions to these problems. Of interest are phenomena described by partial…

计算物理 · 物理学 2019-05-22 R. Banerjee , K. Sagiyama , G. H. Teichert , K. Garikipati

Characterization of real-world complex systems increasingly involves the study of their topological structure using graph theory. Among global network properties, small-world property, consisting in existence of relatively short paths…

社会与信息网络 · 计算机科学 2017-02-28 Jaroslav Hlinka , David Hartman , Milan Paluš