English
Related papers

Related papers: Dispersed Dyck paths revisited

200 papers

The evasion paths problem asks when a dynamically changing space can be navigated: imagine guards are patrolling a region, for instance, and we need to stay outside their view. We use the Bousfield-Kan spectral sequence for homotopy inverse…

Algebraic Topology · Mathematics 2022-11-14 Gunnar Carlsson , Benjamin Filippenko , Wyatt Mackey

Directed acyclic graphs are a fundamental class of networks that includes citation networks, food webs, and family trees, among others. Here we define a random graph model for directed acyclic graphs and give solutions for a number of the…

Physics and Society · Physics 2009-03-23 Brian Karrer , M. E. J. Newman

We study the behavior of network diffusions based on the PageRank random walk from a set of seed nodes. These diffusions are known to reveal small, localized clusters (or communities) and also large macro-scale clusters by varying a…

Social and Information Networks · Computer Science 2016-07-06 Kyle Kloster , David F. Gleich

A delayed term in a differential equation reflects the fact that information takes significant time to travel from one place to another within a process being studied. Despite de apparent similarity with ordinary differential equations,…

Dynamical Systems · Mathematics 2023-08-24 Gregory Kozyreff

A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.

Combinatorics · Mathematics 2021-12-22 Vsevolod Chernyshev , Anton Tolchennikov

Similarly to $\beta$-adic van der Corput sequences, abstract van der Corput sequences can be defined for abstract numeration systems. Under some assumptions, these sequences are low discrepancy sequences. The discrepancy function is…

Number Theory · Mathematics 2010-01-23 Wolfgang Steiner

We define and study the statistical models in exponential family form whose sufficient statistics are the degree distributions and the bi-degree distributions of undirected labelled simple graphs. Graphs that are constrained by the joint…

Statistics Theory · Mathematics 2014-11-17 Kayvan Sadeghi , Alessandro Rinaldo

For an arbitrary initial configuration of discrete loads over vertices of a distributed graph, we consider the problem of minimizing the {\em discrepancy} between the maximum and minimum loads among all vertices. For this problem, this…

Data Structures and Algorithms · Computer Science 2018-05-15 Takeharu Shiraga

We study deformations of plane curves in the similarity geometry. It is known that continuous deformations of smooth curves are described by the Burgers hierarchy. In this paper, we formulate the discrete deformation of discrete plane…

Exactly Solvable and Integrable Systems · Physics 2016-03-15 Kenji Kajiwara , Toshinobu Kuroda , Nozomu Matsuura

As a prominent attribution-based explanation algorithm, Integrated Gradients (IG) is widely adopted due to its desirable explanation axioms and the ease of gradient computation. It measures feature importance by averaging the model's output…

Computation and Language · Computer Science 2021-09-01 Soumya Sanyal , Xiang Ren

Starting from the hypothesis that both physics, in particular space-time and the physical vacuum, and the corresponding mathematics are discrete on the Planck scale we develop a certain framework in form of a class of ' cellular networks'…

High Energy Physics - Theory · Physics 2016-09-06 Manfred Requardt

We revisit the asymptotic bias analysis of the distributed Pareto optimization algorithm developed based on the diffusion strategies. We propose an alternative way to analyze the asymptotic bias of this algorithm at small step-sizes and…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-06-07 Reza Arablouei , Kutluyıl Doğançay , Stefan Werner , Yih-Fang Huang

We investigate a natural Heyting algebra structure on the set of Dyck paths of the same length. We provide a geometrical description of the operations of pseudocomplement and relative pseudocomplement, as well as of regular elements. We…

Combinatorics · Mathematics 2015-03-18 Luca Ferrari

We investigate the computational complexity of finding temporally disjoint paths or walks in temporal graphs. There, the edge set changes over discrete time steps and a temporal path (resp. walk) uses edges that appear at monotonically…

Data Structures and Algorithms · Computer Science 2021-05-25 Nina Klobas , George B. Mertzios , Hendrik Molter , Rolf Niedermeier , Philipp Zschoche

Physical systems evolve from one state to another along paths of least energy barrier. Without a priori knowledge of the energy landscape, multidimensional search methods aim to find such minimum energy pathways between the initial and…

PaPy, which stands for parallel pipelines in Python, is a highly flexible framework that enables the construction of robust, scalable workflows for either generating or processing voluminous datasets. A workflow is created from user-written…

Programming Languages · Computer Science 2014-07-17 Marcin Cieslik , Cameron Mura

The notion of symmetric and asymmetric peaks in Dyck paths was introduced by Fl\'orez and Rodr\'{\i}guez, who counted the total number of such peaks over all Dyck paths of a given length. In this paper we generalize their results by giving…

Combinatorics · Mathematics 2020-08-14 Sergi Elizalde

Ternary paths consist of an up-step of one unit, a down-step of two units, never go below the $x$-axis, and return to the $x$-axis. This paper addresses the enumeration of partial ternary paths, ending at a given level $i$, reading the path…

Combinatorics · Mathematics 2020-09-30 Helmut Prodinger

Diffuse two-dimensional integer-valued arrays are demonstrated that have delta-like aperiodic autocorrelation and, simultaneously, the array sums form delta-like projections along several directions. The delta-projected views show a single…

Image and Video Processing · Electrical Eng. & Systems 2021-11-15 I. D. Svalbe , D. M. Paganin , T. C. Petersen

This tutorial article showcases the many varieties and uses of quantum walks. Discrete time quantum walks are introduced as counterparts of classical random walks. The emphasis is on the connections and differences between the two types of…

Quantum Physics · Physics 2013-05-16 Daniel Reitzner , Daniel Nagaj , Vladimir Buzek