From Graph Centrality to Data Depth

Two recent papers in Physical Review E by Callaway, Hopcroft, Kleinberg, Newman, and Strogatz, and Dorogovstev, Mendes, and Samukhin have computed the critical value of this

Finally, we show the ubiquity of finitely generated free dense subgroups of the automorphism group of the Random Graph whose action on it have all orbits

At the end of the paper, we also prove a general result ensuring that any strongly reinforced VRRW on any bounded degree graph localizes a.s.. Then the following

In order to evaluate the proposed centrality measure we computed the mint centrality for the first 200,000 blocks of the public bitcoin blockchain.. We then inspected the 50

Yves Guivarc’H, Emile Le Page. On the homogeneity at infinity of the stationary probability for an affine random walk. Siddhartha Bhattacharya, Tarun Das, Anish Ghosh and Riddhi

Abstract: Numerous studies show that most known real-world complex networks share similar properties in their connectivity and degree distribution. They are called small worlds.

We use the finite Markov chain embedding technique to obtain the distribution of the number of cycles in the breakpoint graph of a random uniform signed permutation.. This further

Using these definitions, we propose a spec- tral characterisation of WSS graph signals allowing to study stationarity using only the spectral components of a graph sig- nal..