Related papers: Nonlinear Diffusion Through Large Complex Networks…
We consider single-particle quantum transport on parametrized complex networks. Based on general arguments regarding the spectrum of the corresponding Hamiltonian, we derive bounds for a measure of the global transport efficiency defined by…
We derive a renormalization method to calculate the spectral dimension $\bar{d}$ of deterministic self-similar networks with arbitrary base units and branching constants. The generality of the method allows the affect of a multitude of…
Traditional random graph models of networks generate networks that are locally tree-like, meaning that all local neighborhoods take the form of trees. In this respect such models are highly unrealistic, most real networks having strongly…
The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precisely, we give a finite family of tree-like patterns and prove…
Transport is an important function in many network systems and understanding its behavior on biological, social, and technological networks is crucial for a wide range of applications. However, it is a property that is not well-understood…
In this paper, we study a class of equations representing nonlinear diffusion on networks. A particular instance of our model can be seen as a network equivalent of the porous-medium equation. We are interested in studying perturbations of…
Two-dimensional networks of ordered quantum dots beyond the percolation threshold are studied, as typical example of conducting nanostructures with quenched random disorder. Theory predicts anomalous diffusion with stretched-exponential…
We consider singularly perturbed convection-diffusion equations on one-dimensional networks (metric graphs) as well as the transport problems arising in the vanishing diffusion limit. Suitable coupling condition at inner vertices are…
Anomalous finite-temperature transport has recently been observed in numerical studies of various integrable models in one dimension; these models share the feature of being invariant under a continuous non-abelian global symmetry. This…
After a failure or attack the structure of a complex network changes due to node removal. Here, we show that the degree distribution of the distorted network, under any node disturbances, can be easily computed through a simple formula.…
We study diffusion of information packets on several classes of structured networks. Packets diffuse from a randomly chosen node to a specified destination in the network. As local transport rules we consider random diffusion and an…
The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small world property of real…
Two new classes of networks are introduced that resemble small-world properties. These networks are recursively constructed but retain a fixed, regular degree. They consist of a one-dimensional lattice backbone overlayed by a hierarchical…
Superdiffusion is an anomalous transport behavior. Recently, a new mechanism, termed the ``nodal mechanism," has been proposed to induce superdiffusion in quantum models. However, existing realizations of the nodal mechanism have so far…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
We give new decomposition theorems for classes of graphs that can be transduced in first-order logic from classes of sparse graphs -- more precisely, from classes of bounded expansion and from nowhere dense classes. In both cases, the…
We make progress towards an analytical understanding of the regime of validity of perturbation theory for large scale structures and the nature of some non-perturbative corrections. We restrict ourselves to 1D gravitational collapse, for…
It has long been known that a uniform distribution of matter cannot produce a Poisson distribution of density fluctuations on very large scales $1/k > ct$ by the motion of discrete particles over timescale $t$. The constraint is part of…
Transport of rodlike particles in confinement environments of macromolecular networks plays crucial roles in many important biological processes and technological applications. The relevant understanding has been limited to thin rods with…
We examine the heterogeneous responses of individual nodes in sparse networks to the random removal of a fraction of edges. Using the message-passing formulation of percolation, we discover considerable variation across the network in the…