Weighted network motifs as random walk patterns

  title={Weighted network motifs as random walk patterns},
  author={Franco Ruzzenenti and Francesco Picciolo and Petter Holme and Rossana Mastrandrea},
  journal={New Journal of Physics},
Over the last two decades, network theory has shown to be a fruitful paradigm in understanding the organization and functioning of real-world complex systems. One technique helpful to this endeavor is identifying functionally influential subgraphs, shedding light on underlying evolutionary processes. Such overrepresented subgraphs, motifs, have received much attention in simple networks, where edges are either on or off. However, for weighted networks, motif analysis is still undeveloped. Here… 
1 Citations

Analysis of the structure and time-series evolution of knowledge label network from a complex perspective

The results show that the degree sequence distribution of the KLN is power-law distributed during the growth process, and it performs better in the mature stage of network development, and the network shows more stable scale-free characteristics.



and a at

The xishacorene natural products are structurally unique apolar diterpenoids that feature a bicyclo[3.3.1] framework. These secondary metabolites likely arise from the well-studied, structurally

AY's Neuroanatomy of C. elegans for Computation

This paper presents a model for studying NERVOUS SYSTEMS by COMPUTATION, a model based on C. ELEGANS ANATOMY, and some of the results suggest that this model may not be suitable for use in the real world.

Random walks on graphs

Most of the material in this handout is taken from: Daniel Spielman, Spectral and Algebraic Graph Theory. Manuscript, 2019. Let A be the adjacency matrix of a graph G. We use α1 ≥ · · · ≥ αn to


The spectrum, asymmetry, and spirality of the electrons from decay are calculatedfrom the most general form of the two-component neutrino theory with lepton conservatipn. In addition to the nonlocal

Pacific-Asia Conf. Knowledge Discovery and Data Mining (Berlin: Springer

  • 2008

Open Econ

  • Rev. 29, 1039
  • 2018

Resolut 46

  • 712
  • 2002

New J

  • Phys. 13, 083001
  • 2011

IEEE Transactions on Knowledge and Data Engineering 16

  • 1038
  • 2004