Related papers: Walk Entropies in Graphs
Entropy production (EP) is known as a fundamental quantity for measuring the irreversibility of processes in thermal equilibrium and states far from equilibrium. In stochastic thermodynamics, the EP becomes more visible in terms of the…
In this article we introduce an entropy-based, scale-dependent centrality that is evaluated as the Shannon entropy of the distribution at time t of a continuous-time random walk. It ranks nodes as a function of the time t, which acts as a…
For various purposes and, in particular, in the context of data compression, a graph can be examined at three levels. Its structure can be described as the unlabeled version of the graph; then the labeling of its structure can be added; and…
I consider the possibility that Gaussian random walk statistics are sufficient to trap nanoscopic additives at either a polymer interface or surface. When an additive particle goes to the free surface, two portions of the polymer surface…
The Maximal Entropy Random Walk (MERW) is a natural process on a finite graph, introduced a few years ago with motivations from theoretical physics. The construction of this process relies on Perron-Frobenius theory for adjacency matrices.…
We quantitatively differentiate between the spreads of discrete-time quantum and classical random walks on a cyclic graph. Due to the closed nature of any cyclic graph, there is additional "collision"- like interference in the quantum…
We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…
Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…
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…
In this note we do the analysis of entanglement entropy more carefully when the non-conformal theory flows to a non-trivial IR fixed point. In particular we emphasize the role of the trace of the energy-momentum tensor in these…
For certain groups, parabolic subgroups appear as stabilizers of flags of sets or vector spaces. Quotients by these parabolic subgroups represent orbits of flags, and their cardinalities asymptotically reveal entropies (as rates of…
Focusing on coupling between edges, we generalize the relationship between the normalized graph Laplacian and random walks on graphs by devising an appropriate normalization for the Hodge Laplacian -- the generalization of the graph…
For any pseudo-Anosov diffeomorphism on a closed orientable surface $S$ of genus greater than one, it is known by the work of Bers and Thurston that the topological entropy agrees with the translation distance on the Teichm\"uller space…
In this work, Transition Probability Matrix (TPM) is proposed as a new method for extracting the features of nodes in the graph. The proposed method uses random walks to capture the connectivity structure of a node's close neighborhood. The…
In this expository note, we study several families of periodic graphs which satisfy a sufficient condition for the ergodicity of the associated continuous-time quantum walk. For these graphs, we compute the limiting distribution of the walk…
The concept of node walk in graphs and complex networks has been addressed, consisting of one or more nodes that move into adjacent nodes, henceforth incorporating the respective connections. This type of dynamics is then applied to subsume…
We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.
Quantum walks, both discrete (coined) and continuous time, form the basis of several recent quantum algorithms. Here we use numerical simulations to study the properties of discrete, coined quantum walks. We investigate the variation in the…
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…
We investigate the Drazin invertibility of adjacency matrices associated with a class of oriented graphs known as oriented Dutch windmill graphs. By analyzing walks of prescribed lengths and exploiting the structure of the minimal…