English
Related papers

Related papers: Semi-Poisson nearest-neighbor distance statistics …

200 papers

We study the return probability for the Anderson model on the random regular graph and give evidence of the existence of two distinct phases: a fully ergodic and nonergodic one. In the ergodic phase, the return probability decays…

Disordered Systems and Neural Networks · Physics 2019-12-02 Soumya Bera , Giuseppe De Tomasi , Ivan M. Khaymovich , Antonello Scardicchio

The planar-diagrammatic technique of large-$N$ random matrices is extended to evaluate averages over the circular ensemble of unitary matrices. It is then applied to study transport through a disordered metallic ``grain'', attached through…

Condensed Matter · Physics 2009-10-28 N. Argaman , A. Zee

Disorder and noise in physical systems often disrupt spatial and temporal regularity, yet chaotic systems reveal how order can emerge from unpredictable behavior. Complex networks, spatial analogs of chaos, exhibit disordered, non-Euclidean…

Statistical Mechanics · Physics 2025-04-17 Pablo Villegas

We have generalized the scattering-matrix theory of multiple Andreev reflections in mesoscopic Josephson junctions to the multi-mode case, and applied it to short superconductor/normal metal/superconductor junctions with diffusive electron…

Superconductivity · Physics 2008-02-03 Athanassios Bardas , Dmitri V. Averin

We study quasiperiodically forced circle endomorphisms, homotopic to the identity, and show that under suitable conditions these exhibit uncountably many minimal sets with a complicated structure, to which we refer to as `strangely…

Dynamical Systems · Mathematics 2009-11-13 P. Glendinning , T. Jaeger , J. Stark

We theoretically study transport in two-dimensional semimetals. Typically, electron and hole puddles emerge in the transport layer of these systems due to smooth fluctuations in the potential. We calculate the electric response of the…

Mesoscale and Nanoscale Physics · Physics 2014-10-29 Michael Knap , Jay D. Sau , Bertrand I. Halperin , Eugene Demler

For a distribution advected by a simple chaotic map with diffusion, the "strange eigenmode" is investigated from the Lagrangian (material) viewpoint and compared to its Eulerian (spatial) counterpart. The eigenmode embodies the balance…

Chaotic Dynamics · Physics 2007-12-12 Jean-Luc Thiffeault

We define the Wiener-entropy, which is together with the eccentricity-entropy one of the most natural distance-based graph entropies. By deriving the (asymptotic) extremal behaviour, we conclude that the Wiener-entropy of graphs of a given…

Combinatorics · Mathematics 2024-12-17 Stijn Cambie , Yanni Dong

The $2$-Wasserstein distance is sensitive to minor geometric differences between distributions, making it a very powerful dissimilarity metric. However, due to this sensitivity, a small outlier mass can also cause a significant increase in…

Machine Learning · Computer Science 2024-06-04 Sharath Raghvendra , Pouyan Shirzadian , Kaiyi Zhang

It is shown that there exists a sequence of 3-regular graphs $\{G_n\}_{n=1}^\infty$ and a Hadamard space $X$ such that $\{G_n\}_{n=1}^\infty$ forms an expander sequence with respect to $X$, yet random regular graphs are not expanders with…

Metric Geometry · Mathematics 2015-11-03 Manor Mendel , Assaf Naor

The behaviour of the 2D model system - the Ikeda map - is investigated in the weakly dissipative regime under external forcing on the incommensurate frequency. Coexistence of a large number of stable invariant curves is shown. Dependence of…

Chaotic Dynamics · Physics 2016-02-09 M. V. Pozdnyakov , A. V. Savin , D. V. Savin

In recent work, Jon Kleinberg considered a small-world network model consisting of a d-dimensional lattice augmented with shortcuts. The probability of a shortcut being present between two points decays as a power of the distance between…

Probability · Mathematics 2007-05-23 M. Draief , A. Ganesh

A semi-discretization in time, according to a full implicit Euler scheme, for a 2D dissipative quasi geostrophic equation, is studied. We prove existence, uniqueness and regularity results of the solution to the predicted discretization, in…

Numerical Analysis · Mathematics 2011-06-28 Maithem Moalla-Trabelsi , Ezzeddine Zahrouni

Hidden attractors are present in many nonlinear dynamical systems and are not associated with equilibria, making them difficult to locate. Recent studies have demonstrated methods of locating hidden attractors, but the route to these…

The vertex-random graphs called proximity catch digraphs (PCDs) have been introduced recently and have applications in pattern recognition and spatial pattern analysis. A PCD is a random directed graph (i.e., digraph) which is constructed…

Probability · Mathematics 2014-05-29 Elvan Ceyhan

In Dirac materials, the low energy excitations behave like ultra-relativistic massless particles with linear energy dispersion. A particularly intriguing phenomenon arises with the intrinsic charge transport behavior at the Dirac point…

Mesoscale and Nanoscale Physics · Physics 2016-07-12 Piranavan Kumaravadivel , Xu Du

We quantify superdiffusive transience for a two-dimensional random walk in which the vertical coordinate is a martingale and the horizontal coordinate has a positive drift that is a polynomial function of the individual coordinates and of…

Probability · Mathematics 2024-07-03 Conrado da Costa , Mikhail Menshikov , Vadim Shcherbakov , Andrew Wade

Continuing the study of Hamiltonian pseudo-rotations of projective spaces, we focus on the conjecture that the fixed-point data set (the actions and the linearized flows at one-periodic orbits) of a pseudo-rotation exactly matches that data…

Symplectic Geometry · Mathematics 2021-01-12 Viktor L. Ginzburg , Basak Z. Gurel

Wang et al. [PNAS 106 (2009) 15160] have found that in several systems the linear time dependence of the mean-square displacement (MSD) of diffusing colloidal particles, typical of normal diffusion, is accompanied by a non-Gaussian…

Statistical Mechanics · Physics 2015-06-19 Mykyta V. Chubynsky , Gary W. Slater

We formulate and study the thinnest path problem in wireless ad hoc networks. The objective is to find a path from a source to its destination that results in the minimum number of nodes overhearing the message by a judicious choice of…

Networking and Internet Architecture · Computer Science 2013-08-08 Jianhang Gao , Qing Zhao , Ananthram Swami