相关论文: Propagation rules for (u,m,e,s)-nets and (u,e,s)-s…

Many complex systems are composed of interacting parts, and the underlying laws are usually simple and universal. While graph neural networks provide a useful relational inductive bias for modeling such systems, generalization to new system…

We expand upon a new theoretical framework for Diffusion Limited Aggregation and associated Dielectric Breakdown Models in two dimensions [R. C. Ball and E. Somfai, Phys. Rev. Lett. 89, 135503 (2002)]. Key steps are understanding how these…

Transmission line failures in power systems propagate non-locally, making the control of the resulting outages extremely difficult. In this work, we establish a mathematical theory that characterizes the patterns of line failure propagation…

Nets are generalisations of sequences involving possibly uncountable index sets; this notion was introduced about a century ago by Moore and Smith. They also established the generalisation to nets of various basic theorems of analysis due…

There has been considerable recent interest in the properties of networks, such as citation networks and the worldwide web, that grow by the addition of vertices, and a number of simple solvable models of network growth have been studied.…

We study Bayesian networks based on max-linear structural equations as introduced in Gissibl and Kl\"uppelberg [16] and provide a summary of their independence properties. In particular we emphasize that distributions for such networks are…

We investigate choice-driven network growth. In this model, nodes are added one by one according to the following procedure: for each addition event a set of target nodes is selected, each according to linear preferential attachment, and a…

In usual scale-free networks of Barabasi-Albert type, a newly added node selects randomly m neighbors from the already existing network nodes, proportionally to the number of links these had before. Then the number N(k) of nodes with k…

We consider two types of random networks grown in blocks. Hooking networks are grown from a set of graphs as blocks, each with a labelled vertex called a hook. At each step in the growth of the network, a vertex called a latch is chosen…

We review recent developments of the statistical properties of complex atomic spectra, based on the pioneering work of Claire Bauche-Arnoult and Jacques Bauche. We discuss several improvements of the statistical methods (UTA, SOSA) for the…

A network growth mechanism based on a two-step preferential rule is investigated as a model of network growth in which no global knowledge of the network is required. In the first filtering step a subset of fixed size $m$ of existing nodes…

This work describes how the formalization of complex network concepts in terms of discrete mathematics, especially mathematical morphology, allows a series of generalizations and important results ranging from new measurements of the…

In complex systems, information propagation can be defined as diffused or delocalized, weakly localized, and strongly localized. This study investigates the application of graph neural network models to learn the behavior of a linear…

The use of satellite networks has increased significantly in recent years due to their advantages over purely terrestrial systems, such as higher availability and coverage. However, to effectively provide these services, satellite networks…

We consider a problem of whether a property of holomorphic curves on a subset $X$ of the complex plane can be extended to the whole complex plane. In this paper, the property we consider is uniqueness of holomorphic curves. We introduce the…

Pseudo-splines of integer order $(m,\ell)$ were introduced by Daubechies, Han, Ron, and Shen as a family which allows interpolation between the classical B-splines and the Daubechies' scaling functions. The purpose of this paper is to…

We study three aspects of commutation classes of reduced decompositions: the number of commutation classes, the structures of their corresponding graphs, and the enumeration of subnetworks, a concept recently introduced by Warrington [21].…

Conventional studies of network growth models mainly look at the steady state degree distribution of the graph. Often long time behavior is considered, hence the initial condition is ignored. In this contribution, the time evolution of the…

We show that hypernetworks can be regarded as posets which, in their turn, have a natural interpretation as simplicial complexes and, as such, are endowed with an intrinsic notion of curvature, namely the Forman Ricci curvature, that…

Phylogenetic networks generalise phylogenetic trees and allow for the accurate representation of the evolutionary history of a set of present-day species whose past includes reticulate events such as hybridisation and lateral gene transfer.…