相关论文: Recurrence of random walk traces

We introduce a new type of random walk where the definition of edge reinforcement is very different from the one in the reinforced random walk models studied so far, and investigate its basic properties, such as null/positive recurrence,…

Reinforced random walks are random walks on graphs whose transition probabilities along edges from a vertex are proportional to the weights of those edges, but where the weight of an edge evolves in a way that depends on the past traversals…

We consider a class of multi-particle reinforced interacting random walks. In this model, there are some (finite or infinite) particles performing random walks on a given (finite or infinite) connected graph, so that each particle has…

We model financial transactions as random walks on activity-driven temporal networks. By enforcing fund conservation, our framework analytically derives heavy-tailed distributions for the stationary balances and transaction sizes.…

In this paper, we investigate the exact asymptotic behavior of the connectivity probability in the Erdos-Renyi graph G(n,p), under different asymptotic assumptions on the edge probability p=p(n). We propose a novel approach based on the…

We construct a renewal structure for random walks on surface groups. The renewal times are defined as times when the random walks enters a particular type of a cone and never leaves it again. As a consequence, the trajectory of the random…

Network motifs are characteristic patterns which occur in the networks essentially more frequently than the other patterns. For five motifs found in S. Itzkovitz, U. Alon, Phys. Rev.~E, 2005, 71, 026117-1, hierarchical random graphs are…

Random walks are studied on disordered cellular networks in 2-and 3-dimensional spaces with arbitrary curvature. The coefficients of the evolution equation are calculated in term of the structural properties of the cellular system. The…

We introduce a self-organized model of graph evolution associated with preferential network random walkers. The idea is developed by using two different types of walkers, the interactions of which lead to a dynamic graph. The walkers of the…

We consider a recent model of random walk that recursively grows the network on which it evolves, namely the Tree Builder Random Walk (TBRW). We introduce a bias $\rho \in (0,\infty)$ towards the root, and exhibit a phase transition for…

Complex numbers define the relationship between entities in many situations. A canonical example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics. Recent years have seen an increasing interest to extend the tools…

Random walks on networks are widely used to model stochastic processes such as search strategies, transportation problems or disease propagation. A prominent example of such process is the guiding of naive T cells by the lymph node conduits…

The jump graph $J(G)$ of a simple graph $G$ has vertices which represent edges in $G$ where two vertices in $J(G)$ are adjacent if and only if the corresponding edges in $G$ do not share an endpoint. In this paper, we examine sequences of…

This paper uses the theory of covering graphs to characterize some of the edge-transitive graphs which can arise as token graphs.

Random walks find extensive application across various complex network domains, including embedding generation and link prediction. Despite the widespread utilization of random walks, the precise impact of distinct biases on embedding…

Consider a finite inhomogeneous random graph running in continuous time, where each vertex has a mass, and the edge that links any pair of vertices appears with a rate equal to the product of their masses. The simultaneous…

It is shown that transient graphs for the simple random walk do not admit a nearest neighbor transient Markov chain (not necessarily a reversible one), that crosses all edges with positive probability, while there is such chain for the…

The betweenness centrality of graphs using random walk paths instead of geodesics is studied. A scaling collapse with no adjustable parameters is obtained as the graph size $N$ is varied; the scaling curve depends on the graph model. A…

We prove that if a unimodular random rooted graph is recurrent, the number of ends of its uniform spanning tree is almost surely equal to the number of ends of the graph. Together with previous results in the transient case, this completely…

Hypergraphs have been a recent focus of study in mathematical data science as a tool to understand complex networks with high-order connections. One question of particular relevance is how to leverage information carried in hypergraph…