Related papers: Structural Properties of Hyperuniform Networks
The development of numerically efficient computational methods has facilitated in depth studies of various correlated phases of matter including critical and topological phases. A quantum Monte-Carlo study of an extended Bose-Hubbard ladder…
In this article, we propose a numerical method to solve semi-discrete optimal transport problems for gigantic pointsets (108 points and more). By pushing the limits by several orders of magnitude, it opens the path to new applications in…
A Voronoi diagram is a basic geometric structure that partitions the space into regions associated with a given set of sites, such that all points in a region are closer to the corresponding site than to all other sites. While being…
A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. Assuming that the nodes of the wireless network are distributed as a…
We study the statistics of the Voronoi cell perimeter in large bi-pointed planar quadrangulations. Such maps have two marked vertices at a fixed given distance $2s$ and their Voronoi cell perimeter is simply the length of the frontier which…
Assessing the synergistic high-order behaviors (HOBs) that emerge from underlying structural mechanisms is crucial to characterize complex systems. This work leverages the combined use of predictability and information measures to detect…
We measured the effective diffusion coefficient in regions of microfluidic networks of controlled geometry using the FRAP (Fluorescence Recovery After Photobleaching) technique. The geometry of the networks was based on Voronoi…
Hyperuniformity, whereby the static structure factor (or density correlator) obeys $S(q)\sim q^{\varsigma}$ with $\varsigma> 0$, emerges at criticality in systems having multiple absorbing states, such as periodically sheared suspensions.…
Voronoi diagrams appear in many areas in science and technology and have numerous applications. They have been the subject of extensive investigation during the last decades. Roughly speaking, they are a certain decomposition of a given…
The investigation of network structure has important significance to understand the functions of various complex networks. The communities with hierarchical and overlapping structures and the special nodes like hubs and outliers are all…
We find a new structural feature of equilibrium complex random networks without multiple and self-connections. We show that if the number of connections is sufficiently high, these networks contain a core of highly interconnected vertices.…
The structure of many real networks is not locally tree-like and hence, network analysis fails to characterise their bond percolation properties. In a recent paper [P. Mann, V. A. Smith, J. B. O. Mitchell, and S. Dobson, Percolation in…
We examine the heterogeneous responses of individual nodes in sparse networks to the random removal of a fraction of edges. Using the message-passing formulation of percolation, we discover considerable variation across the network in the…
The coexistence of sparsity and clustering (non-vanishing average fraction of triangles per node) is one of the few structural features that, irrespective of finer details, are ubiquitously observed across large real-world networks. This…
In nonequilibrium statistical physics, quantifying the nearest (and higher-order) neighbors and free volumes of particles in many-body systems is crucial to elucidating the origin of macroscopic collective phenomena, such as glass/granular…
We explore the geometry of complex networks in terms of an n-dimensional Euclidean embedding represented by the Moore-Penrose pseudo-inverse of the graph Laplacian $(\bb L^+)$. The squared distance of a node $i$ to the origin in this…
We study conditional independence relationships for random networks and their interplay with exchangeability. We show that, for finitely exchangeable network models, the empirical subgraph densities are maximum likelihood estimates of their…
Hyperuniform states are an efficient way to fill up space for disordered systems. In these states the particle distribution is disordered at the short scale but becomes increasingly uniform when looked at large scales. Hyperuniformity…
We explore quantitative descriptors that herald when a many-particle system in $d$-dimensional Euclidean space $\mathbb{R}^d$ approaches a hyperuniform state as a function of the relevant control parameter. We establish quantitative…
In this paper a new proof is given for the supermodularity of information content. Using the decomposability of the information content an algorithm is given for discovering the Markov network graph structure endowed by the pairwise Markov…