Random subnetworks of random sorting networks.
Angel, Omer, Holroyd, Alexander E. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Failure of random networks.”
Random subnetworks of random sorting networks.
TPM: Transition probability matrix - Graph structural feature based embedding
Sarmad N. Mohammed, Semra Gündüç (2023)
Kybernetika
Similarity:
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 information obtained from random walks is converted to anonymous walks to extract the topological features of nodes. In the embedding process of nodes, anonymous walks are used since they capture the topological similarities of connectivities better...
First hitting times of simple random walks on graphs with congestion points.
Kang, Mihyun (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On the paradox of three random variables
S. Trybuła (1961)
Applicationes Mathematicae
Similarity:
On the paradox of n random variables
S. Trybuła (1965)
Applicationes Mathematicae
Similarity:
A central limit theorem for random walks in random labyrinths
Carol Bezuidenhout, Geoffrey Grimmett (1999)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
On algorithmical testing tables of random numbers.
D. Banjevic, Z. Ivkovic (1979)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
On the range of the simple random walk bridge on groups.
Benjamini, Itai, Izkovsky, Roey, Kesten, Harry (2007)
Electronic Journal of Probability [electronic only]
Similarity:
Transportation networks with random arc capacities
P. Doulliez, E. Jamoulle (1972)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: