Transmission and navigation on disordered lattice networks, directed spanning forests and Brownian web

• URL: http://arxiv.org/abs/2002.06898v2
• Date: Tue, 26 May 2020 05:20:49 GMT
• Title: Transmission and navigation on disordered lattice networks, directed spanning forests and Brownian web
• Authors: Subhroshekhar Ghosh and Kumarjit Saha
• Abstract summary: In this work, we investigate the geometry of networks based on randomly perturbed lattices based on spatially dependent point fields. In the regime of low disorder, we show in 2D and 3D that the DSF almost surely consists of a single tree. In 2D, we further establish that the DSF, as a collection of paths, converges under diffusive scaling to the Brownian web.
• Score: 2.0305676256390934
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Stochastic networks based on random point sets as nodes have attracted considerable interest in many applications, particularly in communication networks, including wireless sensor networks, peer-to-peer networks and so on. The study of such networks generally requires the nodes to be independently and uniformly distributed as a Poisson point process. In this work, we venture beyond this standard paradigm and investigate the stochastic geometry of networks obtained from \textit{directed spanning forests} (DSF) based on randomly perturbed lattices, which have desirable statistical properties as a models of spatially dependent point fields. In the regime of low disorder, we show in 2D and 3D that the DSF almost surely consists of a single tree. In 2D, we further establish that the DSF, as a collection of paths, converges under diffusive scaling to the Brownian web.

Related papers

• Chiral excitation flows of multinode network based on synthetic gauge fields [0.0]
  Chiral excitation flows have drawn a lot of attention for their unique unidirectionality. Such flows have been studied in three-node networks with synthetic gauge fields (SGFs) We propose a scheme to achieve chiral flows in $n$-node networks, where an auxiliary node is introduced to govern the system.
  arXiv  Detail & Related papers  (2023-12-04T16:31:02Z)
• Exploring Geometry of Blind Spots in Vision Models [56.47644447201878]
  We study the phenomenon of under-sensitivity in vision models such as CNNs and Transformers. We propose a Level Set Traversal algorithm that iteratively explores regions of high confidence with respect to the input space. We estimate the extent of these connected higher-dimensional regions over which the model maintains a high degree of confidence.
  arXiv  Detail & Related papers  (2023-10-30T18:00:33Z)
• Joint Bayesian Inference of Graphical Structure and Parameters with a Single Generative Flow Network [59.79008107609297]
  We propose in this paper to approximate the joint posterior over the structure of a Bayesian Network. We use a single GFlowNet whose sampling policy follows a two-phase process. Since the parameters are included in the posterior distribution, this leaves more flexibility for the local probability models.
  arXiv  Detail & Related papers  (2023-05-30T19:16:44Z)
• Correspondence Distillation from NeRF-based GAN [135.99756183251228]
  The neural radiance field (NeRF) has shown promising results in preserving the fine details of objects and scenes. It remains an open problem to build dense correspondences across different NeRFs of the same category. We show it is possible to bypass these challenges by leveraging the rich semantics and structural priors encapsulated in a pre-trained NeRF-based GAN.
  arXiv  Detail & Related papers  (2022-12-19T18:54:59Z)
• From Cubes to Networks: Fast Generic Model for Synthetic Networks Generation [15.070865479516696]
  We propose FGM, a fast generic model converting cubes into interrelated networks. We show that FGM can cost-efficiently generate networks exhibiting typical patterns more closely aligned to factual networks. Results show that FGM is resilient to input perturbations, producing networks with consistent fine properties.
  arXiv  Detail & Related papers  (2022-11-05T04:24:20Z)
• On the Effective Number of Linear Regions in Shallow Univariate ReLU Networks: Convergence Guarantees and Implicit Bias [50.84569563188485]
  We show that gradient flow converges in direction when labels are determined by the sign of a target network with $r$ neurons. Our result may already hold for mild over- parameterization, where the width is $tildemathcalO(r)$ and independent of the sample size.
  arXiv  Detail & Related papers  (2022-05-18T16:57:10Z)
• Predicting Hidden Links and Missing Nodes in Scale-Free Networks with Artificial Neural Networks [1.0152838128195467]
  We proposed a methodology in a form of an algorithm to predict hidden links and missing nodes in scale-free networks. We used Bela Bollobas's directed scale-free random graph generation algorithm as a generator of random networks to generate a large set of scale-free network's data.
  arXiv  Detail & Related papers  (2021-09-25T10:23:28Z)
• Cylindrical and Asymmetrical 3D Convolution Networks for LiDAR-based Perception [122.53774221136193]
  State-of-the-art methods for driving-scene LiDAR-based perception often project the point clouds to 2D space and then process them via 2D convolution. A natural remedy is to utilize the 3D voxelization and 3D convolution network. We propose a new framework for the outdoor LiDAR segmentation, where cylindrical partition and asymmetrical 3D convolution networks are designed to explore the 3D geometric pattern.
  arXiv  Detail & Related papers  (2021-09-12T06:25:11Z)
• A Point-Cloud Deep Learning Framework for Prediction of Fluid Flow Fields on Irregular Geometries [62.28265459308354]
  Network learns end-to-end mapping between spatial positions and CFD quantities. Incompress laminar steady flow past a cylinder with various shapes for its cross section is considered. Network predicts the flow fields hundreds of times faster than our conventional CFD.
  arXiv  Detail & Related papers  (2020-10-15T12:15:02Z)
• Disordered complex networks: energy optimal lattices and persistent homology [1.3342402609717876]
  Well-known networks based on the Poisson point process model have limitations vis-a-vis network efficiency. strongly correlated alternatives, such as those based on random matrix spectra (RMT), have tractability and robustness issues. We demonstrate that network models based on random perturbations of Euclidean lattices interpolate between Poisson and rigidly structured networks.
  arXiv  Detail & Related papers  (2020-09-13T02:37:18Z)
• A Rigorous Framework for the Mean Field Limit of Multilayer Neural Networks [9.89901717499058]
  We develop a mathematically rigorous framework for embedding neural networks in the mean field regime. As the network's widths increase, the network's learning trajectory is shown to be well captured by a limit. We prove several properties of large-width multilayer networks.
  arXiv  Detail & Related papers  (2020-01-30T16:43:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.