Rayleigh Random Flights on the Poisson line SIRSN

Wilfrid Stephen Kendall

REVIEW 3 major objections 3 minor 25 references

Rayleigh Random Flights on the Poisson line SIRSN

T0 review · 3 major / 3 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper constructs a natural family of scale-invariant random flights on Poisson-line SIRSN road networks and proves that, at a critical parameter, their speed is neighbourhood-recurrent, never slowing to zero or escaping to…

desk verdict A serious, novel paper whose main theorem likely holds; the ergodicity proof in Theorem 30 is too compressed but the stress-test counterexample does not actually work. read the letter →

arxiv 1908.08481 v4 pith:AG62SD2B submitted 2019-08-22 math.PR

Wilfrid Stephen Kendall This is my paper · ORCID

classification math.PR MSC 60D0560G5037A50

keywords scale-invariantrandomspatialnetworksRayleighflightPoissonlineprocessabstractscatteringrepresentationspeed-neighbourhoodrecurrencegeodesicsonSIRSNPalmconditioningwalkinenvironment

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

Scale-invariant random spatial networks (SIRSN) built from speed-marked random lines model the route-finding behaviour of online maps, but it is open whether their fastest paths can ever come to a complete stop. This paper defines a one-parameter family of Rayleigh random flights on such networks—randomly-broken local geodesics that switch lines at intersections with probabilities depending on relative speeds—and proves that at the critical parameter the speed process is neighbourhood-recurrent: it returns infinitely often to any neighbourhood of its starting speed and neither decays to zero nor diverges. Because these flights are the natural randomized analogue of an actual geodesic, their failure to stall is presented as evidence for the conjecture that true geodesics never halt. If the conjecture is true, geodesics can be represented as doubly-infinite sequences of connected line segments, which would justify computing them from finite-line approximations.

What carries the argument

The load-bearing construction is the abstract scattering representation of a non-lazy Markov chain, in which transition probabilities are factorized as p_{a,b}=ω_{a,b}s_b, with s_b the probability of scattering at state b and ω_{a,b} the probability of arriving there. For the RRF, states are ordered pairs of distinct lines (L_-,L_0) at an intersection, scattering classes are the lines themselves, and zero-deficit similarity-equivariant dynamics force s(L_1,L_2)=min{1,(v(L_2)/v(L_1))^α} with κ(L)=v(L)^α. The analysis then uses Slivnyak-Mecke Palm conditioning to identify the stationary relative environment, Birkhoff's ergodic theorem to exclude non-critical exponents, a variation of an averaging argument for walks in inhomogeneous environments to prove ergodicity of the relative environment, and an adaptation of the Kesten-Spitzer-Whitman range theorem to deduce neighbourhood recurrence of the log-speed from its zero mean.

What would settle it

Run the critical SIRSN-RRF with α=2(γ-1) on a large finite approximation of a γ-line SIRSN and record the log-speed after each switch; if the sample mean of log-relative speeds is nonzero over long runs for positive-probability environments, or if the particle's speed eventually becomes trapped below a fixed threshold, the recurrence claim is false. A direct theoretical falsifier would be a bounded harmonic function on the relative environment that is constant on sample paths but depends on more than the Poisson line pattern, contradicting the ergodicity step.

Watch

Extended reading notes

Core claim

The central discovery is Theorem 31: for every Poisson-line SIRSN or SIRSN candidate with parameter γ≥2, there is a discrete-time SIRSN-RRF whose speed process V_n=v(L_0) at successive line switches almost surely returns infinitely often to every neighbourhood of the initial speed V_0. This occurs at the critical exponent α=2(γ-1), where the stationary law of the logarithm of the relative speed of consecutive lines is symmetric Laplace with zero mean. The proof passes through the relative environment seen from the moving particle: its stationary distribution has independent components (an asymmetric-Laplace log-speed, a sine-weighted angle, and an independent copy of the Poisson line process), and ergodicity of that environment, combined with a real-valued adaptation of the Kesten-Spitzer-Whitman range theorem, converts zero mean into neighbourhood recurrence. Non-critical exponents are excluded: α>2(γ-1) would make the speed almost surely diverge exponentially, while α<2(γ-1) would make it almost surely converge to zero. The result is offered as evidence for Conjecture 1, that a true Π-geodesic never comes to a complete stop en route.

Load-bearing premise

The argument stands or falls on the assertion that the random environment seen by the moving particle is ergodic; the proof assumes that any bounded harmonic function constant along particle paths is already determined by the Poisson line process, despite the reduced environment being far from irreducible. If that ergodicity fails, the zero-mean log-speed does not force the speed to return to its starting neighbourhood.

Editorial extensions

If this is right

The critical SIRSN-RRF supplies a concrete stochastic model of a broken local geodesic whose speed is neighbourhood-recurrent; if the analogy to true geodesics holds, Conjecture 1 follows and Π-geodesics are doubly-infinite sequences of line segments.
Ergodicity of the relative environment forces a sharp trichotomy among SIRSN-RRF: critical speeds are recurrent, supercritical speeds almost surely diverge to infinity, and subcritical speeds almost surely converge to zero with the particle becoming trapped in ever-shrinking cells.
In the converging case the continuous-time flight reaches zero speed in finite time, while in the diverging case it runs for all time; the critical case is the only one consistent with non-halting geodesics.
The abstract scattering representation gives a general algebraic characterization of reversible scattering Markov chains through scattering and transmission probabilities, so the SIRSN-RRF construction can be exported to other reversible dynamics, including piecewise-deterministic Markov processes.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The leap from randomly-broken local geodesics to true geodesics is not proved; a direct analogue of Theorem 31 for the actual fastest path would be needed to settle Conjecture 1, so this paper's result is evidence rather than proof.
The critical condition α=2(γ-1) can be read as a zero-log-drift balance: the rate at which faster lines are encountered exactly compensates for slower lines. One could test whether true Π-geodesics show the same balance by measuring, on finite approximations, whether logarithmic speed fluctuations along long geodesic segments have zero mean.
The axiomatic scattering representation may find use beyond SIRSN, for instance in Markov chain Monte Carlo algorithms built from piecewise-deterministic dynamics; the zero-deficit construction suggests a template for designing reversible scattering chains from a prescribed function on scattering classes.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Short version: this is a real contribution, and the reader's ACCEPT verdict is about right. The abstract scattering representation is genuinely new and worth having on its own; the one-parameter family of SIRSN-RRF is natural, and the identification of the critical exponent α = 2(γ−1) is a clean first-principles derivation. The main recurrence result is significant if correct, and the Kesten–Spitzer–Whitman adaptation is standard and fine.

The soft spot is exactly where the reader put it: Theorem 30. The proof is much too terse. The step where a bounded harmonic function h on the relative environment is converted into a Π-measurable H(Π) needs an explicit argument — presumably using quenched irreducibility (Lemma 24) to show h is constant on all relative environments arising from the same Π. The next step, that H(Π) must be non-random, also needs care: Theorem 21 is stated for functions of a distinguished line and the pattern, not directly for functions of the pattern alone. That can be patched by embedding H into that framework with a dummy line, and then translation-ergodicity of the line process does the job, but the paper should say so.

On the stress-test note: I think the proposed counterexample does not land. The set of pairwise intersection angles A(Π) is time-constant and similarity-invariant, but it is also a translation-invariant measurable function of Π, and the Poisson line process is ergodic under translations. So for any bounded measurable function F of that angle set, F(A(Π)) is almost surely constant. Different realisations having different angle sets does not create a nonconstant bounded harmonic function; ergodicity forbids it. The concern would only bite if there were a nonconstant invariant that is not a function of Π alone, and the paper gives no such example. So I do not think the central argument is broken — but it is underproved, and a referee should insist on a full proof of the reduction to H(Π) and of the application of ergodicity to pattern-only functions.

Minor quibbles: the discussion of the non-critical cases in the conclusion is a bit sketchy, and the paper would benefit from a cleaner statement of the ergodicity theorem for pattern-only invariants. None of this undermines the main result.

Who is this for: people working on random walks in random environments, stochastic geometry, and the SIRSN literature. It deserves a serious referee, not a desk rejection. I would send it out, with a request to expand Theorem 30.

Referee Report

3 major / 3 minor

Summary. This paper introduces abstract scattering representations for non-lazy Markov chains and uses them to define SIRSN-RRF, a one-parameter family of Rayleigh random flights on a Poisson line SIRSN. The main results are: (i) a characterization (Theorem 22) reducing similarity-equivariant zero-deficit scattering dynamics to a parameter α > γ - 1; (ii) an explicit stationary distribution for the relative environment process (Theorem 27), which is symmetric exactly at α = 2(γ - 1); (iii) a critical-value speed-neighbourhood-recurrence theorem (Theorem 31) based on an ergodicity claim for the relative environment (Theorem 30). The paper motivates this as evidence for the conjecture that SIRSN geodesics never come to a complete stop.

Significance. If valid, Theorem 31 gives a nontrivial example of a scale-invariant random process on a Poisson line SIRSN whose speed is neighbourhood-recurrent at a derived critical parameter, supporting Conjecture 1 and the doubly-infinite geodesic representation. The abstract scattering framework and the explicit calculations with Mecke-Slivnyak and Dirichlet forms are original and likely useful beyond this application. The critical value α = 2(γ - 1) is derived from a zero-mean condition rather than fitted, and the statements are falsifiable in principle. The main obstacle is the unsupported ergodicity proof of Theorem 30, on which the central theorem depends.

major comments (3)

[§5, Theorem 30] The proof of Theorem 30 has a load-bearing gap. From stationarity and harmonicity the paper correctly obtains P[h(Ψ1) = h(Ψ0)] = 1, but the next sentence asserts that 'using Ψ to explore the network' yields a Π-measurable H(Π) with h(Ψn) = H(Π) for all n. This does not follow from constancy along stationary sample paths; it requires an argument that the stationary chain can connect the relative environments arising from the same Π. The paper explicitly states in Section 4 that the reduced relative environment is 'very far from being irreducible', giving the time-constant set A of intersection angles as an obstruction, and no such connecting argument is supplied.
[§5, Theorem 30, second paragraph] Even granting the existence of H(Π), the sentence 'It follows from the ergodicity of Π (Theorem 21) that H(Π) must be non-random' is not justified. Theorem 21 applies to functions ξ(L, Π) that are Euclidean-invariant jointly in a distinguished line L and the pattern; its proof uses translation parallel to L. H(Π) is a similarity-invariant function of the pattern alone, and Theorem 21 does not assert that all such functions are constant. In fact the angle set A(Π) noted in Section 4 is similarity-invariant and, if measurable in the state-space σ-algebra, would yield a nonconstant bounded function constant along Ψ sample paths, violating the claimed ergodicity. The manuscript must either prove the absence of such invariants or weaken Theorem 30 to a statement sufficient for Theorem 31, for example ergodicity of the log-relative-speed process U under the stationary law.
[§5, Theorem 31] The proof of Theorem 31 invokes Theorem 29 for the stationary ergodic log-speed process, but the theorem is stated for an arbitrary SIRSN-RRF initial state. Recurrence for the stationary version does not automatically transfer to a fixed initial state, especially because the paper notes in Section 4 that the invariant measure for the quenched chain is infinite and that no stationary version of Z itself exists. An extension argument from stationary initial conditions to the asserted almost-sure statement for general starts is missing.

minor comments (3)

[§2, before Lemma 12] The sentence 'exploitation of delineated structure as expressed in Theorem 2' should refer to Theorem 5, since the paper has no Theorem 2 at that point.
[§3, Remark 15] Remark 15 refers to 'Deﬁnition 23' for Euclidean-invariance properties that are introduced in Deﬁnition 18; the cross-reference appears to be off by five.
[Throughout] There are numerous typographical and formatting artifacts, such as 'rˆole', 'c` adl` ag', and inconsistent use of 'deﬁcit' versus 'defect'; these should be cleaned up before publication.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the critical-exponent analysis and speed-neighbourhood recurrence are derived from the stated Poisson-line axioms, Slivnyak-Mecke conditioning and self-contained ergodic arguments, not from fitted values or self-citation chains.

full rationale

The derivation chain is self-contained up to the stated axioms. Theorem 22 obtains the power-law form κ(L)=v(L)^α from similarity equivariance together with Theorem 21, which is proved in the paper from translation invariance of the Poisson line process; no parameter is fitted to data. The stationary law of the relative environment in Theorem 27 and the asymmetric-Laplace log-relative-speed density of Corollary 28 are computed explicitly from the intensity measure via Slivnyak-Mecke, and the critical value α=2(γ−1) is obtained by setting the mean of that derived density to zero. The Kesten-Spitzer-Whitman step is not cited as a black box: Theorem 29 is proved directly in the paper. Theorem 31 then combines these ingredients, and the 'existence' of the SIRSN-RRF is by explicit construction in Definition 23 and Theorem 16, not by assuming the desired recurrence. The conjecture is used only as motivation, not as an input. The paper also does not rely on a load-bearing self-citation: references to Kendall (2017) and Kahn (2016) supply external background results on Poisson-line SIRSNs and Π-paths. The genuinely problematic point is Theorem 30: the proof asserts without detailed justification that a bounded harmonic function h on the relative environment reduces to a similarity-invariant H(Π), and then invokes Theorem 21 to conclude H(Π) is non-random, even though Theorem 21 concerns functions of a distinguished line and pattern rather than arbitrary similarity-invariant functions of the pattern alone. Section 4 itself notes that the countable set of intersection angles is time-constant and that the reduced environment is far from irreducible, so the missing argument is real. However, this is a mathematical gap or omitted proof in the ergodicity argument, not a case where a prediction is equivalent to its input by construction, a fitted parameter is renamed as a prediction, or a conclusion is forced by a self-citation. The paper's central derivation therefore contains no identifiable circularity, and the honest finding is a score of 0.

Assumptions & free parameters 1 free parameters · 4 assumptions · 0 invented entities

The central results rest on standard stochastic geometry tools and on explicit modeling assumptions. The only genuine free parameter is α, whose critical value is derived from the zero-mean condition. No new particles, forces, or physical entities are introduced.

free parameters (1)

α (scattering exponent) = 2(γ−1) in the critical case; general range α > γ−1
The entire family of SIRSN-RRF is parametrized by α, which controls the acceptance probability for switching to a slower line. It is chosen by hand as part of the model definition; the critical value is selected to make the mean log-relative speed zero.

assumptions (4)

domain assumption Poisson line SIRSN with intensity measure ν(dv dr dθ) = (γ−1)/2 * v^(−γ) dv dr dθ, γ>2 (or γ=2 as SIRSN candidate), is a valid SIRSN (Kendall 2017; Kahn 2016).
The paper relies on the existence and properties of the Poisson line SIRSN as established in prior work; this is the environment in which the random flight is studied.
ad hoc to paper Similarity-equivariance and zero deficit (Def. 18 and Theorem 22) restrict the scattering process to a one-parameter family.
These are modeling choices made to single out a natural family of SIRSN-RRF; they are not forced by data or external first principles, though they are motivated by symmetry considerations.
ad hoc to paper The scattering process is a balanced delineated reversible scattering process (ω = 1/2, zero deficits).
This structural assumption allows the clean representation of transition probabilities via scattering probabilities and κ(E), and is used throughout the derivation of the stationary distribution.
standard math Standard tools: Slivnyak-Mecke theorem, Birkhoff ergodic theorem, Kesten-Spitzer-Whitman range theorem, and Kozlov's ergodicity argument.
These external theorems are invoked as black boxes for Palm conditioning, ergodic limits, recurrence, and harmonic function arguments.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Rayleigh Random Flights on the Poisson line SIRSN." pith.science (2026). https://pith.science/paper/AG62SD2B

@misc{pith2026190808481,
  author       = {Pith},
  title        = {Pith review of: Rayleigh Random Flights on the Poisson line SIRSN},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AG62SD2B}},
  note         = {Machine review of arXiv:1908.08481}
}

read the original abstract

We study scale-invariant Rayleigh Random Flights ("RRF") in random environments given by planar Scale-Invariant Random Spatial Networks ("SIRSN") based on speed-marked Poisson line processes. A natural one-parameter family of such RRF (with scale-invariant dynamics) can be viewed as producing "randomly-broken local geodesics" on the SIRSN; we aim to shed some light on a conjecture that a (non-broken) geodesic on such a SIRSN will never come to a complete stop en route. (If true, then all such geodesics can be represented as doubly-infinite sequences of sequentially connected line segments. This would justify a natural procedure for computing geodesics.) The family of these RRF ("SIRSNRRF"), is introduced via a novel axiomatic theory of abstract scattering representations for Markov chains (itself of independent interest). Palm conditioning (specifically the Mecke-Slivnyak theorem for Palm probabilities of Poisson point processes) and ideas from the ergodic theory of random walks in random environments are used to show that at a critical value of the parameter the speed of the scale-invariant SIRSNRRF neither diverges to infinity nor tends to zero, thus supporting the conjecture.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

25 extracted references · 14 canonical work pages

[1]

Scale- Invariant Random Spatial Networks

D J Aldous. Scale- Invariant Random Spatial Networks . Electronic Journal of Probability, 19: 0 no. 15, 1--41, 2014. doi:10.1214/EJP.v19-2920

work page doi:10.1214/ejp.v19-2920 2014
[2]

On countable dense random sets

D J Aldous and M T Barlow. On countable dense random sets. Lecture Notes in Mathematics, 850: 0 311--327, 1981

work page 1981
[3]

True scale-invariant random spatial networks

D J Aldous and K Ganesan. True scale-invariant random spatial networks. Proceedings of the National Academy of Sciences of the United States of America, 110 0 (22): 0 8782--8785, 2013. ISSN 1091-6490. doi:10.1073/pnas.1304329110

work page doi:10.1073/pnas.1304329110 2013
[4]

Statistical models based on counting processes

P K Andersen, Borgan, R D Gill, and Niels Keiding. Statistical models based on counting processes. Springer Series in Statistics. Springer-Verlag, New York, 1993. doi:10.1007/978-1-4612-4348-9

doi:10.1007/978-1-4612-4348-9 1993
[5]

Rigidity for Markovian maximal couplings of elliptic diffusions

S Banerjee and W S Kendall. Rigidity for Markovian maximal couplings of elliptic diffusions. Probability Theory and Related Fields, 168 0 (1): 0 55--112, 2017. doi:10.1007/s00440-016-0706-4

work page doi:10.1007/s00440-016-0706-4 2017
[6]

On Walsh 's Brownian motions

M T Barlow, J W Pitman, and M Yor. On Walsh 's Brownian motions. S \'e minaire de Probabilit \'e s XXIII , pages 275--293, 1989. doi:10.1007/BFb0083979

doi:10.1007/bfb0083979 1989
[7]

Diffusion in planar Liouville quantum gravity

N Berestycki. Diffusion in planar Liouville quantum gravity. Annales de l'Institut Henri Poincar \'e , Probabilit \'e s et Statistiques , 51 0 (3): 0 947--964, 2015. doi:10.1214/14-AIHP605

doi:10.1214/14-aihp605 2015
[8]

The Zig - Zag Process and Super - Efficient Sampling for Bayesian Analysis of Big Data

J Bierkens, P Fearnhead, and G O Roberts. The Zig - Zag Process and Super - Efficient Sampling for Bayesian Analysis of Big Data . Annals of Statistics, 47 0 (3): 0 1288--1320, 2016. doi:10.1214/18-AOS1715

doi:10.1214/18-aos1715 2016

Show all 25 references

[9]

The distributions of the smallest disks containing the P oisson- V oronoi typical cell and the C rofton cell in the plane

P Calka. The distributions of the smallest disks containing the P oisson- V oronoi typical cell and the C rofton cell in the plane. Adv. in Appl. Probab., 34 0 (4): 0 702--717, 2002. doi:10.1239/aap/1037990949

2002
[10]

Stochastic geometry and its applications

S N Chiu, D Stoyan, W S Kendall, and J Mecke. Stochastic geometry and its applications. Wiley Series in Probability and Statistics. John Wiley & Sons, Ltd., Chichester, third edition, 2013. doi:10.1002/9781118658222

2013 doi
[11]

Piecewise- Deterministic Markov Processes : A General Class of Non - Diffusion Stochastic Models

M H A Davis. Piecewise- Deterministic Markov Processes : A General Class of Non - Diffusion Stochastic Models . Journal of the Royal Statistical Society (Series B: Methodology), 46 0 (3): 0 353--388, 1984

1984
[12]

Liouville Brownian motion

C Garban, R Rhodes, and V Vargas. Liouville Brownian motion. The Annals of Probability, 44 0 (4): 0 3076--3110, 2016. doi:10.1214/15-AOP1042

2016 doi
[13]

Markov Chain Monte Carlo in Practice

W R Gilks, S Richardson, and D J Spiegelhalter. Markov Chain Monte Carlo in Practice . Chapman & Hall/CRC , 1995. doi:doi.org/10.1201/b14835

1995 doi
[14]

Continuous Univariate Distributions Volume 2

N L Johnson, S Kotz, and N Balakrishnan. Continuous Univariate Distributions Volume 2 . John Wiley & Sons Ltd , second edition, 1995. ISBN 0-471-58495-9. doi:10.1016/0167-9473(96)90015-8

1995 doi
[15]

Improper Poisson line process as SIRSN in any dimension

J Kahn. Improper Poisson line process as SIRSN in any dimension. Annals of Probability, 44 0 (4): 0 2694--2725, 2016. ISSN 00911798. doi:10.1214/15-AOP1032

2016 doi
[16]

Foundations of modern probability

O Kallenberg. Foundations of modern probability. Probability and its Applications (New York). Springer-Verlag, New York, second edition, 2002. ISBN 0-387-95313-2. doi:10.1007/978-1-4757-4015-8

2002 doi
[17]

Reversibility and Stochastic Networks

F P Kelly. Reversibility and Stochastic Networks . John Wiley & Sons , Cambridge ; New York , 1979. ISBN 978-1-107-40115-0

1979
[18]

Stationary countable dense random sets

W S Kendall. Stationary countable dense random sets. Advances in Applied Probability, 32 0 (1): 0 86--100, 2000. doi:10.1239/aap/1013540024

2000
[19]

From Random Lines to Metric Spaces

W S Kendall. From Random Lines to Metric Spaces . Annals of Probability, 45 0 (1): 0 469--517, 2017. doi:10.1214/14-AOP935

2017 doi
[20]

One-dimensional classical scattering processes and the diffusion limit

W S Kendall and M Westcott. One-dimensional classical scattering processes and the diffusion limit. Advances in Applied Probability, 19: 0 81--105, 1987. doi:10.2307/1427374

1987 doi
[21]

The method of averaging and walks in inhomogeneous environments

S M Kozlov. The method of averaging and walks in inhomogeneous environments. Russian Mathematical Surveys, 40 0 (2): 0 73--145, 1985. doi:10.1070/RM1985v040n02ABEH003558

1985 doi
[22]

Fractals: Form, Chance and Dimension

B B Mandelbrot. Fractals: Form, Chance and Dimension . W.H.Freeman & Co Ltd, San Francisco, 1977. ISBN 978-0716704737

1977
[23]

Probability: The Classical Limit Theorems

H P McKean. Probability: The Classical Limit Theorems. Cambridge University Press, Cambridge , 2014. doi:10.1017/CBO9781107282032

2014 doi
[24]

The Problem of the Random Walk

K Pearson. The Problem of the Random Walk . Nature, 72: 0 294, 1905. doi:10.1038/072294b0

1905 doi
[25]

Principles of Random Walk, volume 34 of Graduate Texts in Mathematics

F Spitzer. Principles of Random Walk, volume 34 of Graduate Texts in Mathematics . Springer New York , New York, NY , 1976. ISBN 978-1-4757-4229-9

1976

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.

[1] [1]

Scale- Invariant Random Spatial Networks

D J Aldous. Scale- Invariant Random Spatial Networks . Electronic Journal of Probability, 19: 0 no. 15, 1--41, 2014. doi:10.1214/EJP.v19-2920

work page doi:10.1214/ejp.v19-2920 2014

[2] [2]

On countable dense random sets

D J Aldous and M T Barlow. On countable dense random sets. Lecture Notes in Mathematics, 850: 0 311--327, 1981

work page 1981

[3] [3]

True scale-invariant random spatial networks

D J Aldous and K Ganesan. True scale-invariant random spatial networks. Proceedings of the National Academy of Sciences of the United States of America, 110 0 (22): 0 8782--8785, 2013. ISSN 1091-6490. doi:10.1073/pnas.1304329110

work page doi:10.1073/pnas.1304329110 2013

[4] [4]

Statistical models based on counting processes

P K Andersen, Borgan, R D Gill, and Niels Keiding. Statistical models based on counting processes. Springer Series in Statistics. Springer-Verlag, New York, 1993. doi:10.1007/978-1-4612-4348-9

doi:10.1007/978-1-4612-4348-9 1993

[5] [5]

Rigidity for Markovian maximal couplings of elliptic diffusions

S Banerjee and W S Kendall. Rigidity for Markovian maximal couplings of elliptic diffusions. Probability Theory and Related Fields, 168 0 (1): 0 55--112, 2017. doi:10.1007/s00440-016-0706-4

work page doi:10.1007/s00440-016-0706-4 2017

[6] [6]

On Walsh 's Brownian motions

M T Barlow, J W Pitman, and M Yor. On Walsh 's Brownian motions. S \'e minaire de Probabilit \'e s XXIII , pages 275--293, 1989. doi:10.1007/BFb0083979

doi:10.1007/bfb0083979 1989

[7] [7]

Diffusion in planar Liouville quantum gravity

N Berestycki. Diffusion in planar Liouville quantum gravity. Annales de l'Institut Henri Poincar \'e , Probabilit \'e s et Statistiques , 51 0 (3): 0 947--964, 2015. doi:10.1214/14-AIHP605

doi:10.1214/14-aihp605 2015

[8] [8]

The Zig - Zag Process and Super - Efficient Sampling for Bayesian Analysis of Big Data

J Bierkens, P Fearnhead, and G O Roberts. The Zig - Zag Process and Super - Efficient Sampling for Bayesian Analysis of Big Data . Annals of Statistics, 47 0 (3): 0 1288--1320, 2016. doi:10.1214/18-AOS1715

doi:10.1214/18-aos1715 2016