Related papers: Average chain transitivity and the almost average …
We develop a full theoretical approach to clustering in complex networks. A key concept is introduced, the edge multiplicity, that measures the number of triangles passing through an edge. This quantity extends the clustering coefficient in…
I start by reviewing some basic properties of random graphs. I then consider the role of random walks in complex networks and show how they may be used to explain why so many long tailed distributions are found in real data sets. The key…
If $X$ is a graph with adjacency matrix $A$, then we define $H(t)$ to be the operator $\exp(itA)$. The Schur (or entrywise) product $H(t)\circ H(-t)$ is a doubly stochastic matrix and, because of work related to quantum computing, we are…
We investigate the behaviour of a chain of interacting Brownian particles with one end fixed and the other moving away at slow speed, in the limit of small noise. The interaction between particles is through a pairwise potential with finite…
Consider a graph whose edges have been colored red and blue. Assign a nonnegative real weight to every edge so that at every vertex, the sum of the weights of the incident red edges equals the sum of the weights of the incident blue edges.…
We study the properties of $\Phi$-irregular sets (sets of points for which the Birkhoff average diverges) in dynamical systems with the shadowing property. We estimate the topological entropy of $\Phi$-irregular set in terms of entropy on…
In this paper, we introduce the concepts of $\omega$-limit sets and pseudo orbits for a tree-shift defined on a Markov-Cayley tree, extending the results of tree-shifts defined on $d$-trees [5,6]. Firstly, we establish the relationships…
Markov chains are a class of probabilistic models that have achieved widespread application in the quantitative sciences. This is in part due to their versatility, but is compounded by the ease with which they can be probed analytically.…
Several studies have so far investigated transport properties of strongly correlated systems. Interesting features of these materials are the lack of resistivity saturation well beyond the Mott-Ioffe-Regel limit and the scaling of the…
In many situations, the statistical properties of wave systems with chaotic classical limits are well-described by random matrix theory. However, applications of random matrix theory to scattering problems require introduction of system…
Transients are fundamental to ecological systems with significant implications to management, conservation, and biological control. We uncover a type of transient synchronization behavior in spatial ecological networks whose local dynamics…
We study assortative mixing in networks, the tendency for vertices in networks to be connected to other vertices that are like (or unlike) them in some way. We consider mixing according to discrete characteristics such as language or race…
We study numerically scattering and transport statistical properties of tight-binding random networks characterized by the number of nodes $N$ and the average connectivity $\alpha$. We use a scattering approach to electronic transport and…
We develop a general theory of Markov chains realizable as random walks on $\mathscr R$-trivial monoids. It provides explicit and simple formulas for the eigenvalues of the transition matrix, for multiplicities of the eigenvalues via…
An avalanche or cascade occurs when one event causes one or more subsequent events, which in turn may cause further events in a chain reaction. Avalanching dynamics are studied in many disciplines, with a recent focus on average avalanche…
Totally asymmetric simple exclusion processes, consisting of two coupled parallel lattice chains with particles interacting with hard-core exclusion and moving along the channels and between them, are considered. In the limit of strong…
This short note is a supplement to [1], in which the total variation of graph distributional signals is introduced and studied. We introduce a different formulation of total variation and relate it to the notion of edge centrality. The…
A characteristic property of networks is their ability to propagate influences, such as infectious diseases, behavioral changes, and failures. An especially important class of such contagious dynamics is that of cascading processes. These…
The mixer chain on a graph G is the following Markov chain. Place tiles on the vertices of G, each tile labeled by its corresponding vertex. A "mixer" moves randomly on the graph, at each step either moving to a randomly chosen neighbor, or…
In this article we give an in depth overview of the recent advances in the field of equilibrium networks. After outlining this topic, we provide a novel way of defining equilibrium graph (network) ensembles. We illustrate this concept on…