相关论文: Golden Ratio Nets and Sequences
Let $R$ be a commutative ring with unity $(1\not=0)$ and let $\mathfrak{J}(R)$ be the set of all ideals of $R$. Let $\phi:\mathfrak{J}(R)\rightarrow\mathfrak{J}(R)\cup\{\emptyset\}$ be a reduction function of ideals of $R$ and let…
Random geometric graphs are widely used in modeling geometry and dependence structure in networks. In a random geometric graph, nodes are independently generated from some probability distribution $F$ over a metric space, and edges link…
An elliptic divisibility sequence is an integer recurrence sequence associated to an elliptic curve over the rationals together with a rational point on that curve. In this paper we present a higher-dimensional analogue over arbitrary base…
The methods of non-homogeneous random graphs calibration are developed for social networks simulation. The graphs are calibrated by the degree distributions of the vertices and the edges. The mathematical foundation of the methods is formed…
A deterministic sequence of real numbers in the unit interval is called \emph{equidistributed} if its empirical distribution converges to the uniform distribution. Furthermore, the limit distribution of the pair correlation statistics of a…
Network Creation Games are a well-known approach for explaining and analyzing the structure, quality and dynamics of real-world networks like the Internet and other infrastructure networks which evolved via the interaction of selfish agents…
The Fibonacci sequence is a series of positive integers in which, starting from $0$ and $1$, every number is the sum of two previous numbers, and the limiting ratio of any two consecutive numbers of this sequence is called the golden ratio.…
Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with which some well-known results have been obtained. By contrast,…
In this work I look at the distribution of primes by calculation of an infinite number of intersections. For this I use the set of all numbers which are not elements of a certain times table in each case. I am able to show that it exists a…
Under ABC, Silverman showed that there are infinitely many non-Wieferich primes with respect to any (non-trivial) base $a$. Recently Srinivas and Subramani proved an analogous result over number fields with trivial class group. In the first…
In this paper, we investigate the question of when a $\phi$-ring is $\phi$-Pr\"ufer using two types of techniques: first, by analysing the lattice structure of the nonnil ideals of $\phi$-rings; and secondly, by considering content ideal…
The problem of the universal form of the size spectrum is analyzed. The half-widths of two wings of spectrum is introduced and it is shown that their ratio is very close to the golden fraction. In appendix it is shown that behind the golden…
We study a sequential-learning model featuring a network of naive agents with Gaussian information structures. Agents apply a heuristic rule to aggregate predecessors' actions. They weigh these actions according the strengths of their…
Generative models based on normalizing flows are very successful in modeling complex data distributions using simpler ones. However, straightforward linear interpolations show unexpected side effects, as interpolation paths lie outside the…
The main purpose of this master thesis is to study the $LS$-sequences of points introduced by Carbone in \cite{Carbone} and find two generalizations of them to the unit square. Here we also present a new algorithm proposed by the same…
We consider the problem of locating the source of a network cascade, given a noisy time-series of network data. Initially, the cascade starts with one unknown, affected vertex and spreads deterministically at each time step. The goal is to…
Among the classical models for interconnection networks are hypercubes and Fibonacci cubes. Fibonacci cubes are induced subgraphs of hypercubes obtained by restricting the vertex set to those binary strings which do not contain consecutive…
We propose two new spectral measures for graphs and networks which characterize the ratios between the width of the "bulk" part of the spectrum and the spectral gap, as well as the ratio between spectral length and the width of the "bulk"…
We present a Fermi golden rule giving rates of decay of states obtained by perturbing embedded eigenvalues of a quantum graph. To illustrate the procedure in a notationally simpler setting we also present a Fermi Golden Rule for boundary…
We present different implementations for the irreducible Sobol (IS) sequences introduced in [3]. For this purpose we retain two strategies: first we use the connection between IS and Niederreiter sequences to provide a very simple…