相关论文: Laplacian networks: growth, local symmetry and sha…

We introduce a formalism of fractional diffusion on networks based on a fractional Laplacian matrix that can be constructed directly from the eigenvalues and eigenvectors of the Laplacian matrix. This fractional approach allows random walks…

The small-world property is known to have a profound effect on the navigation efficiency of complex networks [J. M. Kleinberg, Nature 406, 845 (2000)]. Accordingly, the proper addition of shortcuts to a regular substrate can lead to the…

Time plays an essential role in the diffusion of information, influence and disease over networks. In many cases we only observe when a node copies information, makes a decision or becomes infected -- but the connectivity, transmission…

Diffusion processes are instrumental to describe the movement of a continuous quantity in a generic network of interacting agents. Here, we present a probabilistic framework for diffusion in networks and propose to classify agent…

The innumerable shapes of plant leaves present a challenge to the explanatory power of biophysical theory. A model is needed that can produce these shapes with a small set of parameters. This paper presents a simple model of leaf shape…

The method of iterated conformal maps for the study of Diffusion Limited Aggregates (DLA) is generalized to the study of Laplacian Growth Patterns and related processes. We emphasize the fundamental difference between these processes: DLA…

Physical systems with complex unsteady dynamics, such as fluid flows, are often poorly represented by a single mean solution. For many practical applications, it is crucial to access the full distribution of possible states, from which…

The theory of random matrices with eigenvalues distributed in the complex plane and more general "beta-ensembles" (logarithmic gases in 2D) is reviewed. The distribution and correlations of the eigenvalues are investigated in the large N…

We consider distributed networks, such as peer-to-peer networks, whose structure can be manipulated by adjusting the rules by which vertices enter and leave the network. We focus in particular on degree distributions and show that, with…

Vascular networks are used across the kingdoms of life to transport fluids, nutrients and cellular material. A popular unifying idea for understanding the diversity and constraints of these networks is that the conduits making up the…

One of the most important features observed in real networks is that, as a network's topology evolves so does the network's ability to perform various complex tasks. To explain this, it has also been observed that as a network grows certain…

The ability of Graph Neural Networks (GNNs) to capture long-range and global topology information is limited by the scope of conventional graph Laplacian, leading to unsatisfactory performance on some datasets, particularly on heterophilic…

In the present paper we study two sequences of real numbers associated to a symplectic diffeomorphism: the uniform norm of the differential of its n-th iteration and the word length of its n-th iteration. In the latter case we assume that…

A direct transient growth analysis for three-dimensional perturbations to flow past a periodic array of T-106/300 low-pressure turbine fan blades is presented. The methodology is based on a singular value decomposition of the flow evolution…

In a recent paper, McDiarmid, Semple, and Welsh (2015) showed that the number of tree-child networks with $n$ leaves has the factor $n^{2n}$ in its main asymptotic growth term. In this paper, we improve this by completely identifying the…

In this paper we study $\infty$-Laplacian type diffusion equations in weighted graphs obtained as limit as $p\to \infty$ to two types of $p$-Laplacian evolution equations in such graphs. We propose these diffusion equations, that are…

We study the behavior of network diffusions based on the PageRank random walk from a set of seed nodes. These diffusions are known to reveal small, localized clusters (or communities) and also large macro-scale clusters by varying a…

This paper proposes an attributed network growth model. Despite the knowledge that individuals use limited resources to form connections to similar others, we lack an understanding of how local and resource-constrained mechanisms explain…

In this paper, we consider a network of agents with Laplacian dynamics, and study the problem of improving network robustness by adding a maximum number of edges within the network while preserving a lower bound on its strong structural…

From social interactions to the human brain, higher-order networks are key to describe the underlying network geometry and topology of many complex systems. While it is well known that network structure strongly affects its function, the…