相关论文: A Vectored Fragmentation Metric for Elastic Optica…

Although there is increasing evidence of criticality in the brain, the processes that guide neuronal networks to reach or maintain criticality remain unclear. The present research examines the role of neuronal gain plasticity in time-series…

The elasticity of disordered and polydisperse polymer networks is a fundamental problem of soft matter physics that is still open. Here, we self-assemble polymer networks via simulations of a mixture of bivalent and tri- or tetravalent…

This paper introduces a novel metric, termed the Generalized Fiedler Vector (GFV), to evaluate the \textit{dynamic connectivity} in power systems. The proposed metric leverages the network connectivity, represented by the system Laplacian…

Here we employ both dynamic and geometric phase control of light to produce radially modulated vector-vortex modes, the natural modes of optical fibers. We then measure these modes using a vector modal decomposition set-up as well as a…

Metric dimension is an essential parameter in graph theory that aids in addressing issues pertaining to information retrieval, localization, network design, and chemistry through the identification of the least possible number of elements…

Fully convolutional networks (FCNs), including UNet and VNet, are widely-used network architectures for semantic segmentation in recent studies. However, conventional FCN is typically trained by the cross-entropy or Dice loss, which only…

Using Optical Orthogonal Frequency Multiplexing (O-OFDM), variable bandwidth channels can be created in Elastic Optical Networks (EON). This allows the use of spectrum more efficiently by allocating integral multiple of basic bandwidth…

Complex networks have recently attracted much attention in diverse areas of science and technology. Many networks such as the WWW and biological networks are known to display spatial heterogeneity which can be characterized by their fractal…

Fragment-Based Drug Discovery (FBDD) is a popular approach in early drug development, but designing effective linkers to combine disconnected molecular fragments into chemically and pharmacologically viable candidates remains challenging.…

Our first experience of dimension typically comes in the intuitive Euclidean sense: a line is one dimensional, a plane is two-dimensional, and a volume is three-dimensional. However, following the work of Mandelbrot \cite{mandelbrot},…

We study the geometrical features of the order parameter's fluctuations near the critical point of mixed-order phase transitions in randomly interdependent spatial networks. In contrast to continuous transitions, where the structure of the…

In this paper, we present the outer product decomposition of a product of compatible linked networks. It provides a foundation for the fractional approach in network analysis. We discuss the standard and Newman's normalization of networks.…

The degree distribution is an important characteristic of complex networks. In many applications, quantification of degree distribution in the form of a fixed-length feature vector is a necessary step. On the other hand, we often need to…

The improved city clustering algorithm can be used to identify urban boundaries on a digital map, and the results are a set of isolines. The relationships between the urban measurements within the variable boundaries follow allometric…

Optical backbone networks are required to be highly dynamic in supporting requests with flexible bandwidth granularities to cope with the demands of new broadband wireless and fixed access networks. To provide this flexibility, services are…

Network embedding which encodes all vertices in a network as a set of numerical vectors in accordance with it's local and global structures, has drawn widespread attention. Network embedding not only learns significant features of a…

The fragmentation equation is commonly expressed in terms of two functions, the rate of fragmentation and the mean number of fragments. In the case of binary fragmentation an alternative description is possible based on the fragmentation…

Fractals are self-repeating patterns which have dimensions given by fractions rather than integers. While the dimension of a system unambiguously defines its properties, a fractional dimensional system can exhibit interesting properties.…

Introduced the quantitative measure of the structural complexity of the graph (complex network, etc.) based on a procedure similar to the renormalization process, considering the difference between actual and averaged graph structures on…

Several interesting approaches have been reported in the literature on complex networks, random walks, and hierarchy of graphs. While many of these works perform random walks on stable, fixed networks, in the present work we address the…