English
Related papers

Related papers: Meeting time distributions in Bernoulli systems

200 papers

We consider the Bernoulli first-passage percolation on $\mathbb Z^d (d\ge 2)$. That is, the edge passage time is taken independently to be 1 with probability $1-p$ and 0 otherwise. Let ${\mu(p)}$ be the time constant. We prove in this paper…

Probability · Mathematics 2008-07-13 Xian-Yuan Wu , Ping Feng

Kepler will monitor enough stars that it is likely to detect single transits of planets with periods longer than the mission lifetime. We show that by combining the Kepler photometry of such transits with precise radial velocity (RV)…

Astrophysics · Physics 2009-11-13 Jennifer C. Yee , B. Scott Gaudi

We propose a definition of phase transitions in finite systems based on topology anomalies of the event distribution in the space of observations. This generalizes all the definitions based on the curvature anomalies of thermodynamical…

Statistical Mechanics · Physics 2009-10-31 Ph. Chomaz , F. Gulminelli , V. Duflot

This paper develops a new method for analyzing nonlinear diffusion equations of porous--medium type with time-dependent growth rates, based on the \emph{localization of solutions} through an associated Bernoulli-type ordinary differential…

Analysis of PDEs · Mathematics 2026-03-17 Dragos-Patru Covei

We report in this paper a new exponential relation distance of planets in the newly discovered exoplanetary system of the Trappist-1 star, and we comment on near orbital mean motion resonances among the seven planets. We predict that…

Instrumentation and Methods for Astrophysics · Physics 2017-03-20 Vladimir Pletser , Lorenzo Basano

We consider an interacting particle system where equal-sized populations of two types of particles move by random walk steps on a graph, the two types may have different speeds, and meetings of opposite-type particles result in…

Probability · Mathematics 2026-05-07 John Haslegrave , Peter Keevash

We consider random walks on a tree $G=(V,E)$ with stationary distribution $\pi_v = \mathrm{deg}(v)/2|E|$ for $v \in V$. Let the hitting time $H(v,w)$ denote the expected number of steps required for the random walk started at vertex $v$ to…

Combinatorics · Mathematics 2025-10-29 Andrew Beveridge , Ari Holcombe Pomerance

We consider a finite number of particles characterised by their positions and velocities. At random times a randomly chosen particle, the follower, adopts the velocity of another particle, the leader. The follower chooses its leader…

Analysis of PDEs · Mathematics 2016-03-23 Adrien Blanchet , Pierre Degond

We consider the extinction time of the contact process on increasing sequences of finite graphs obtained from a variety of random graph models. Under the assumption that the infection rate is above the critical value for the process on the…

Probability · Mathematics 2018-06-13 Bruno Schapira , Daniel Valesin

Many multiple-planet systems have been found by the Kepler transit survey and various radial velocity (RV) surveys. Kepler planets show an asymmetric feature, namely, there are small but significant deficits/excesses of planet pairs with…

Earth and Planetary Astrophysics · Physics 2016-09-29 Ji-Wei Xie

Systems with a long-term stationary state that possess as a spatio-temporally fluctuation quantity $\beta$ can be described by a superposition of several statistics, a "super statistics". We consider first, the Gamma, log-normal and…

Statistical Mechanics · Physics 2015-06-05 O. Obregón , A. Gil-Villegas

Time-dependent potentials are common in galactic systems that undergo significant evolution, interactions, or encounters with other galaxies, or when there are dynamic processes like star formation and merging events. Recent studies show…

Astrophysics of Galaxies · Physics 2025-02-04 Eduárd Illés , Dániel Jánosi , Tamás Kovács

Let $V(k)$ denote the waiting time, the number of trials needed to get a consecutive $k$ ones. We propose recurrence algorithms for the probability distribution function (pdf) and the probability generating function (pgf) of $V(k)$ in…

Probability · Mathematics 2022-10-18 Jungtaek Oh , Chongjin Park , Sungsu Kim

For a smooth expanding circle map, we show that the empirical distribution of Lyapunov exponents of periodic points of any fixed period is close to normal, with an error that decreases as the period grows. This establishes a version of the…

Dynamical Systems · Mathematics 2025-11-25 Kostiantyn Drach , Zhi Fu , Vadim Kaloshin , Zhiqiang Li , Carlangelo Liverani

Introduced by Mallows as a ranking model in statistics, Mallows permutation model is a class of non-uniform probability distributions on the symmetric group $S_n$. The model depends on a distance metric on $S_n$ and a scale parameter…

Probability · Mathematics 2023-12-27 Chenyang Zhong

Given an ergodic dynamical system $(X,T,\mu)$, and $U\subset X$ measurable with $\mu (U)>0$, let $\mu (U)\tau_U(x)$ denote the normalized hitting time of $x\in X$ to $U$. We prove that given a sequence $(U_n)$ with $\mu (U_n)\to 0$, the…

Dynamical Systems · Mathematics 2007-05-23 N. Haydn , Y. Lacroix , S. Vaienti

We consider a class of particle systems generalizing the $\beta$-Ensembles from random matrix theory. In these new ensembles, particles experience repulsion of power $\beta>0$ when getting close, which is the same as in the…

Probability · Mathematics 2014-01-28 Martin Venker

We provide a new proof of the sharpness of the phase transition for nearest-neighbour Bernoulli percolation. More precisely, we show that - for $p<p_c$, the probability that the origin is connected by an open path to distance $n$ decays…

Probability · Mathematics 2015-02-11 Hugo Duminil-Copin , Vincent Tassion

Transit times around single stars can be described well by a linear ephemeris. However, transit times in circumbinary systems are influenced both by the gravitational perturbations and the orbital phase variations of the central binary…

Earth and Planetary Astrophysics · Physics 2015-06-22 Hui-Gen Liu , Ying Wang , Hui Zhang , Ji-Lin Zhou

In this paper, we revisit the problem of classical \textit{meeting times} of random walks in graphs. In the process that two tokens (called agents) perform random walks on an undirected graph, the meeting times are defined as the expected…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-22 Ryota Eguchi , Fukuhito Ooshita , Michiko Inoue , Sébastien Tixeuil