1,277 research outputs found
Traffic Analysis in Random Delaunay Tessellations and Other Graphs
In this work we study the degree distribution, the maximum vertex and edge
flow in non-uniform random Delaunay triangulations when geodesic routing is
used. We also investigate the vertex and edge flow in Erd\"os-Renyi random
graphs, geometric random graphs, expanders and random -regular graphs.
Moreover we show that adding a random matching to the original graph can
considerably reduced the maximum vertex flow.Comment: Submitted to the Journal of Discrete Computational Geometr
Euclidean versus hyperbolic congestion in idealized versus experimental networks
This paper proposes a mathematical justification of the phenomenon of extreme
congestion at a very limited number of nodes in very large networks. It is
argued that this phenomenon occurs as a combination of the negative curvature
property of the network together with minimum length routing. More
specifically, it is shown that, in a large n-dimensional hyperbolic ball B of
radius R viewed as a roughly similar model of a Gromov hyperbolic network, the
proportion of traffic paths transiting through a small ball near the center is
independent of the radius R whereas, in a Euclidean ball, the same proportion
scales as 1/R^{n-1}. This discrepancy persists for the traffic load, which at
the center of the hyperbolic ball scales as the square of the volume, whereas
the same traffic load scales as the volume to the power (n+1)/n in the
Euclidean ball. This provides a theoretical justification of the experimental
exponent discrepancy observed by Narayan and Saniee between traffic loads in
Gromov-hyperbolic networks from the Rocketfuel data base and synthetic
Euclidean lattice networks. It is further conjectured that for networks that do
not enjoy the obvious symmetry of hyperbolic and Euclidean balls, the point of
maximum traffic is near the center of mass of the network.Comment: 23 pages, 4 figure
Non-Euclidean geometry in nature
I describe the manifestation of the non-Euclidean geometry in the behavior of
collective observables of some complex physical systems. Specifically, I
consider the formation of equilibrium shapes of plants and statistics of sparse
random graphs. For these systems I discuss the following interlinked questions:
(i) the optimal embedding of plants leaves in the three-dimensional space, (ii)
the spectral statistics of sparse random matrix ensembles.Comment: 52 pages, 21 figures, last section is rewritten, a reference to
chaotic Hamiltonian systems is adde
Critical percolation of free product of groups
In this article we study percolation on the Cayley graph of a free product of
groups.
The critical probability of a free product of groups
is found as a solution of an equation involving only the expected subcritical
cluster size of factor groups . For finite groups these
equations are polynomial and can be explicitly written down. The expected
subcritical cluster size of the free product is also found in terms of the
subcritical cluster sizes of the factors. In particular, we prove that
for the Cayley graph of the modular group (with the
standard generators) is , the unique root of the polynomial
in the interval .
In the case when groups can be "well approximated" by a sequence of
quotient groups, we show that the critical probabilities of the free product of
these approximations converge to the critical probability of
and the speed of convergence is exponential. Thus for residually finite groups,
for example, one can restrict oneself to the case when each free factor is
finite.
We show that the critical point, introduced by Schonmann,
of the free product is just the minimum of for the factors
On fast-slow consensus networks with a dynamic weight
We study dynamic networks under an undirected consensus communication
protocol and with one state-dependent weighted edge. We assume that the
aforementioned dynamic edge can take values over the whole real numbers, and
that its behaviour depends on the nodes it connects and on an extrinsic slow
variable. We show that, under mild conditions on the weight, there exists a
reduction such that the dynamics of the network are organized by a
transcritical singularity. As such, we detail a slow passage through a
transcritical singularity for a simple network, and we observe that an exchange
between consensus and clustering of the nodes is possible. In contrast to the
classical planar fast-slow transcritical singularity, the network structure of
the system under consideration induces the presence of a maximal canard. Our
main tool of analysis is the blow-up method. Thus, we also focus on tracking
the effects of the blow-up transformation on the network's structure. We show
that on each blow-up chart one recovers a particular dynamic network related to
the original one. We further indicate a numerical issue produced by the slow
passage through the transcritical singularity
- …