Search

We regard Loewner’s differential equation with non-negative continuous driving functions (and more generally driving measures with non-negative support) from a quantum probability point of view and approximate the underlying quantum process by the adjacency matrices of growing graphs which arise from the comb product of certain spidernets. In the general case of an arbitrary continuous driving function we find a weaker approximation by comb products of graphs with weighted loops.

Recently we gave arguments that only two unique topologically different configurations of 7 equal all mutually touching round cylinders (the configurations being mirror reflections of each other) are possible in 3D, although a whole world of configurations is possible already for round cylinders of arbitrary radii. It was found that as many as 9 round cylinders (all mutually touching) are possible in 3D while the upper bound for arbitrary cylinders was estimated to be not more than 14 under plausible arguments. Now by using the chirality and Ring matrices that we introduced earlier for the topological classification of line configurations, we have given arguments that the maximal number of mutually touching straight infinite cylinders of arbitrary cross-section (provided that its boundary is a smooth curve) in 3D cannot exceed 10. We generated numerically several configurations of 10 cylinders, restricting ourselves with elliptic cylinders. Configurations of 8 and 9 equal elliptic cylinders (all in mutually touching) are generated numerically as well. A possibility and restriction of continuous transformations from elliptic into round cylinder configurations are discussed. Some curious results concerning the properties of the chirality matrix (which coincides with Seidel's adjacency matrix important for the Graph theory) are presented., 27 pages, 10 figures

The field of application of discrete-continual finite element method comprises structures with regular (in particular, constant or piecewise constant) physical and geometrical parameters in some dimension (so-called “basic” direction (dimension)). Considering problems remain continual along “basic” direction while along other directions mesh approximation is performed. Algorithm of computing of local stiffness matrix of discrete-continual finite element with quadrangular cross-section and different integration schemes is presented. Constructing of global stiffness matrix with the use of adjacency matrix and several numerical samples are considered as well.

Design of filters for graph signal processing benefits from knowledge of the spectral decomposition of matrices that encode graphs, such as the adjacency matrix and the Laplacian matrix, used to define the shift operator. For shift matrices with real eigenvalues, which arise for symmetric graphs, the empirical spectral distribution captures the eigenvalue locations. Under realistic circumstances, stochastic influences often affect the network structure and, consequently, the shift matrix empirical spectral distribution. Nevertheless, deterministic functions may often be found to approximate the asymptotic behavior of empirical spectral distributions of random matrices. This paper uses stochastic canonical equation methods developed by Girko to derive such deterministic equivalent distributions for the empirical spectral distributions of random graphs formed by structured, non-uniform percolation of a D-dimensional lattice supergraph. Included simulations demonstrate the results for sample parameters., ICASSP 2017

Beat-to-beat changes in the heart period are transformed into a network of increments bet-ween subsequent RR-intervals, which enables graphical descriptions of short-term heart period variability. Three types of such descriptions are considered: (1) network graphs arising from a set of vertices and directed edges, (2) contour plots of adjacency matrices A, representing the networks and transition matrices T, resulting from A, and (3) vector plots of gradients of the matrices A and T. Two indices are considered which summarize properties of A and T: the approximate deceleration capacity and the entropy rate. The method, applied to time series of nocturnal RR-intervals recorded from healthy subjects of different ages, reveals important aspect of changes in the autonomic activity caused by biological aging. Independently of the subject's age, following accelerations a pendulum-like dynamics appears. With decelerations, this dynamics develops in line with the subject's age. This aging transition can be graphically visualized by vectors connecting the maxima of the transition probabilities of~T, which, metaphorically, resemble a chronometer or the hands of a clock.

By the use of extensive numerical simulations we show that the nearest-neighbor energy level spacing distribution $P(s)$ and the entropic eigenfunction localization length of the adjacency matrices of Erd\H{o}s-R\'enyi (ER) {\it fully} random networks are universal for fixed average degree $\xi\equiv \alpha N$ ($\alpha$ and $N$ being the average network connectivity and the network size, respectively). We also demonstrate that Brody distribution characterizes well $P(s)$ in the transition from $\alpha=0$, when the vertices in the network are isolated, to $\alpha=1$, when the network is fully connected. Moreover, we explore the validity of our findings when relaxing the randomness of our network model and show that, in contrast to standard ER networks, ER networks with {\it diagonal disorder} also show universality. Finally, we also discuss the spectral and eigenfunction properties of small-world networks., Comment: 11 pages, 9 figures