The reviewed record of science sign in
Pith

arxiv: 2607.00616 · v1 · pith:7JYFK5MY · submitted 2026-07-01 · cs.NI

Fluid-Spatiotemporal Stochastic Geometry: Information Flow in Non-Stationary Fields

Wen-Yu Dong , Weiwei Jiang , Song Zhao , Qi Bi , Sheng Chen This is my paper

Reviewed by Pith2026-07-02 05:10 UTCgrok-4.3pith:7JYFK5MYopen to challenge →

classification cs.NI
keywords fluid spatiotemporal stochastic geometrynon-stationary networksoptimal transportscalar potential fieldinformation fluxhydrodynamic limitnetwork topology evolution
0
0 comments X

The pith

A scalar potential field exists and is unique for governing compressive evolution of network load in non-stationary spatial topologies.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops Fluid-Spatiotemporal Stochastic Geometry to analyze information flow when node intensity changes continuously in space and time instead of remaining fixed. It models the evolving node constellation as a hydrodynamic fluid and recasts the recovery of hidden dynamics as an inverse boundary value problem. Applying the minimum kinetic energy principle from optimal transport then yields existence and uniqueness for a scalar potential field that controls how network load compresses and moves. The resulting description links continuous Lagrangian transport to discrete Eulerian interference geometry. Readers would care because the approach supplies macroscopic statistics, such as an information flux vector and a material derivative, for predicting limits on data movement without assuming stationary node placements.

Core claim

Using the minimum kinetic energy principle from optimal transport, the paper establishes the existence and uniqueness of a scalar potential field governing the compressive evolution of network load. Dynamic network topology is treated as the hydrodynamic limit of the discrete node constellation, allowing latent dynamics to be identified via an inverse boundary value problem. The field-theoretic model couples continuous Lagrangian transport with discrete Eulerian interference geometry. From this foundation the information flux vector is derived as a sufficient statistic for macroscopic advection and the material derivative as a kinematic predictor of topological divergence, while non-stationa

What carries the argument

The scalar potential field obtained from the minimum kinetic energy principle of optimal transport, which governs compressive evolution of network load under the hydrodynamic limit of node positions.

If this is right

  • The information flux vector functions as a sufficient statistic for macroscopic advection.
  • The material derivative acts as a kinematic predictor of topological divergence.
  • Coordination overhead, topology deformation, and control signaling scale with the kinematic entropy of the evolving topology.
  • Energy-density scaling supplies a characterization of non-stationary network limits via source-channel interpretation.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The potential-field description could support reduced-order models that predict coverage holes or capacity drops in mobile networks without tracking every node individually.
  • The same inverse-problem setup might extend to other spatial point processes whose intensity evolves, such as vehicular traffic or sensor swarms.
  • Solving the boundary-value problem numerically for measured interference patterns would test whether the derived potential remains stable under realistic measurement noise.

Load-bearing premise

Dynamic network topology can be treated as a hydrodynamic limit of the discrete node constellation so that latent dynamics become an inverse boundary value problem.

What would settle it

A numerical simulation of a small non-stationary network with prescribed node trajectories and observed load changes would falsify the claim if the minimum-energy scalar potential derived from boundary data fails to match the actual compressive evolution or if distinct potentials produce identical energy minima.

Figures

Figures reproduced from arXiv: 2607.00616 by Qi Bi, Sheng Chen, Song Zhao, Weiwei Jiang, Wen-Yu Dong.

Figure 1
Figure 1. Figure 1: Illustration of the Field-Measure Coupling in F-STSG. [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 3
Figure 3. Figure 3: Validation of the inverse problem. (a) Ground truth velocity [PITH_FULL_IMAGE:figures/full_fig_p014_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Validation under complex non-symmetric topology (Hotspot Merging). [PITH_FULL_IMAGE:figures/full_fig_p015_4.png] view at source ↗
Figure 7
Figure 7. Figure 7: Temporal causality analysis: the fundamental phase-lead property of [PITH_FULL_IMAGE:figures/full_fig_p016_7.png] view at source ↗
Figure 9
Figure 9. Figure 9: Source-channel matching performance under latency ( [PITH_FULL_IMAGE:figures/full_fig_p017_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Energy-capacity scaling analysis: numerical validation of the universal [PITH_FULL_IMAGE:figures/full_fig_p018_10.png] view at source ↗
read the original abstract

The fundamental limits of information flow in spatial networks are usually characterized under stationary spatial point processes, but this assumption cannot capture non-stationary regimes where the node intensity field evolves continuously in space and time. This paper develops Fluid-Spatiotemporal Stochastic Geometry (F-STSG), treating dynamic network topology as a hydrodynamic limit of the discrete node constellation. We formulate the identification of latent network dynamics as an inverse boundary value problem and, using the minimum kinetic energy principle from optimal transport, establish the existence and uniqueness of a scalar potential field governing the compressive evolution of network load. The resulting field-theoretic formulation couples continuous Lagrangian transport with discrete Eulerian interference geometry. Based on this model, we derive the information flux vector as a sufficient statistic for macroscopic advection and the material derivative as a kinematic predictor of topological divergence. We further characterize non-stationary network limits through energy-density scaling and source-channel interpretation, showing how coordination overhead, topology deformation, and control signaling requirements are linked to the kinematic entropy of the evolving network topology.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper develops Fluid-Spatiotemporal Stochastic Geometry (F-STSG) to characterize information flow in non-stationary spatial networks. It treats dynamic topologies as a hydrodynamic limit of discrete node point processes, formulates identification of latent dynamics as an inverse boundary-value problem, and invokes the minimum kinetic energy principle from optimal transport to assert existence and uniqueness of a scalar potential field that governs compressive evolution of network load. The framework couples Lagrangian transport with Eulerian interference geometry, derives an information flux vector as a sufficient statistic for advection and a material derivative as a predictor of topological divergence, and links coordination overhead and control signaling to kinematic entropy via energy-density scaling and source-channel interpretations.

Significance. If the hydrodynamic limit and the optimal-transport step are placed on a rigorous footing with explicit scaling and regularity conditions, the approach could supply a field-theoretic tool for macroscopic analysis of evolving networks that is currently unavailable under stationary point-process assumptions. The linkage of OT-derived potentials to information flux and kinematic entropy offers a potentially falsifiable route to relating topology deformation to signaling overhead.

major comments (2)
  1. [Abstract] Abstract: the existence/uniqueness claim for the scalar potential field rests on applying the minimum kinetic energy principle to a hydrodynamic limit whose density satisfies a continuity equation. No scaling regime, moment bounds, or convergence statement is supplied to guarantee that the OT functional remains strictly convex once point-process fluctuations and the Eulerian interference geometry are restored; this step is load-bearing for the central claim.
  2. [Abstract] Abstract: the inverse boundary-value problem formulation for identifying latent network dynamics presupposes that the discrete node constellation admits a well-defined continuum limit whose density field is sufficiently regular for the inverse problem to be well-posed. The abstract provides neither the requisite regularity assumptions nor a statement of how finite-density effects are controlled, leaving the well-posedness of the BVP conditional on an unverified approximation.
minor comments (1)
  1. [Abstract] The abstract introduces several new terms (F-STSG, kinematic entropy, material derivative) without indicating where in the manuscript the reader will find their precise definitions or the supporting derivations.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive feedback on our manuscript. The two major comments correctly note that the abstract omits explicit statements on scaling regimes, convergence, and regularity conditions. We address each point below and will revise the abstract and introduction accordingly to improve clarity and rigor.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the existence/uniqueness claim for the scalar potential field rests on applying the minimum kinetic energy principle to a hydrodynamic limit whose density satisfies a continuity equation. No scaling regime, moment bounds, or convergence statement is supplied to guarantee that the OT functional remains strictly convex once point-process fluctuations and the Eulerian interference geometry are restored; this step is load-bearing for the central claim.

    Authors: We agree that the abstract does not supply the scaling regime or convergence details. The full manuscript establishes the hydrodynamic limit by weak convergence of the empirical point-process measure to a deterministic density satisfying the continuity equation, under the assumption of finite second moments and a scaling where local node density grows while the normalized intensity remains fixed. The minimum kinetic energy principle from optimal transport is applied to this limiting continuum density, where strict convexity holds for the quadratic cost under absolute continuity of the density. Point-process fluctuations around the limit are controlled by a variance bound that vanishes in the scaling limit. We will revise the abstract to include a concise reference to this weak-convergence regime and the regularity needed for convexity, and add a remark in the introduction citing the relevant OT theorem. A complete proof incorporating Eulerian interference effects is beyond the present scope and will be noted as future work. revision: yes

  2. Referee: [Abstract] Abstract: the inverse boundary-value problem formulation for identifying latent network dynamics presupposes that the discrete node constellation admits a well-defined continuum limit whose density field is sufficiently regular for the inverse problem to be well-posed. The abstract provides neither the requisite regularity assumptions nor a statement of how finite-density effects are controlled, leaving the well-posedness of the BVP conditional on an unverified approximation.

    Authors: The referee correctly observes that the abstract omits the regularity assumptions. In the manuscript the inverse BVP is posed on the limiting density field assumed to lie in the Sobolev space H^1, which guarantees well-posedness via standard elliptic theory for the continuity equation. Finite-density effects are controlled by taking the hydrodynamic limit in which the average number of nodes per unit area tends to infinity while the normalized intensity measure is held fixed. We will update the abstract to state these regularity conditions explicitly and add a short paragraph in Section 2 clarifying the discrete-to-continuum passage. This revision will make the well-posedness claim self-contained in the abstract. revision: yes

Circularity Check

0 steps flagged

No circularity: derivation imports external OT principle without self-referential reduction

full rationale

The paper's central step applies the minimum kinetic energy principle (Benamou-Brenier) from optimal transport literature to obtain existence/uniqueness of a scalar potential after positing a hydrodynamic limit. This is an external mathematical result, not a self-citation, self-definition, or fitted-parameter renaming. No equations in the abstract reduce a derived quantity to its own inputs by construction, and the subsequent derivations (information flux vector, material derivative, energy-density scaling) are presented as consequences rather than tautologies. The hydrodynamic-limit assumption is stated explicitly but does not create a circular loop within the paper's own chain.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The model rests on applying an external optimal transport principle to network topology and introducing a scalar potential without independent evidence supplied in the abstract.

axioms (1)
  • domain assumption Minimum kinetic energy principle from optimal transport governs the evolution of network load.
    Invoked to establish existence and uniqueness of the scalar potential field.
invented entities (1)
  • Scalar potential field no independent evidence
    purpose: Governs compressive evolution of network load and yields information flux vector.
    Postulated via the inverse boundary value problem; no falsifiable external handle is mentioned.

pith-pipeline@v0.9.1-grok · 5710 in / 1191 out tokens · 26254 ms · 2026-07-02T05:10:53.908000+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

50 extracted references · 50 canonical work pages

  1. [1]

    S. N. Chiu, D. Stoyan, W. S. Kendall, and J. Mecke (eds), Stochastic Geometry and Its Applications(3rd Edition). John Wiley & Sons, 2013

    work page 2013

  2. [2]

    Stochastic geometry and wireless networks: Volume I theory,

    F. Baccelli and B. B laszczyszyn, “Stochastic geometry and wireless networks: Volume I theory,”Foundations and Trends in Networking, vol. 3, nos. 3-4, pp. 249–449, 2009

    work page 2009

  3. [3]

    Haenggi,Stochastic Geometry for Wireless Networks

    M. Haenggi,Stochastic Geometry for Wireless Networks. Cam- bridge, U.K.: Cambridge Univ. Press, 2012

    work page 2012

  4. [4]

    The capacity of wireless networks,

    P. Gupta and P. R. Kumar, “The capacity of wireless networks,” IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388–404, Mar. 2000

    work page 2000

  5. [5]

    Mean field games,

    J. M. Lasry and P. L. Lions, “Mean field games,”Jpn J. Math., vol. 2, pp. 229–260, Jan. 2007

    work page 2007

  6. [6]

    Isakov,Inverse Problems for Partial Differential Equations (2nd edition)

    V. Isakov,Inverse Problems for Partial Differential Equations (2nd edition). Cham, Switzerland: Springer, 2006

    work page 2006

  7. [7]

    Uplink performance analysis of heterogeneous non-terrestrial networks in harsh environments: A novel stochastic geometry model,

    W.-Y. Dong, S. Yang, and S. Chen, “Uplink performance analysis of heterogeneous non-terrestrial networks in harsh environments: A novel stochastic geometry model,”IEEE Trans. Commun., vol. 73, no. 8, pp. 6734–6747, Aug. 2025

    work page 2025

  8. [8]

    Stochastic geometry based modeling and analysis of uplink cooperative satellite-aerial- terrestrial networks for nomadic communications with weak satellite coverage,

    W.-Y. Dong, S. Yang, P. Zhang, and S. Chen, “Stochastic geometry based modeling and analysis of uplink cooperative satellite-aerial- terrestrial networks for nomadic communications with weak satellite coverage,”IEEE J. Sel. Areas Commun., vol. 42, no. 12, pp. 3428–3444, Dec. 2024

    work page 2024

  9. [9]

    Modeling and performance analysis of IoT-over-LEO satellite systems under re- alistic operational constraints: A stochastic geometry approach,

    W.-Y. Dong, S. Yang, P. Zhang, and S. Chen, “Modeling and performance analysis of IoT-over-LEO satellite systems under re- alistic operational constraints: A stochastic geometry approach,” IEEE Internet Things J., vol. 12, no. 15, pp. 30576–30593, Aug. 2025

    work page 2025

  10. [10]

    Outage probability analysis of uplink hetero- geneous non-terrestrial networks: A novel stochastic geometry model,

    W.-Y. Dong,et al., “Outage probability analysis of uplink hetero- geneous non-terrestrial networks: A novel stochastic geometry model,” inProc. GLOBECOM 2024(Cape Town, South Africa), Dec. 8-12, 2024, pp. 2588–2593

    work page 2024

  11. [11]

    Stochastic geometry based performance analysis of terrestrial-to-aerial networks for nomadic communi- cations,

    W.-Y. Dong,et al., “Stochastic geometry based performance analysis of terrestrial-to-aerial networks for nomadic communi- cations,” inProc. GLOBECOM 2024(Cape Town, South Africa), Dec. 8-12, 2024, pp. 2731–2736

    work page 2024

  12. [12]

    The local delay in Poisson networks,

    M. Haenggi, “The local delay in Poisson networks,”IEEE Trans. Inf. Theory, vol. 59, no. 3, pp. 1788–1802, Mar. 2013

    work page 2013

  13. [13]

    Stochastic geometry analysis of spatial–temporal performance in wireless networks: A tutorial,

    X. Lu,et al., “Stochastic geometry analysis of spatial–temporal performance in wireless networks: A tutorial,”IEEE Commun. Surveys Tuts., vol. 23, no. 4, pp. 2753–2801, 4th Quart., 2021

    work page 2021

  14. [14]

    A mathematical theory of network interference and its applications,

    M. Z. Win, P. C. Pinto, and L. A. Shepp, “A mathematical theory of network interference and its applications,”Proc. IEEE, vol. 97, no. 2, pp. 205–230, Feb. 2009

    work page 2009

  15. [15]

    Spatiotemporal coop- eration in heterogeneous cellular networks,

    G. Nigam, P. Minero, and M. Haenggi, “Spatiotemporal coop- eration in heterogeneous cellular networks,”IEEE J. Sel. Areas Commun., vol. 33, no. 6, pp. 1253–1265, Jun. 2015

    work page 2015

  16. [16]

    Spatio-temporal interference correlation and joint coverage in cellular networks,

    S. Krishnan and H. S. Dhillon, “Spatio-temporal interference correlation and joint coverage in cellular networks,”IEEE Trans. Wireless Commun., vol. 16, no. 9, pp. 5659–5672, Sep. 2017

    work page 2017

  17. [17]

    Fundamentals of mobility-aware performance characterization of cellular net- works: A tutorial,

    H. Tabassum, M. Salehi, and E. Hossain, “Fundamentals of mobility-aware performance characterization of cellular net- works: A tutorial,”IEEE Commun. Surveys Tuts., vol. 21, no. 3, pp. 2288–2308, 3rd Quart., 2019

    work page 2019

  18. [18]

    Spatio-temporal analysis for SINR coverage in small cell networks,

    H. H. Yang and T. Q. S. Quek, “Spatio-temporal analysis for SINR coverage in small cell networks,”IEEE Trans. Commun., vol. 67, no. 8, pp. 5520–5531, Aug. 2019

    work page 2019

  19. [19]

    Tradeoff between delay and physical layer security in wireless networks,

    Y. Zhong,et al., “Tradeoff between delay and physical layer security in wireless networks,”IEEE J. Sel. Areas Commun., vol. 36, no. 7, pp. 1635–1647, Jul. 2018

    work page 2018

  20. [20]

    Multi-UA V enabled aerial- ground integrated networks: A stochastic geometry analysis,

    S. Zhang, Y. Zhu, and J. Liu, “Multi-UA V enabled aerial- ground integrated networks: A stochastic geometry analysis,” IEEE Trans. Commun., vol. 70, no. 10, pp. 7040–7054, Oct. 2022

    work page 2022

  21. [21]

    Stochastic geometry study on device-to-device communication as a disaster relief solution,

    A. Al-Hourani, S. Kandeepan, and A. Jamalipour, “Stochastic geometry study on device-to-device communication as a disaster relief solution,”IEEE Trans. Veh. Techno., vol. 65, no. 5, pp. 3005–3017, May 2016

    work page 2016

  22. [22]

    On kinematic waves II. A theory of traffic flow on long crowded roads,

    M. J. Lighthill and G. B. Whitham, “On kinematic waves II. A theory of traffic flow on long crowded roads,”Proc. Roy. Soc. London, Ser. A, Math. Phys. Sci., vol. 229, no. 1175, pp. 317– 345, May 1955

    work page 1955

  23. [23]

    A study of traffic capacity,

    B. D. Greenshields, “A study of traffic capacity,”Highway Res. Board, vol. 14, no. 1, pp. 448–477, 1935

    work page 1935

  24. [24]

    Social force model for pedestrian dynamics,

    D. Helbing and P. Moln ´ar, “Social force model for pedestrian dynamics,”Physical review E, vol. 51, no. 5, pp. 4282–4286, 1995

    work page 1995

  25. [25]

    A continuum theory for the flow of pedestrians,

    R. L. Hughes, “A continuum theory for the flow of pedestrians,” Transp. Res. B: Methodol., vol. 36, no. 6, pp. 507–535, 2002

    work page 2002

  26. [26]

    Mean-field game theoretic edge caching in ultra-dense networks,

    H. Kim,et al., “Mean-field game theoretic edge caching in ultra-dense networks,”IEEE Trans. Veh. Techno., vol. 69, no. 24 1, pp. 935–947, Jan. 2020

    work page 2020

  27. [27]

    Dynamic computation offloading in ultra-dense networks based on mean field games,

    R. Zheng,et. al., “Dynamic computation offloading in ultra-dense networks based on mean field games,”IEEE Trans. Wireless Commun., vol. 20, no. 10, pp. 6551–6565, Oct. 2021

    work page 2021

  28. [28]

    Distributed interference- aware traffic offloading and power control in ultra-dense networks: Mean field game with dominating player,

    Y. Zhang, C. Yang, J. Li, and Z. Han, “Distributed interference- aware traffic offloading and power control in ultra-dense networks: Mean field game with dominating player,”IEEE Trans. Veh. Techno., vol. 68, no. 9, pp. 8814–8826, Sep. 2019

    work page 2019

  29. [29]

    A mean field game theoretic approach for security enhancements in mobile ad hoc networks,

    Y. Wang, F. R. Yu, H. Tang, and M. Huang, “A mean field game theoretic approach for security enhancements in mobile ad hoc networks,”IEEE Trans. Wireless Commun., vol. 13, no. 3, pp. 1616–1627, Mar. 2014

    work page 2014

  30. [30]

    Spatio temporal point process statistics: A review,

    J. A. Gonz ´alez, F. J. Rodr´ıguez-Cort´es, O. Cronie, and J. Mateu, “Spatio temporal point process statistics: A review,”Spatial Statist., vol. 18, pp. 505–544, Nov. 2016

    work page 2016

  31. [31]

    A probabilistic approach to mining mobile phone data sequences,

    K. Farrahi and D. Gatica-Perez, “A probabilistic approach to mining mobile phone data sequences,”Pers. Ubiquitous Comput., vol. 18, no. 1, pp. 223–238, 2014

    work page 2014

  32. [32]

    Complex networks: Structure and dynam- ics,

    S. Boccaletti,et al., “Complex networks: Structure and dynam- ics,”Phys. Rep., vol. 424, no. 4/5, pp. 175–308, 2006

    work page 2006

  33. [33]

    Barabasi,Network Science

    A.-L. Barabasi,Network Science. Cambridge, U.K.: Cambridge Univ. Press, 2016

    work page 2016

  34. [34]

    Autonomous on-demand deployment for UA V assisted wireless networks,

    Y. Wang,et al., “Autonomous on-demand deployment for UA V assisted wireless networks,”IEEE Trans. Wireless Commun., vol. 22, no. 12, pp. 9488–9501, Apr. 2023

    work page 2023

  35. [35]

    A novel PODMAI framework enhanced by user demand prediction for resource allocation in spectrum sharing UA V networks,

    R. Ding,et. al., “A novel PODMAI framework enhanced by user demand prediction for resource allocation in spectrum sharing UA V networks,”IEEE Trans. Commun., vol. 73, no. 9, pp. 8243– 8259, Sep. 2025

    work page 2025

  36. [36]

    A cooperative computation offloading strategy with on-demand deployment of multi-UA Vs in UA V aided mobile edge computing,

    C. Li, Y. Gan, Y. Zhang, and Y. Luo, “A cooperative computation offloading strategy with on-demand deployment of multi-UA Vs in UA V aided mobile edge computing,”IEEE Trans. Netw. Service Manag., vol. 21, no. 2, pp. 2095–2110, Apr. 2024

    work page 2095

  37. [37]

    Mobility increases the capacity of ad hoc wireless networks,

    M. Grossglauser and D. N. C. Tse, “Mobility increases the capacity of ad hoc wireless networks,”IEEE/ACM Trans. Netw., vol. 10, no. 4, pp. 477–486, Aug. 2002

    work page 2002

  38. [38]

    Optimal throughput-delay scaling in wireless networks — part I: the fluid model,

    A. El Gamal, J. Mammen, B. Prabhakar, and D. Shah, “Optimal throughput-delay scaling in wireless networks — part I: the fluid model,”IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2568–2592, Jun. 2006

    work page 2006

  39. [39]

    MIMO broadcast channels with finite-rate feedback,

    N. Jindal, “MIMO broadcast channels with finite-rate feedback,” IEEE Trans. Inf. Theory, vol. 52, no. 11, pp. 5045–5060, Nov. 2006

    work page 2006

  40. [40]

    Effects of channel aging in massive MIMO systems,

    K. T. Truong and R. W. Heath, “Effects of channel aging in massive MIMO systems,”J. Commun. Netw., vol. 15, no. 4, pp. 338–351, Aug. 2013

    work page 2013

  41. [41]

    Control over noisy channels,

    S. Tatikonda and S. Mitter, “Control over noisy channels,”IEEE Trans. Autom. Control, vol. 49, no. 7, pp. 1196–1201, Jul. 2004

    work page 2004

  42. [42]

    A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem,

    J.-D. Benamou and Y. Brenier, “A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem,” Numerische Math., vol. 84, no. 3, pp. 375–393, Jan. 2000

    work page 2000

  43. [43]

    D. J. Daley and D. Vere-Jones,An Introduction to the Theory of Point Processes: Volume I: Elementary Theory and Methods (2nd Edition). New York, NY: Springer, 2003

    work page 2003

  44. [44]

    G. K. Batchelor,An Introduction to Fluid Dynamics. Cambridge, U.K.: Cambridge Univ. Press, 1967

    work page 1967

  45. [45]

    L. C. Evans,Partial Differential Equations. Providence, RI: Amer. Math. Soc., 2010

    work page 2010

  46. [46]

    Courant and D

    R. Courant and D. Hilbert,Methods of Mathematical Physics: Partial Differential Equations. Hoboken, NJ, USA: Wiley, 2008

    work page 2008

  47. [47]

    A tractable approach to coverage and rate in cellular networks,

    J. G. Andrews, F. Baccelli, and R. K. Ganti, “A tractable approach to coverage and rate in cellular networks,”IEEE Trans. Commun., vol. 59, no. 11, pp. 3122–3134, Nov. 2011

    work page 2011

  48. [48]

    El Gamal and Y.-H

    A. El Gamal and Y.-H. Kim,Network Information Theory. Cambridge, U.K.: Cambridge Univ. Press, 2011

    work page 2011

  49. [49]

    Digital tides: A fluid-dynamic framework for flux-aware infrastructure provisioning in UA V logistics networks,

    W.-Y. Dong, S. Zhao, R.-S. Han, Q. Bi, and S. Chen, “Digital tides: A fluid-dynamic framework for flux-aware infrastructure provisioning in UA V logistics networks,”IEEE Trans. Mobile Comput., early access, doi: 10.1109/TMC.2026.3688690

    work page doi:10.1109/tmc.2026.3688690 2026

  50. [50]

    Villani,Topics in Optimal Transportation

    C. Villani,Topics in Optimal Transportation. Providence, RI: Amer. Math. Soc., 2003. 25

    work page 2003