Related papers: Existence Proofs of Some EXIT Like Functions
We compute the logarithmic asymptotics of the non-existence probability (and more generally the lower-tail probability) for a wide variety of combinatorial problems for a range of parameters in the `critical regime' between the regime…
Preliminary results of our analysis on the extended emission of short/medium duration GRBs observed with Swift/BAT are presented. The Bayesian blocks algorithm is used to analyze the burst durations and the temporal structure of the…
Golumbic, Lipshteyn and Stern \cite{Golumbic-epg} proved that every graph can be represented as the edge intersection graph of paths on a grid (EPG graph), i.e., one can associate with each vertex of the graph a nontrivial path on a…
We revisit a problem considered by Chow and Hale on the existence of subharmonic solutions for perturbed systems. In the analytic setting, under more general (weaker) conditions, we prove their results on the existence of bifurcation curves…
A Barak-Erd\H{o}s graph is a directed acyclic version of the Erd\H{o}s-R\'enyi random graph. It is obtained by performing independent bond percolation with parameter $p$ on the complete graph with vertices $\{1,...,n\}$, in which the edge…
We describe a new neural-net based light curve classifier and provide it with documentation as a ready-to-use tool for the community. While optimized for identification and classification of eclipsing binary stars, the classifier is general…
A fundamental problem in pattern avoidance is describing the asymptotic behavior of the extremal function and its generalizations. We prove an equivalence between the asymptotics of the graph extremal function for a class of bipartite…
The Gross-Pitaevskii equation with a local cubic nonlinearity that describes a many-dimensional system in an external field is considered in the framework of the complex WKB-Maslov method. Analytic asymptotic solutions are constructed in…
Many models of interest in the natural and social sciences have no closed-form likelihood function, which means that they cannot be treated using the usual techniques of statistical inference. In the case where such models can be…
We present a set of conditions which, if satisfied, provide for a complete asymptotic analysis of random matrices with source term containing two distinct eigenvalues. These conditions are shown to be equivalent to the existence of a…
We consider the classical problem of existence, uniqueness and asymptotics of monotone solutions to the travelling wave equation associated to the parabolic semi-group equation of a super-Brownian motion with a general branching mechanism.…
Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…
Bidirectional transport in (quasi) one-dimensional systems generically leads to cluster-formation and small particle currents. This kind of transport can be described by the asymmetric simple exclusion process (ASEP) with two species of…
Exponential random graph models are an important tool in the statistical analysis of data. However, Bayesian parameter estimation for these models is extremely challenging, since evaluation of the posterior distribution typically involves…
We consider the distribution of cycle counts in a random regular graph, which is closely linked to the graph's spectral properties. We broaden the asymptotic regime in which the cycle counts are known to be approximately Poisson, and we…
In statistical network analysis, models for binary adjacency matrices satisfying vertex exchangeability are commonly used. However, such models may fail to capture key features of the data-generating process when interactions, rather than…
Many important stochastic counting models can be written as general birth-death processes (BDPs). BDPs are continuous-time Markov chains on the non-negative integers and can be used to easily parameterize a rich variety of probability…
Regularized system identification is the major advance in system identification in the last decade. Although many promising results have been achieved, it is far from complete and there are still many key problems to be solved. One of them…
We propose a Graph Neural Network with greater expressive power than commonly used GNNs - not constrained to only differentiate between graphs that Weisfeiler-Lehman test recognizes to be non-isomorphic. We use a graph attention network…
This paper proposes a new notion of typical sequences on a wide class of abstract alphabets (so-called standard Borel spaces), which is based on approximations of memoryless sources by empirical distributions uniformly over a class of…