Related papers: Distance from marker sequences in locally finite B…
In this paper, we investigate some geometric properties of non-smooth random curves within a stochastic flow. We consider a polygonal line $\Gamma(\vec{u}_{1},\cdots,\vec{u}_{n})$, which connects the points…
This note concerns a nonlinear ill-posedness of the Prandtl equation and an invalidity of asymptotic boundary-layer expansions of incompressible fluid flows near a solid boundary. Our analysis is built upon recent remarkable linear…
We investigate when a Borel graph admits a (Borel or measurable) orientation with outdegree bounded by $k$ for various cardinals $k$. We show that for a p.m.p. graph $G$, a measurable orientation can be found when $k$ is larger than the…
Using tools and results from geometric measure theory, we give a simple new proof of the main result (Theorem 1.3) in K. Kondo and M. Tanaka, Approximation of Lipschitz Maps via Immersions and Differentiable Exotic Sphere Theorems,…
Let $Z(G)$ be the centre of a finite non-abelian group $G.$ The non-commuting graph of $G$ is a simple undirected graph with vertex set $G\setminus Z(G),$ and two vertices $u$ and $v$ are adjacent if and only if $uv\ne vu.$ In this paper,…
The main result of this article is: THEOREM. Every homogeneous locally conical connected separable metric space that is not a $1$-manifold is strongly $n$-homogeneous for each $n \geq 2$ and countable dense homogeneous. Furthermore,…
In this paper, all graphs are assumed to be finite. For $s\geq 1$ and a graph $\G$, if for every pair of isomorphic connected induced subgraphs on at most $s$ vertices there exists an automorphism of $\G$ mapping the first to the second,…
We say that $f:[0,1]\to [0,1]$ is a {\it piecewise continuous interval map} if there exists a partition $0=x_0<x_1<\cdots<x_{d}<x_{d+1}=1$ of $[0,1]$ such that $f\vert_{(x_{i-1},x_i)}$ is continuous and the lateral limits $w_0^+=\lim_{x\to…
In this paper, we consider a non-local approximation of the time-dependent Eikonal equation defined on a Riemannian manifold. We show that the local and the non-local problems are well-posed in the sense of viscosity solutions and we prove…
Completing a strategy of Gou\"ezel and Lalley, we prove a local limit theorem for the random walk generated by any symmetric finitely supported probability measure on a non-elementary Gromov-hyperbolic group: denoting by $R$ the inverse of…
We study criteria attesting that a given graph can not be embedded in the plane so that neighboring vertices are at unit distance apart and the straight line edges do not cross.
The survey covers several topics related to the asymptotic structure of various combinatorial and analytic objects such as the path spaces in graded graphs (Bratteli diagrams), invariant measures with respect to countable groups, etc. The…
We generalize [Vav] to give sufficient conditions, primarily on coarse geometry, to ensure that a subset of a Cayley graph is a finite Hausdorff distance from a subgroup. Using this result, we prove a partial converse to the Flat Torus…
We prove that for a non-amenable, locally finite, connected, transitive, planar graph with one end, any automorphism invariant site percolation on the graph does not have exactly 1 infinite 1-cluster and exactly 1 infinite 0-cluster a.s. If…
Two major milestones on the road to the full complexity dichotomy for finite-domain constraint satisfaction problems were Bulatov's proof of the dichotomy for conservative templates, and the structural dichotomy for smooth digraphs of…
We provide proofs of the following theorems by considering the entropy of random walks: Theorem 1.(Alon, Hoory and Linial) Let G be an undirected simple graph with n vertices, girth g, minimum degree at least 2 and average degree d: Odd…
We consider graphs made of one-dimensional wires connected at vertices and on which may live a scalar potential. We are interested in a scattering situation where the graph is connected to infinite leads. We investigate relations between…
Network-topology inference from (vertex) signal observations is a prominent problem across data-science and engineering disciplines. Most existing schemes assume that observations from all nodes are available, but in many practical…
We study nonconcentration of hitting times for simple random walk on finite graphs. We prove that, for every connected graph with $n$ vertices, \[ \operatorname{Var}_x(\tau_y)+\mathbb E_x\tau_y \ge \frac{(\mathbb E_x\tau_y)^2}{1+\log n}, \]…
Let $K$ be a number field not containing a CM subfield. For any smooth projective curve $Y/K$ of genus $\geq2$, we prove that the image of the "Selmer" part of Grothendieck's section set inside the $K_v$-rational points $Y(K_v)$ is finite…